Pagini recente » Cod sursa (job #327846) | Cod sursa (job #1455939) | Cod sursa (job #2025500) | Cod sursa (job #593425) | Cod sursa (job #1459825)
#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <climits>
#include <list>
#include <iomanip>
#include <cstdlib>
#include <map>
using namespace std;
int main() {
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int m[300][300];
int c = n - 1, l = c * n / 2;
cout << l << " " << c << "\n";
for (int i = 0; i < n; i++) {
m[i][i] = 0;
}
int nr = 1;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
m[i][j] = m[j][i] = nr;
nr++;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (m[i][j] != 0) {
cout << m[i][j] << " ";
}
}
cout << "\n";
}
return 0;
}