Pagini recente » Cod sursa (job #821965) | Cod sursa (job #3207417) | Cod sursa (job #34681) | Cod sursa (job #1455701) | Cod sursa (job #1415499)
#include <fstream>
#include <vector>
#include <algorithm>
#define MOD 666013
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
vector <int> v[MOD+1];
int s,a[102],n,i,j,z,d,sum,sumc,c,sol1,sol2,sol3,sol4,sol5,sol6;
bool ok;
int main()
{
f>>n>>s;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=n;i++)
for (j=i;j<=n;j++)
for (z=j;z<=n;z++)
sum=a[i]+a[j]+a[z],
v[sum%MOD].push_back(sum);
ok=false;
for (i=1;i<=n;i++)
for (j=i;j<=n;j++)
for (z=j;z<=n;z++)
{
sum=a[i]+a[j]+a[z];
sumc=s-sum;
c=sumc%MOD;
for (d=0;d<v[c].size();d++)
if (sumc==v[c][d]) ok=true,d=v[c].size();
if (ok==true) sol1=a[i],sol2=a[j],sol3=a[z],i=n+1,j=n+1,z=n+1;
}
if (sol1==0) g<<-1<<'\n';
else
{
for (i=1;i<=n;i++)
for (j=i;j<=n;j++)
for (z=j;z<=n;z++)
if (a[i]+a[j]+a[z]==sumc)
sol4=a[i],sol5=a[j],sol6=a[z],i=n+1,j=n+1,z=n+1;
g<<sol1<<' '<<sol2<<' '<<sol3<<' '<<sol4<<' '<<sol5<<' '<<sol6<<'\n';
}
return 0;
}