Pagini recente » Cod sursa (job #2888494) | Cod sursa (job #1579709) | Cod sursa (job #576708) | Cod sursa (job #650359) | Cod sursa (job #1067177)
#include<stdio.h>
int sol[301][301];
void buildsol(int n)
{
if(n==3)
{
sol[1][2]=sol[2][3]=sol[3][1]=1;
return;
}
if(n==4)
return;
if(n==6)
{
sol[1][2]=sol[1][3]=sol[1][4]=sol[2][3]=sol[2][4]=sol[2][5]=sol[3][4]=sol[3][6]=sol[4][5]=sol[4][6]=sol[5][1]=sol[5][3]=sol[5][6]=sol[6][1]=sol[6][2]=1;
return;
}
else
{
int i;
for(i=1;i<n-1;i++)
sol[i][n-1]=sol[n][i]=1;
sol[n-1][n]=1;
buildsol(n-2);
}
}
int main()
{
FILE *fin,*fout;
fin=fopen("oras.in","r");
fout=fopen("oras.out","w");
int n;
fscanf(fin,"%d",&n);
if(n==4)
{
fprintf(fout,"-1");
return 0;
}
buildsol(n);
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fprintf(fout,"%d",sol[i][j]);
fprintf(fout,"\n");
}
return 0;
}