Pagini recente » Cod sursa (job #1435187) | Cod sursa (job #761143) | Cod sursa (job #121877) | Cod sursa (job #181064) | Cod sursa (job #2060957)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
int n,a[256][256];
int main()
{
fin>>n;
int k=n-1;
int i=1,j=1;
a[1][1]=1;
a[2][1]=1;
while(k!=1)
{
i++;
j++;
a[i][j]=a[i][j-1]+k;
a[i+1][j]=a[i][j];
k--;
}
for(i=1;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
a[i][j]=a[i][j-1]+1;
}
for(j=1;j<=n-2;j++)
{
for(i=j+2;i<=n;i++)
a[i][j]=a[i-1][j]+1;
}
fout<<a[n][n-1]<<" "<<n-1<<endl;
for(i=1;i<=n;i++)
{for(j=1;j<=n-1;j++)
fout<<a[i][j]<<" ";
fout<<"\n";}
return 0;
}