Pagini recente » Cod sursa (job #2531746) | Cod sursa (job #829077) | Cod sursa (job #1991069) | Cod sursa (job #596396) | Cod sursa (job #1010980)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("loto.in");
ofstream g ("loto.out");
int s, n, ok=0,suma=0; long v[100],sol[7],bilet[7];
void back (int k)
{ int i;
if(k==7 && ok==0)
if (suma==s)
{ ok=1;
for (i=1;i<k;i++)
bilet[i]=v[sol[i]];}
else
{sol [k]= -1;
while (v[sol[k]]+ suma<s)
{
sol[k]++;
suma+=v[sol[k]];
back(k+1);
suma-=v[sol[k]];
}}
}
int main()
{ int i;
f>>n>>s;
for (i=0;i<n;i++)
f>>v[i];
back(1);
if(ok==1)
for(i=1;i<=6;i++)
g<<bilet[i]<<" ";
else g <<-1;
return 0;
}