Pagini recente » Cod sursa (job #321226) | Cod sursa (job #509999) | Cod sursa (job #3186793) | Cod sursa (job #627053) | Cod sursa (job #1090619)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,l,c,m[32640][2],i=1,k,o,v[2]= {1,2};
ifstream g("lacate.in");
g>>n;
ofstream h("lacate.out");
l=n*(n-1)/2;
c=n-1;
h<<l<<" "<<c<<endl;
for (k=0;k<l;k++)
{
for (o=0;o<=1;o++)
{
m[k][o]=v[o];
if (m[k][o]==i)
{
h<<k+1<<" ";
}
}
v[1]++;
if (v[1]>n)
{
v[0]++;
v[1]=v[0]+1;
}
}
h<<endl;
for (i=2;i<=n;i++)
{
for (k=0;k<l;k++)
{
for (o=0;o<=1;o++)
{
if (m[k][o]==i)
{
h<<k+1<<" ";
}
}
}
h<<endl;
}
return 0;
}