Cod sursa(job #1265403)
| Utilizator | Data | 17 noiembrie 2014 11:36:06 | |
|---|---|---|---|
| Problema | Lacate | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
#define Nmax 260
int t[Nmax][Nmax];
int main()
{
int i, j, n, nr = 1;
fin >> n;
fout << n * (n - 1) / 2 << ' ' << n - 1 << '\n';
t[1][1] = t[2][1] = 1;
for(i = 3; i <= n; ++i)
{
for(j = 1; j <= i - 2; ++j) t[i][j] = t[j][i-1] = (++nr);
t[i-1][i-1] = t[i][i-1] = (++nr);
}
for(i = 1; i <= n; ++i)
{
for(j = 1; j < n; ++j)
fout << t[i][j] << ' ';
fout << '\n';
}
return 0;
}
