Cod sursa(job #1391858)
Utilizator | Data | 18 martie 2015 10:57:35 | |
---|---|---|---|
Problema | Lacate | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
#define NMax 300
ifstream f("lacate.in");
ofstream g("lacate.out");
int n,nr;
int M[NMax][NMax];
int main()
{
int i,j;
f>>n;
for(i=1;i<n;++i)
{
M[i][i] = M[i+1][i] = ++nr;
for(j=i+1;j<n;++j) M[i][j] = M[j+1][i] = ++nr;
}
g<<nr<<" "<<n-1<<"\n";
for(i=1;i<=n;++i) {for(j=1;j<n;++j) g<<M[i][j]<<" "; g<<"\n";}
f.close();
g.close();
return 0;
}