Pagini recente » Cod sursa (job #1383771) | Cod sursa (job #1183310) | Cod sursa (job #2986722) | Cod sursa (job #2569812) | Cod sursa (job #1022992)
#include <fstream>
using namespace std;
ifstream f("oras.in");
ofstream g("oras.out");
int main()
{
int n, a[205][205], N; f>>n; N=n;
if (n==4) { g<<-1<<'\n'; return 0; }
while (n>2)
{
if (n==6)
{
a[1][2]=a[1][3]=a[1][4]=a[2][3]=a[2][4]=1;
a[2][5]=a[3][4]=a[3][6]=a[4][5]=a[4][6]=1;
a[5][1]=a[5][3]=a[5][6]=a[6][1]=a[6][2]=1;
break;
}
for (int i=1; i<n-1; ++i) a[i][n-1]=a[n][i]=1;
a[n-1][n]=1; n-=2;
}
if (n==3)
{
for (int i=1; i<=n; ++i)
{
for (int j=1; j<=n; ++j) g<<a[i][j]; g<<'\n';
}
return 0;
}
for (int i=1; i<=N; ++i)
{
for (int j=1; j<=N; ++j) g<<a[i][j]; g<<'\n';
}
return 0;
}