Pagini recente » Cod sursa (job #506515) | Cod sursa (job #2523680) | Cod sursa (job #1081055) | Cod sursa (job #1547318) | Cod sursa (job #2988500)
#include <bits/stdc++.h>
using namespace std;
const int nmax = 200;
bool a[nmax+5][nmax+5];
int main() {
ifstream f("oras.in");
ofstream g("oras.out");
int n; f >> n;
if(n == 4) {
g << -1;
return 0;
}
if(n%2)
for(int i=1; i<=n; i++)
for(int j=i+1; j<=n; j++)
if((j-i)%2) a[j][i] = true;
else a[i][j] = true;
else {
for(int i=1; i<n-1; i++)
for(int j=i+1; j<=n-1; j++)
if((j-i)%2) a[j][i] = true;
else a[i][j] = true;
a[1][n] = true;
a[2][n] = true;
for(int i=3; i<n; i++)
a[n][i] = true;
}
for(int i=1; i<=n; i++, g << "\n")
for(int j=1; j<=n; j++)
g << a[i][j];
return 0;
}