Pagini recente » Cod sursa (job #283499) | Cod sursa (job #617521) | Cod sursa (job #2926124) | Cod sursa (job #465488) | Cod sursa (job #451788)
Cod sursa(job #451788)
#include <stdio.h>
#define N 256
int x[N + 1][N], n, i, j, c;
int main()
{
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
scanf("%d", &n);
printf("%d %d\n", n * (n - 1) / 2, n - 1);
for(i = 1; i <= n; ++i, printf("\n"))
{
for(j = 1; j < i; ++j) printf("%d ", x[i][j] = x[j][i - 1]);
for(j = i; j <= n - 1; ++j) printf("%d ", x[i][j] = ++c);
}
return 0;
}