Pagini recente » Cod sursa (job #2167152) | Cod sursa (job #3240674) | Cod sursa (job #2770694) | Cod sursa (job #3031819) | Cod sursa (job #2167304)
#include <cstdio>
using namespace std;
int d[210][210];
int main()
{
freopen("oras.in","r",stdin);
freopen("oras.out","w",stdout);
int n,p=0;
scanf("%d",&n);
if(n==4) {printf("-1");return 0;}
if(n%2==0) {n--;p=1;}
for(int i=1;i<n;i+=2)
{
d[i][i+1]=1;
for(int j=i+2;j<=n;j++) d[j][i]=1;
for(int j=i+2;j<=n;j++) d[i+1][j]=1;
}
if(p==1)
{
n++;
d[1][n]=d[3][n]=1;
for(int i=1;i<n;i++) d[n][i]=1;
d[n][1]=d[n][3]=0;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++) printf("%d",d[i][j]);
printf("\n");
}
return 0;
}