Pagini recente » Cod sursa (job #111535) | Cod sursa (job #504634) | Cod sursa (job #2902429) | Cod sursa (job #441) | Cod sursa (job #761145)
Cod sursa(job #761145)
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
int m[260][260], n, a, b;
int main()
{
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
int i, j;
scanf("%i", &n);
printf("%i %i\n", n * (n - 1) / 2, n - 1);
for(i = 1; i < n; i++)
{
for(j = i; j < n; j++) m[i][j] = (++a);
for(j = i + 1; j <= n; j++) m[j][i] = (++b);
}
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n - 1; j++) printf("%i ", m[i][j]);
printf("\n");
}
scanf("%i", &i);
return 0;
}