Pagini recente » Cod sursa (job #3176929) | Cod sursa (job #3227090) | Cod sursa (job #6182) | Cod sursa (job #425316) | Cod sursa (job #20841)
Cod sursa(job #20841)
#include<stdio.h>
const int maxn = 1000;
int n;
int i;
int j;
int a[maxn][maxn];
int ver;
int main()
{
freopen("oras.in","r",stdin);
freopen("oras.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n/2+1;i++)
{
int j1;
for(j=1;j<=n;j++)
{
j1=i+j;
if (j1>n) j1-=n;
if (a[j][j1]==0)
{
a[j][j1]=2;
a[j1][j]=1;
}
}
}
for(i=1;i<=n;i++)
{
/*if (i%2==0&&n%2==0)
{
int j1 = i+n/2-1;
if (j1>n) j1-=n;
a[j1][i-1]=2;
a[i-1][j1]=1;
} */
for(j=1;j<=n;j++)
{
if (a[i][j]!=0)printf("%d",a[i][j]-1);
else printf("0");
// printf("%d",a[i][j]);
}
printf("\n");
}
return 0;
}