Pagini recente » Cod sursa (job #2849079) | Statistici Negreanu Vlad (negreanuvlad) | Cod sursa (job #2023974) | Cod sursa (job #864849) | Cod sursa (job #2274779)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("lacate.in"); ofstream fout ("lacate.out");
const int nmax = 256;
int v[nmax + 1][nmax + 1];
int main () {
int n;
fin >> n;
fout << n * (n - 1) / 2 << " " << n - 1 << "\n";
int cnt = 0;
for (int i = n; i > 1; -- i) {
for (int j = 1; j < i; ++ j) {
v[j][++v[j][0]] = ++ cnt;
v[i][++v[i][0]] = cnt;
}
}
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j < n; ++ j)
fout << v[i][j] << " ";
fout << "\n";
}
fin.close();
fout.close();
return 0;
}