Pagini recente » Cod sursa (job #3236947) | Cod sursa (job #2585359) | Borderou de evaluare (job #2051249) | Cod sursa (job #2179636) | Cod sursa (job #1914585)
#include <fstream>
#include <vector>
using namespace std;
const int NMAX = 256 + 5;
vector <int> locks[NMAX];
int main()
{
ifstream cin("lacate.in");
ofstream cout("lacate.out");
int N;
cin >> N;
int cnt = 0;
for (int i = 1; i <= N; ++ i)
for (int j = i + 1; j <= N; ++ j) {
locks[i].push_back(++ cnt);
locks[j].push_back(cnt);
}
cout << cnt << ' ' << N - 1 << '\n';
for (int i = 1; i <= N; ++ i)
for (int j = 1; j < N; ++ j)
cout << locks[i][j - 1] << " \n"[j + 1 == N];
return 0;
}