Cod sursa(job #1783850)
| Utilizator | Data | 19 octombrie 2016 15:52:50 | |
|---|---|---|---|
| Problema | Lacate | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
#define nmax 300
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
int N, V[nmax][nmax], K;
int main()
{
fin>>N;
K=N;
fout<<N*(N-1)/2<<' '<<N-1<<'\n';
for(int i=1; i<N; ++i)
V[1][i]=i;
for(int i=1; i<N; ++i)
{
for(int j=1; j<i; ++j)
{
V[i+1][j]=V[i][j]+1;
}
V[i+1][i]=V[i][i];
for(int j=i+1; j<N; ++j)
{
V[i+1][j]=K++;
}
}
for(int i=1; i<=N; ++i)
{
for(int j=1; j<N; ++j)
fout<<V[i][j]<<' ';
fout<<'\n';
}
return 0;
}
