Pagini recente » Cod sursa (job #3220404) | Cod sursa (job #1923096) | Cod sursa (job #1352326) | Cod sursa (job #1145816) | Cod sursa (job #2229870)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int p[256][128*256],n,c,l,i,j,k;
int main()
{
f>>n;
c=n-1;
l=n*(n-1)/2;
g<<l<<' '<<c<<'\n';
for(i=0,k=0;i<n-1;i++)for(j=i+1;j<n;j++,k++)
{
p[i][k]=1;
p[j][k]=1;
}
for(i=0;i<n;i++)
{
for(j=0;j<l;j++)if(p[i][j]==1)g<<j+1<<' ';
g<<'\n';
}
return 0;
}