Pagini recente » Cod sursa (job #1096936) | Cod sursa (job #2011204) | Cod sursa (job #1377333) | Cod sursa (job #1032354) | Cod sursa (job #1742775)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("lacate.in");
ofstream out("lacate.out");
int m[300][300];
int main() {
int n;
in >> n;
int am = n*(n-1)/2;
int C = 1;
for(int i = 1; i <= n; i++) {
for(int j = i; j <= n-1; j++) {
m[i][j] = C;
m[j+1][i] = C;
C++;
}
}
out << am << " " << n-1 << '\n';
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n-1; j++) {
out << m[i][j] << " ";
}
out << '\n';
}
return 0;
}