Pagini recente » Cod sursa (job #201739) | Cod sursa (job #142392) | Cod sursa (job #241446) | Cod sursa (job #1184940) | Cod sursa (job #2014380)
#include <fstream>
using namespace std;
ifstream in ("loto.in");
ofstream out ("loto.out");
int v[101],sol[7],i,i1,i2,i3,i4,i5;
int main()
{
long long mi,ma,n,s;
in>>n>>s;
mi=100000005;
ma=-1;
for(i=1;i<=n;i++)
{
in>>v[i];
if(v[i]<mi)
mi=v[i];
if(v[i]>ma)
ma=v[i];
}
if(s>ma*6)
out<<"-1";
else
if(mi*6>s)
out<<"-1";
else
{
for(i=1;i<=n;i++)
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++)
if(v[i]+v[i2]+v[i3]+v[i4]+v[i5]==s)
{
i=n+1;
out<<v[i]<<" "<<v[i2]<<" "<<v[i3]<<" "<<v[i4]<<" "<<v[i5];
}
}
return 0;
}