Cod sursa(job #2776645)
Utilizator | Alex Ben alex_benescu | Data | 20 septembrie 2021 16:32:10 |
---|---|---|---|
Problema | Lacate | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
#define L 260
using namespace std;
int m[L][L];
ifstream fin("lacate.in");
ofstream fout("lacate.out");
int main(){
int i, j, n, k;
fin >> n;
fout << n * (n - 1) / 2 << " " << n - 1 << "\n";
k = 1;
for (i = 2; i <= n; i++)
for (j = 1; j < n; j++)
if (i > j)
m[i][j] = k++;
k = 1;
for (j = 1; j < n; j++)
for (i = 1; i < n; i++)
if (i <= j)
m[i][j] = k++;
for (i = 1; i <= n; i++){
for (j = 1; j < n; j++)
fout << m[i][j] << " ";
fout << "\n";
}
return 0;
}