Pagini recente » Cod sursa (job #555476) | Cod sursa (job #626420) | Cod sursa (job #412489) | Cod sursa (job #1226787) | Cod sursa (job #1052467)
#include <fstream>
using namespace std;
ifstream fin ("lacate.in");
ofstream fout ("lacate.out");
const int N = 258;
int n, a[N][N], k = 1;
int main() {
fin >> n;
fout << n * (n - 1) / 2 << " " << n - 1 << "\n";
for (int i = 1; i <= n; ++i)
for (int j = i; j < n; ++j)
a[i][j] = k++;
k = 1;
for (int i = 1; i < n; ++i)
for (int j = i + 1; j <= n; ++j)
a[j][i] = k++;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j < n; ++j)
fout << a[i][j] << " ";
fout << "\n";
}
return 0;
}