Pagini recente » Cod sursa (job #3186720) | Cod sursa (job #3171785) | Cod sursa (job #24285) | Cod sursa (job #3254295) | Cod sursa (job #20833)
Cod sursa(job #20833)
#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;i++)
{
/* if (i>n/2) ver=1;
else ver=0; */
for(j=1;j<=n/2+ver;j++)
{
int j1=i+j;
if (j1>n) j1-=n;
if (a[i][j1]==0)
{
a[i][j1]=2;
a[j1][i]=1;
}
}
}
for(i=1;i<=n;i++)
{
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;
}