Pagini recente » Cod sursa (job #2961259) | Cod sursa (job #1240612) | Cod sursa (job #2887749) | Cod sursa (job #110467) | Cod sursa (job #26676)
Cod sursa(job #26676)
#include<iostream>
#include<fstream>
#define inputfile "oras.in"
#define outpufile "oras.out"
using namespace std;
const int NMAX = 201;
void solve(int a[NMAX][NMAX], int n) {
int i = 1, j = 2;
while (i<=n-2) {
a[i][j] = 1;
for (int k = j+1; k<=n; k++)
a[j][k] = a[k][i] = 1;
i += 2;
j += 2;
}
}
int main() {
int n;
ifstream from(inputfile);
from>>n;
from.close();
int a[NMAX][NMAX];
ofstream to(outpufile);
if (n % 2 == 0) to<<-1;
else {
solve(a,n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
to<<a[i][j];
to<<'\n';
}
}
to.close();
}