Pattern to print X in a rectangular box

Given the value of length, print the X pattern in a box using # and ” ”

Examples:

Input  :   10 
Output :   ##########
           ##      ##
           # #    # #
           #  #  #  #
           #   ##   #
           #   ##   #
           #  #  #  #
           # #    # #
           ##      ##
           ##########
Input  :   7 
Output :   #######
           ##   ##
           # # # #  
           #  #  #
           # # # #
           ##   ##
           #######

Below is the implementation to print X in a rectangular box pattern :

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP code to print the above
// specified pattern
#include <bits/stdc++.h>
using namespace std;
  
// Function to print pattern
void pattern(int n)
{
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == 0 || i == n - 1 || 
                j == 0 || j == n - 1 || 
                i == j || i == n - 1 - j)             
                cout << "#";            
  
            else 
                cout << " ";
              
        }
  
        cout << endl;
    }
}
  
// Driver program
int main()
{
    int n = 9;
    pattern(n);
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code to print the above
// specified pattern
class GFG {
      
    // Function to print pattern
    static void pattern(int n)
    {
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++) 
            {
                if (i == 0 || i == n - 1 || 
                    j == 0 || j == n - 1 || 
                    i == j || i == n - 1 - j)             
                    System.out.print("#");         
      
                else
                    System.out.print(" ");
                  
            }
      
            System.out.println();
        }
    }
      
    // Driver Code
    public static void main(String args[])
    {
        int n = 9;
        pattern(n);;
          
    }
}
  
// This code is contributed by Sam007

chevron_right


Python 3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 code to print the above
# specified pattern
  
# Function to print pattern
def pattern(n):
  
    for i in range(0, n): 
        for j in range(0, n):
            if (i == 0 or i == n - 1 
                or j == 0 or j == n - 1 
                or i == j or i == n - 1 - j):         
                print( "#", end="") 
  
            else:
                print( " ",end="")
        print("")
          
# Driver program
n = 9
pattern(n)
  
# This code is contributed by Smitha.

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# code to print the above
// specified pattern
using System;
  
public class GFG {
  
    // Function to print pattern
    static void pattern(int n)
    {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i == 0 || i == n - 1 || 
                    j == 0 || j == n - 1 || 
                    i == j || i == n - 1 - j)             
                    Console.Write("#");         
      
                else
                    Console.Write(" ");
                  
            }
      
            Console.WriteLine();
        }
    }
      
    // Driver code
    public static void Main()
    {
        int n = 9;
        pattern(n);
    }
}
  
// This code is contributed by Sam007.

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP code to print the above
// specified pattern
  
// Function to print pattern
function pattern($n)
{
    for ($i = 0; $i < $n; $i++) {
        for ($j = 0; $j < $n; $j++) {
            if ($i == 0 || $i == $n - 1 || 
                $j == 0 || $j == $n - 1 || 
                $i == $j || $i == $n - 1 - $j)             
                echo "#";         
  
            else
                echo " ";
        }
  
        echo "\n";
    }
}
  
    // Driver Code
    $n = 9;
    pattern($n);
      
// This code is contributed by nitin mittal
?>

chevron_right


Output:

#########
##     ##
# #   # #
#  # #  #
#   #   #
#  # #  #
# #   # #
##     ##
#########


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.