Pagini recente » Cod sursa (job #2519376) | Cod sursa (job #142347) | Cod sursa (job #1506658) | Cod sursa (job #2851114) | Cod sursa (job #1875211)
#include <bits/stdc++.h>
#define nmax 257
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
int n,a[nmax][nmax],r;
int main()
{
int i,j;
fin>>n;
fin.close();
for(i=1; i<=n; i++)
{
for(j=1; j<n; j++)
{
if(i<=j)
a[i][j]=++r;
if(!a[j+1][i])
a[j+1][i]=a[i][j];
}
}
fout<<a[n][n-1]<<' '<<n-1<<'\n';
for(i=1; i<=n; i++)
{
for(j=1; j<n; j++)
fout<<a[i][j]<<' ';
fout<<'\n';
}
fout.close();
return 0;
}