Pagini recente » Cod sursa (job #508937) | Cod sursa (job #2209574) | Cod sursa (job #2847606) | Cod sursa (job #1090841) | Cod sursa (job #1086788)
#include <stdio.h>
using namespace std;
const int N=257;
const int C=256*257/2;
bool are[N][C];
int main()
{
FILE *in,*out;
in=fopen("lacate.in","r");
out=fopen("lacate.out","w");
int n,i,j,nc=1;
fscanf(in,"%d",&n);
fprintf(out,"%d %d\n",n*(n-1)/2, n-1);
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{
are[i][nc]=1;
are[j][nc]=1;
nc++;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n*(n-1)/2;j++)
if(are[i][j]) fprintf(out,"%d ",j);
fprintf(out,"\n");
}
}