Pagini recente » Cod sursa (job #1259411) | Cod sursa (job #2593164) | Cod sursa (job #934567) | Cod sursa (job #737779) | Cod sursa (job #2047954)
#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 257
int a[NMAX][NMAX];
int main()
{
int n, i, j, k;
ifstream f("lacate.in");
ofstream g("lacate.out");
f >> n;
f.close();
g << n * (n - 1) / 2 << " " << n - 1 << '\n';
k = 1;
for (i = 1; i <= n - 1; i++) {
for (j = 1; j <= n - i; j++)
a[i][j] = k++;
for (j = i; j <= n - 1; j++)
a[j][n - i + 1] = a[i][j - i + 1];
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n - 1; j++)
g << a[j][i] << " ";
g << '\n';
}
g.close();
return 0;
}