Pagini recente » Cod sursa (job #41753) | Cod sursa (job #2594909) | Borderou de evaluare (job #1569018) | Cod sursa (job #550076) | Cod sursa (job #471341)
Cod sursa(job #471341)
#include <cstdio>
#define N 300
int n;
int nr;
int a[N][N];
int main ()
{
freopen ("lacate.in", "r", stdin);
freopen ("lacate.out", "w", stdout);
scanf ("%d", &n);
int i, j;
for (i = 1; i <= n; ++i)
for (j = 1; j < n; ++j)
if (a[i][j] == 0)
a[i][j] = a[j + 1][i] = ++nr;
printf ("%d %d\n", n * (n - 1) / 2 , n - 1);
for (i = 1; i <= n; ++i)
{
for (j = 1; j < n; ++j)
printf ("%d ", a[i][j]);
printf ("\n");
}
return 0;
}