Pagini recente » Cod sursa (job #2298717) | Cod sursa (job #1099343) | Cod sursa (job #2435004) | Cod sursa (job #1331255) | Cod sursa (job #2255919)
#include <iostream>
#include <fstream>
int n,d[210][210];
using namespace std;
int main (){
ifstream fin("oras.in");
ofstream fout("oras.out");
fin>>n;
if(n==4){
fout<<"-1";
return 0;
}
if(n%2==0){
d[1][2]=1;
d[1][3]=1;
d[1][5]=1;
d[2][3]=1;
d[2][4]=1;
d[2][5]=1;
d[3][4]=1;
d[3][6]=1;
d[4][1]=1;
d[4][5]=1;
d[4][6]=1;
d[5][3]=1;
d[5][6]=1;
d[6][1]=1;
d[6][2]=1;
for(int i=8;i<=n;i+=2){
for(int j=1;j<i-1;j++){
d[i-1][j]=1;
d[j][i]=1;
}
d[1][i]=1;
d[i-1][1]=1;
d[i][i-1]=1;
}
}
else{
d[1][2]=1;
d[2][3]=1;
d[3][1]=1;
for(int i=5;i<=n;i+=2){
for(int j=1;j<i-1;j++){
d[i-1][j]=1;
d[j][i]=1;
}
d[1][i]=1;
d[i-1][1]=1;
d[i][i-1]=1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
fout<<d[i][j];
fout<<"\n";
}
return 0;
}