Cod sursa(job #384601)
| Utilizator | Data | 20 ianuarie 2010 15:38:06 | |
|---|---|---|---|
| Problema | Lacate | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int n,nr;
#define nmax 267
int A[nmax][nmax];
void read()
{
ifstream f("lacate.in");
f>>n;
}
void solve()
{
int i,j;
for(i=1;i<=n;++i)
{
for(j=1;j<i;++j)
A[i][j]=A[j][i-1];
while(j<n)
{
A[i][j]=(++nr);
++j;
}
}
ofstream g("lacate.out");
g<<nr<<" "<<(n-1)<<endl;
for(i=1;i<=n;++i)
{
for(j=1;j<n;++j)
g<<A[i][j]<<" ";
g<<endl;
}
}
int main()
{
read();
solve();
return 0;
}
