Pagini recente » Cod sursa (job #2599006) | Cod sursa (job #2686381) | Cod sursa (job #2148221) | Cod sursa (job #2190818) | Cod sursa (job #333959)
Cod sursa(job #333959)
#include<cstdio>
const int N = (1<<8);
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
int i,j,n,k=0,a[N][N]={0};
scanf("%d",&n);
printf("%d %d\n",n*(n-1)/2,n-1);
for(i=0;i<n-1;++i)
for(j=i+1;j<n;++j)
{
++k;
a[i][++a[i][0]]=k;
a[j][++a[j][0]]=k;
}
for(i=0;i<n;++i)
{
printf("%d",a[i][1]);
for(j=2;j<=a[i][0];++j)
printf(" %d",a[i][j]);
printf("\n");
}
return 0;
}