Pagini recente » Cod sursa (job #721243) | Cod sursa (job #2316648) | Cod sursa (job #1277258) | Cod sursa (job #1373414) | Cod sursa (job #1315876)
#include <fstream>
using namespace std;
const int MAX_N = 258;
int a[MAX_N][MAX_N];
int main()
{
ifstream fin("lacate.in");
ofstream fout("lacate.out");
int n;
fin >> n;
fout << n * (n - 1) / 2 << " " << n - 1 << "\n";
int last = 1;
for (int i = 1; i <= n; ++ i) {
for (int j = i; j <= n - 1; ++ j) {
a[i][j] = a[j + 1][i] = last;
++ last;
}
}
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= n - 1; ++ j) {
fout << a[i][j] << (j == n - 1 ? '\n' : ' ');
}
}
return 0;
}