Pagini recente » Cod sursa (job #2829994) | Cod sursa (job #2942203) | Cod sursa (job #2321180) | Cod sursa (job #1899231) | Cod sursa (job #1701932)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");int n,i2,i1,i3,i4,i5,i6,s;
int v[101];
int main()
{
in>>n>>s;
for(i1=1;i1<=n;i1++)
in>>v[i1];
if(v[max_element(v+1,v+n+1)-v]*6<s)
{
out<<-1;
return 0;
}
for(i1=1;i1<=n;i1++)
for(i2=1;i2<=n;i2++)
for(i3=1;i3<=n;i3++)
for(i4=1;i4<=n;i4++)
for(i5=1;i5<=n;i5++)
for(i6=1;i6<=n;i6++)
{
if(v[i1]+v[i2]+v[i3]+v[i4]+v[i5]+v[i6]==s)
{out<<v[i1]<<" "<<v[i2]<<" "<<v[i3]<<" "<<v[i4]<<" "<<v[i5]<<" "<<v[i6];return 0;}
}
out<<-1;
return 0;
}