Pagini recente » Cod sursa (job #1800956) | Cod sursa (job #986194) | Borderou de evaluare (job #224788) | Cod sursa (job #3206125) | Cod sursa (job #2031603)
#include <fstream>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
int n, s, s_verif, OK;
int v[110], a[10];
void backtracking (int k)
{
if (OK == 0)
{
if (k == 7)
{
s_verif = 0;
for (int i = 1; i <= 6; i++)
s_verif = s_verif + a[i];
if(s_verif == s)
{
for (int i = 1; i <= 6; i++)
out << a[i] << ' ';
OK = 1;
}
}
else
{
for (int i = 1; i <= n; i++)
{
a[k] = v[i];
backtracking(k + 1);
}
}
}
}
int main()
{
in >> n >> s;
for (int i = 1; i <= n; i++)
in >> v[i];
backtracking (1);
if (OK == 0)
out << -1;
return 0;
}