Pagini recente » Cod sursa (job #2949412) | Cod sursa (job #1134264) | Cod sursa (job #750742) | Cod sursa (job #2204645) | Cod sursa (job #130302)
Cod sursa(job #130302)
#include <stdio.h>
#include <math.h>
#define maxn 256
long n;
int main() {
freopen("lacate.in","rt",stdin);
freopen("lacate.out","wt",stdout);
long v[maxn][maxn], last, nr, i, j;
scanf("%ld", &n);
printf("%ld %ld\n", n * (n - 1) / 2, n - 1);
nr = n - 1;
last = 0;
for(i = 1; i <= n; ++i) {
for(j = 1; j <= i - 1; ++j) {
printf("%ld ", v[j][i - 1]);
v[i][j] = v[j][i - 1];
}
for(j = 1;j + i - 1 < n; ++j) {
printf("%ld ", ++last);
v[i][j + i - 1] = last;
}
printf("\n");
}
return 0;
}