Pagini recente » Cod sursa (job #2497744) | Cod sursa (job #3175080) | Cod sursa (job #1930145) | Cod sursa (job #164785) | Cod sursa (job #1207899)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
/**
**/
const int MAXN = 270;
int N;
int m[MAXN][MAXN];
void Write() {
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N - 1; ++j)
fout << m[i][j] << ' ';
fout << '\n';
}
}
int main() {
fin >> N;
int locks = N * (N - 1) / 2;
fout << locks << ' ' << N - 1 << '\n';
int cunt = 1;
for (int i = 0; i < N; ++i) {
for (int j = i; j < N - 1; ++j) {
m[i][j] = cunt++;
}
}
cunt = 1;
for (int i = 1; i < N; ++i) {
for (int j = 0; j < i; ++j) {
m[i][j] = cunt++;
}
}
Write();
fin.close();
fout.close();
return 0;
}