Cod sursa(job #1346927)
Utilizator | Data | 18 februarie 2015 18:00:39 | |
---|---|---|---|
Problema | Lacate | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int a[257][257],n;
int main()
{
f>>n;
int i,j,l=0;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
l++;
a[j][i]=a[i][j-1]=l;
}
g<<l<<' '<<n-1<<'\n';
for(i=1;i<=n;i++)
{
for(j=1;j<n;j++) g<<a[i][j]<<' ';
g<<'\n';
}
f.close();
g.close();
return 0;
}