Pagini recente » Clasament training_round_1 | Istoria paginii runda/maplictisescgrav | Istoria paginii runda/3103 | Istoria paginii runda/tgesgt | Cod sursa (job #2011806)
#include <stdio.h>
int a[33000][260],v[33000];
int main()
{
int n,l,c,x,i,j;
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
l=n*(n-1)/2;
c=n-1;
x=0;
for(i=1; i<n; i++)
for(j=i+1; j<=n; j++)
a[i][++v[i]]=a[j][++v[j]]=++x;
printf("%d %d\n",l,c);
for(i=1; i<=n; i++){
for(j=1; j<=c; j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}