Pagini recente » Istoria paginii runda/tema124 | Cod sursa (job #2578796) | Clasament oji-2005-ix | Clasament preonii20051 | Cod sursa (job #1977748)
#include <cstdio>
using namespace std;
const int N = 300;
int v[N][N];
int main()
{
int n, i, j, nr = 0;
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) {
for(j = 1;j < i; ++j) {
v[i][j] = v[j][i - 1];
printf("%d ", v[i][j]);
}
for(j = i;j < n; ++j) {
++nr;
v[i][j] = nr;
printf("%d ", v[i][j]);
}
printf("\n");
}
return 0;
}