Cod sursa(job #335340)
Utilizator | Mihai Calancea klamathix | Data | 29 iulie 2009 17:10:13 |
---|---|---|---|
Problema | Oras | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<cstdio>
#define MAXN 201
int N , A[MAXN][MAXN] , i , j;
int main()
{
freopen("oras.in","r",stdin);
freopen("oras.out","w",stdout);
scanf("%d",&N);
for( i = 1 ; i <= N ; ++i )
for( j = i + 1 ; j <= N ; ++j )
A[i][j] = A[i][j - 1] ^ 1 , A[j][i] = A[i][j] ^ 1;
for( i = 1 ; i <= N ; ++i ){
for( j = 1 ; j <= N ; ++j )
printf("%d",A[i][j]);
printf("\n");
}
return 0;
}