Pagini recente » Cod sursa (job #1066720) | Cod sursa (job #2827269) | Cod sursa (job #1371226) | Cod sursa (job #2131147) | Cod sursa (job #1403232)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("loto.in");
ofstream g ("loto.out");
int sw=1,i,v[105],q[10],n,s;
void tip()
{
int i;
for (i=1;i<=6;i++)
g<<v[q[i]]<<' ';
}
void Back (int k,int sum)
{
int i;
for (i=q[k-1],1;i<=n&&sw;i++)
{
sum+=v[i];
q[k]=i;
if (k<6)
Back (k+1,sum);
else if (sum==s)
{
tip();
sw=0;
}
sum-=v[i];
}
}
int main()
{
f>>n>>s;
for (i=1;i<=n;i++)
f>>v[i];
q[0]=1;
Back(1,0);
if (sw) g<<-1;
return 0;
}