Cod sursa(job #2229902)
Utilizator | Data | 8 august 2018 13:04:34 | |
---|---|---|---|
Problema | Lacate | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int p[256][1000],n,c,l,i,j,k;
int main()
{
f>>n;
c=n-1;
l=n*(n-1)/2;
g<<l<<" "<<c<<"\n";
for(i=0;i<n-1;i++)for(j=i+1;j<n;j++,k++)
{
p[i][k]=1;
p[j][k]=1;
}
for(i=0;i<n;i++)
{
for(j=0;j<l;j++)if(p[i][j]==1)g<<j+1<<" ";
g<<"\n";
}
return 0;
}