Pagini recente » Cod sursa (job #1806787) | Cod sursa (job #958500) | Cod sursa (job #1384737) | Cod sursa (job #1707455) | Cod sursa (job #1811731)
#include <cstdio>
const int MAX_N = 256;
int top[MAX_N];
int v[MAX_N][MAX_N];
int main() {
int n, key;
FILE *fin = fopen("lacate.in", "r");
fscanf(fin, "%d", &n);
fclose(fin);
key = 0;
for(int i = 0; i < n; ++i) {
for(int j = i + 1; j < n; ++j) {
key++;
v[i][top[i]] = key;
v[j][top[j]] = key;
top[i]++;
top[j]++;
}
}
FILE *fout = fopen("lacate.out", "w");
fprintf(fout, "%d %d\n", key, n - 1);
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n - 1; ++j)
fprintf(fout, "%d ", v[i][j]);
fprintf(fout, "\n");
}
fclose(fout);
return 0;
}