Pattern of 1’s inside 0’s
Given the value of n, i.e, the number of rows/columns in a square, print the pattern.
Examples :
Input : n = 8
Output :
0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 0 0 0 0 0 0 0
Input : n = 10
Output :
0 0 0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 0 0 0 0 0 0 0 0 0
C++
#include <bits/stdc++.h>
using namespace std;
void print_pattern( int n)
{
int k = 1, m = n;
int zero = 0, one = 1;
for ( int i = 1; i <= n; i++) {
for ( int j = 1; j <= n; j++) {
if (i == k || i == m)
cout << " " << zero;
else if (j == k || j == m)
cout << " " << zero;
else
cout << " " << one;
}
cout << endl;
}
}
int main()
{
int n = 8;
print_pattern(n);
return 0;
}
|
Java
class GFG
{
static void print_pattern( int n)
{
int k = 1 , m = n;
int zero = 0 , one = 1 ;
for ( int i = 1 ; i <= n; i++) {
for ( int j = 1 ; j <= n; j++) {
if (i == k || i == m)
System.out.print( " " +zero);
else if (j == k || j == m)
System.out.print( " " +zero);
else
System.out.print( " " +one);
}
System.out.print( "\n" );
}
}
public static void main(String args[])
{
int n = 8 ;
print_pattern(n);
}
}
|
Python3
def print_pattern(n):
k = 1
m = n
zero = 0
one = 1
for i in range ( 1 , n + 1 ):
for j in range ( 1 ,n + 1 ):
if (i = = k or i = = m):
print ( " " ,end = "0" )
elif (j = = k or j = = m):
print ( " " ,end = "0" )
else :
print ( " " ,end = "1" )
print ( "\r" )
n = 8
print_pattern(n)
|
C#
using System;
class GFG
{
static void print_pattern( int n)
{
int k = 1, m = n;
int zero = 0, one = 1;
for ( int i = 1; i <= n; i++) {
for ( int j = 1; j <= n; j++) {
if (i == k || i == m)
Console.Write( " " +zero);
else if (j == k || j == m)
Console.Write( " " +zero);
else
Console.Write( " " +one);
}
Console.WriteLine();
}
}
public static void Main()
{
int n = 8;
print_pattern(n);
}
}
|
PHP
<?php
function print_pattern( $n )
{
$k = 1;
$m = $n ;
$zero = 0;
$one = 1;
for ( $i = 1; $i <= $n ; $i ++)
{
for ( $j = 1; $j <= $n ; $j ++)
{
if ( $i == $k || $i == $m )
echo " " . $zero ;
else if ( $j == $k ||
$j == $m )
echo " " . $zero ;
else
echo " " . $one ;
}
echo "\n" ;
}
}
$n = 8;
print_pattern( $n );
?>
|
Javascript
<script>
function print_pattern(n)
{
let k = 1, m = n;
let zero = 0, one = 1;
for (let i = 1; i <= n; i++) {
for (let j = 1; j <= n; j++) {
if (i == k || i == m)
document.write( " " +zero);
else if (j == k || j == m)
document.write( " " +zero);
else
document.write( " " +one);
}
document.write( "<br/>" );
}
}
let n = 8;
print_pattern(n);
</script>
|
Output :
0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 0 0 0 0 0 0 0
Time Complexity: O(n2)
Auxiliary Space: O(1)
Last Updated :
20 Feb, 2023
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...