Pagini recente » Cod sursa (job #1189521) | Cod sursa (job #2401777) | Cod sursa (job #940851) | Cod sursa (job #183255) | Cod sursa (job #711670)
Cod sursa(job #711670)
#include <iostream>
#include <fstream>
using namespace std;
int v[101], sol[6], n;
int solve(int k, int x, int s)
{
int i;
if(k==6)
{
if(s==x)
{
sol[k]==x;
return 1;
}
else return 0;
}
else
{
for(i=1;i<=n;i++)
{
if(solve(k+1, v[i], s-x))
{
sol[k]=x;
return 1;
}
}
return false;
}
}
int main()
{
ifstream f("loto.in");
ofstream g("loto.out");
int i, j, sum;
f>>n>>sum;
v[0]=0;
for(i=1;i<=n;i++)
f>>v[i];
if(solve(1, v[1], sum))
for(i=1;i<=6;i++)
g<<sol[i]<<" ";
else g<<-1<<" ";
return 0;
}