Pagini recente » Cod sursa (job #237978) | Cod sursa (job #285045) | Cod sursa (job #911020) | Cod sursa (job #3230317) | Cod sursa (job #1471708)
#include <cstdio>
using namespace std;
int n , i , j , r;
int mat[210][210];
int ind(int x)
{
if (x <= n) return x;
return x - n;
}
void jnando()
{
for (i = 1; i <= n; ++i, printf("\n"))
for (j = 1; j <= n; ++j)
printf("%d", mat[i][j]);
}
int main()
{
freopen("oras.in","r",stdin);
freopen("oras.out","w",stdout);
scanf("%d", &n);
if (n == 4)
{
printf("-1\n");
return 0;
}
if (n == 6)
{
mat[1][2] = mat[1][4] = mat[1][6] = 1;
mat[2][3] = mat[2][5] = mat[2][6] = 1;
mat[3][1] = mat[3][5] = 1;
mat[4][2] = mat[4][3] = mat[4][5] = 1;
mat[5][1] = mat[5][6] = 1;
mat[6][3] = mat[6][4] = 1;
jnando(); return 0;
}
for (i = 1; i <= n; ++i)
mat[i][ind(i+1)] = 1;
for (r = 2; r < n - 2; ++r)
for (i = 1; i <= n; ++i)
if (!mat[ind(i+r+1)][i])
mat[i][ind(i+r+1)] = 1;
jnando();
return 0;
}