Pagini recente » Cod sursa (job #921903) | Cod sursa (job #610576) | Cod sursa (job #2778905) | Cod sursa (job #2984599) | Cod sursa (job #1403195)
#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()
{
for (i=1;i<=6;i++)
g<<q[i]<<' ';
}
void Back (int k,int sum)
{
int i;
for (i=1;i<=n&&sw;i++)
{
sum+=v[i];
q[k]=v[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];
Back(1,0);
if (sw) g<<-1;
return 0;
}