Pagini recente » Istoria paginii runda/teo.contest | Cod sursa (job #304360) | Cod sursa (job #514912) | Cod sursa (job #1425946) | Cod sursa (job #1242786)
#include<fstream>
using namespace std;
ifstream f("oras.in"); ofstream g("oras.out");
int G[201][201];
void Solve(int k)
{ if(k==3) {G[1][2]=G[2][3]=G[3][1]=1; return;}
if(k==6)
{ G[1][2]=G[1][3]=G[1][4]=1;
G[2][3]=G[2][4]=G[2][5]=1;
G[3][4]=G[3][6]=1;
G[4][5]=G[4][6]=1;
G[5][1]=G[5][3]=G[5][6]=1;
G[6][1]=G[6][2]=1;
return;
}
Solve(k-2);
G[k-1][k]=1;
for(int i=1;i<k-1;i++) G[i][k-1]=G[k][i]=1;
}
int main()
{ int n,i,j;
f>>n;
if(n==4) g<<"-1\n";
else
{ Solve(n);
for(i=1;i<=n;++i,g<<"\n")
for(j=1;j<=n;++j) g<<G[i][j];
}
g.close(); return 0;
}