Pagini recente » Cod sursa (job #424055) | Cod sursa (job #2348050) | Cod sursa (job #2768561) | Cod sursa (job #1487594) | Cod sursa (job #1403370)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("loto.in");
ofstream g ("loto.out");
int sw=1,i,v[105],q,n,s,z,j,j1,sum;
struct aaa
{
int x,e[3];
}r[1000000];
int main()
{
f>>n>>s;
for (i=1;i<=n;i++)
f>>v[i];
for (i=1;i<=n;i++)
{
sum=v[i];
for (j=1;j<=n;j++)
{
sum+=v[j];
for (z=1;z<=n;z++)
{
sum+=v[z];
q++;
r[q].x=sum;
r[q].e[0]=i;
r[q].e[1]=j;
r[q].e[2]=z;
sum-=v[z];
}
sum-=v[j];
}
sum-=v[i];
}
for (i=1;i<=q;i++)
{
for (j=1;j<=q;j++)
{
if (r[i].x+r[j].x==s)
{
g<<v[r[i].e[0]]<<' '<<v[r[i].e[1]]<<' '<<v[r[i].e[2]]<<' '<<v[r[j].e[0]]<<' '<<v[r[j].e[1]]<<' '<<v[r[j].e[2]]<<' ';
return 0;
}
}
}
g<<-1;
return 0;
}