Pagini recente » Cod sursa (job #623426) | Cod sursa (job #1090267) | Cod sursa (job #10598) | Cod sursa (job #1627361) | Cod sursa (job #1542032)
#include <fstream>
using namespace std;
int i, n, p, a,b,c,d,e,f, v[100001];
ifstream in("loto.in");
ofstream out("loto.out");
int main()
{
in>>n>>p;
for(i=1;i<=n;i++) in>>v[i];
for(a=1;a<=n;a++)
for(b=1;b<=n;b++)
for(c=1;c<=n;c++)
for(d=1;d<=n;d++)
for(e=1;e<=n;e++)
for(f=1;f<=n;f++)
{
if(v[a]+v[b]+v[c]+v[d]+v[e]+v[f]==p)
{
out<<v[a]<<' '<<v[b]<<' '<<v[c]<<' '<<v[d]<<' '<<v[e]<<' '<<v[f];
return 0;
}
}
out<<-1;
return 0;
}