Pagini recente » Cod sursa (job #2392767) | Cod sursa (job #2145653) | Cod sursa (job #543484) | Cod sursa (job #637825) | Cod sursa (job #2228198)
#include<fstream>
#include<iostream>
#include<algorithm>
#define x first
#define y second
#define DN 305
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
int n,nr;
int v[DN][DN];
int main()
{
fin>>n;
fout<<(n*(n-1))/2<<' '<<n-1<<'\n';
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
{
nr++;
v[i][0]++;
v[i][v[i][0]]=nr;
v[j][0]++;
v[j][v[j][0]]=nr;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=v[i][0];j++)
fout<<v[i][j]<<' ';
fout<<'\n';
}
}