Pagini recente » Cod sursa (job #3264574) | Cod sursa (job #1055686) | Cod sursa (job #754284) | Cod sursa (job #3284790) | Cod sursa (job #3275751)
#include <fstream>
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
int t[260][260];
int main()
{
int n,i,j;
fin>>n;
fout<<n*(n-1)/2<<' ';
fout<<n-1<<'\n';
for(i=1;i<=n-1;++i)
{
t[i][i]=t[i-1][n-1]+1;
for(j=i+1;j<=n-1;++j)
t[i][j]=t[i][j-1]+1;
t[i+1][i]=t[i][i];
for(j=i+2;j<=n;++j)
{
t[j][i]=t[j-1][i]+1;
}
}
for(i=1;i<=n;++i)
{
for(j=1;j<=n-1;++j)
{
fout<<t[i][j]<<' ';
}
fout<<'\n';
}
return 0;
}