Cod sursa(job #333139)
Utilizator | Data | 21 iulie 2009 16:15:57 | |
---|---|---|---|
Problema | Oras | Scor | 55 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.92 kb |
#include <stdio.h>
using namespace std;
#define maxn 210
long n, i, b, j, k, ok, r[maxn][maxn];
int main()
{
freopen("oras.in", "r", stdin);
freopen("oras.out", "w", stdout);
scanf("%d", &n);
ok=1;
for(i=1; i<n/2+n%2; i++)
{
for(j=0; j<n; j++)
{
b=(i+j)%n;
if(r[b][j]==0 && r[j][b]==0)
{
r[j][b]=1;
}
}
}
if(n%2==0)
{
i=n/2;
for(j=0; j<n; j++)
{
b=(i+j)%n;
if(j%2==0)
{
r[b][j]=1;
}
else
{
r[j][b]=1;
}
}
}
if(n==4) printf("%d\n", -1);
for(i=0; i<n; i++)
{
for(j=0; j<n; j++)
{
printf("%d", r[i][j]);
}
printf("\n");
}
return 0;
}