Pagini recente » Borderou de evaluare (job #2019922) | Cod sursa (job #3292765) | Cod sursa (job #995459) | Cod sursa (job #1758443) | Cod sursa (job #2417352)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in ("lacate.in");
ofstream out ("lacate.out");
#define ll long long
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 256;
vector<int> g[5 + nmax];
int main()
{
int n;
in >> n;
out << n * (n - 1) / 2 << " " << n - 1 << '\n';
int ans = 0;
for(int i = 1;i <= n;i++)
for(int j = i + 1;j <= n;j++) {
++ans;
g[i].push_back(ans);
g[j].push_back(ans);
}
for(int i = 1;i <= n;i++) {
for(int j = 0;j < n - 1; j++)
out << g[i][j] << " " ;
out << '\n';
}
return 0;
}