Cod sursa(job #1027228)
| Utilizator | Data | 12 noiembrie 2013 16:52:40 | |
|---|---|---|---|
| Problema | Lacate | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#define MAXN 270
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int n,a[MAXN][MAXN],cnt;
int main()
{
int i,j,k;
f>>n;
for(i=1;i<=n;i++)
for(j=i;j<=n-1;j++){
a[i][j]=(++cnt);
a[j+1][i]=cnt;}
g<<cnt<<' '<<n-1<<'\n';
for(i=1;i<=n;i++){
for(j=1;j<=n-1;j++)
g<<a[i][j]<<' ';
g<<'\n';}
f.close();
g.close();
return 0;
}
