Pagini recente » Cod sursa (job #2301065) | Cod sursa (job #1458416) | Monitorul de evaluare | Cod sursa (job #1189521) | Cod sursa (job #1415382)
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
int v[101],w[1000001];
int main()
{
int n,i,cnt=1,s,a,b,c,k=1,j;
in>>n>>s;
for(i=1;i<=n;i++)in>>v[i];
i=1;
for(a=1;a<=n;a++)
for(b=1;b<=n;b++)
for(c=1;c<=n;c++)
{
w[k]=v[a]+v[b]+v[c];
j=s-w[k];
k++;
i=1;
while(i<=k&&w[i]!=j) i++;
if(i<=k&&cnt<=2)
{
out<<v[a]<<" "<<v[b]<<" "<<v[c]<<" ";
cnt++;}
}
if(cnt!=3)out<<-1;
return 0;
}