Pagini recente » Cod sursa (job #2286444) | Cod sursa (job #1223072) | Cod sursa (job #1488757) | Cod sursa (job #2308352) | Cod sursa (job #1749789)
#include <cstdio>
#define MAXN 256
int v[MAXN+1][MAXN];
int main()
{
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
int i, j, n, k=0;
scanf("%d", &n);
printf("%d %d\n", n*(n-1)/2, n-1);
for(i=1;i<n;++i)
for(j=i+1;j<=n;++j)
++k, v[i][++v[i][0]]=v[j][++v[j][0]]=k;
for(i=1;i<=n;++i){
for(j=1;j<=v[i][0];++j)
printf("%d ", v[i][j]);
printf("\n");
}
return 0;
}