Pagini recente » Cod sursa (job #74958) | Cod sursa (job #2941192) | Cod sursa (job #2432002) | Cod sursa (job #2037520) | Cod sursa (job #1818235)
#include <cstdio>
using namespace std;
int a[260][260];
int main()
{
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
int n, p, nr = 0;
scanf("%d", &n);
printf("%d %d\n", n *(n - 1) / 2, n - 1);
for (int i = 1; i <= n; ++i)
for (int j = i; j < n; ++j)
a[i][j] = a[j + 1][i] = ++nr;
for (int i = 1; i <= n; ++i){
for (int j = 1; j < n; ++j)
printf("%d ", a[i][j]);
printf("\n");}
return 0;
}