Pagini recente » Cod sursa (job #1319902) | Cod sursa (job #1324067) | Cod sursa (job #2770838) | Cod sursa (job #56112) | Cod sursa (job #761590)
Cod sursa(job #761590)
#include <cstdio>
using namespace std;
const int N = 300;
int a, n, sol[N][N];
int main()
{
int i, j;
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 < n; ++j) {
++a;
sol[i][j] = a;
sol[j + 1][i] = a;
}
for(i = 1; i <= n; ++i) {
for(j = 1; j < n; ++j)
printf("%d ", sol[i][j]);
printf("\n");
}
return 0;
}