Cod sursa(job #2337663)
Utilizator | Data | 6 februarie 2019 16:47:20 | |
---|---|---|---|
Problema | Lacate | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int n,a[257][257],L,C,k;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
a[i][j]=a[j][i]=++k;
L=n*(n-1)/2;
C=n-1;
g<<L<<' '<<C<<'\n';
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
if(a[i][j]!=0) g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}