Pagini recente » Cod sursa (job #2169319) | Cod sursa (job #2454231) | Cod sursa (job #2627854) | Cod sursa (job #860592) | Cod sursa (job #926996)
Cod sursa(job #926996)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n,s,x[101],i,j,sum,i1,i2,i3,i4,i5,i6,m;
int main()
{
f>>n>>s;
for(i=1;i<=n;i++) f>>x[i];
for(i1=1;i1<=n;i1++)
for(i2=i1;i2<=n;i2++)
for(i3=i2;i3<=n;i3++)
for(i4=i3;i4<=n;i4++)
for(i5=i4;i5<=n;i5++)
for(i6=i5;i6<=n;i6++)
if(x[i1]+x[i2]+x[i3]+x[i4]+x[i5]+x[i6]==s) {g<<x[i1]<<' '<<x[i2]<<' '<<x[i3]<<' '<<x[i4]<<' '<<x[i5]<<' '<<x[i6]<<'\n'; return 0;}
g<<-1<<'\n';
f.close();
g.close();
return 0;
}