Pagini recente » Cod sursa (job #2587026) | Cod sursa (job #3299503) | Cod sursa (job #368510) | Cod sursa (job #2586629) | Cod sursa (job #2128571)
#include <fstream>
#include <iostream>
using namespace std;
int p[256][128*256],n,c,l,i,j,k;
int main()
{
fstream f("lacate.in",ios::in),g("lacate.out",ios::out);
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';
}
}