Cod sursa(job #1180512)
Utilizator | Data | 30 aprilie 2014 18:37:22 | |
---|---|---|---|
Problema | Lacate | Scor | 100 |
Compilator | cpp | Status | done |
Runda | lab10d30aprilie2014 | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream in("lacate.in");
ofstream out("lacate.out");
const int MAX_N = 256;
int a[MAX_N+1][MAX_N+1];
int main()
{
int n, dr, i, j;
in >> n;
dr = 0;
for(i = 1; i <= n; i++)
{
for(j = i; j < n; j++)
{
a[i][j] = a[j+1][i] = ++dr;
}
}
out << dr << " " << n-1 << "\n";
for(i = 1; i <= n; i++)
{
for(j = 1; j < n; j++)
{
out << a[i][j] << " ";
}
out << "\n";
}
}