Pagini recente » Cod sursa (job #2071196) | Cod sursa (job #639841) | Cod sursa (job #137531) | Cod sursa (job #1505806) | Cod sursa (job #2260805)
#include <bits/stdc++.h>
using namespace std;
ifstream in ("lacate.in");
ofstream out ("lacate.out");
const int NMAX = 256;
int n, nr;
vector <int> chei[1 + NMAX];
int main() {
in >> n;
for(int i = 1; i < n; i++) {
for(int j = i + 1; j <= n; j++) {
nr++;
chei[i].push_back(nr);
chei[j].push_back(nr);
}
}
out << n * (n - 1) / 2 << " " << n - 1 << "\n"; // n * (n - 1) chei, o cheie va aparea de 2 ori
for(int i = 1; i <= n; i++) {
for(auto j : chei[i])
out << j << " ";
out << "\n";
}
return 0;
}