Pagini recente » Rating Lucian Robert (Huvos) | Cod sursa (job #1202173) | Cod sursa (job #1754662) | Cod sursa (job #2336817) | Cod sursa (job #1316737)
#include <fstream>
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
int n;
int a[260][260];
int main() {
fin >> n;
fout << n*(n - 1) / 2 << " " << n - 1 << "\n";
int nr = 1;
for (int i = 1; i < n; i++) {
bool ok = 0;
for (int j = i; j <= n; j++) {
a[j][i] = nr;
if (ok)
nr++;
ok = 1;
}
}
for (int i = 1; i <= n; i++){
for (int j = i + 1; j < n; j++){
a[i][j] = a[i][j - 1] + 1;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < n; j++)
fout << a[i][j] << " ";
fout << "\n";
}
return 0;
}