Pagini recente » Cod sursa (job #3215378) | Cod sursa (job #568156) | Cod sursa (job #568391) | Cod sursa (job #246194) | Cod sursa (job #3131904)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
bool found = false;
void backtrack(const vector<int>& numbers, vector<int>& combination, int index, int current_sum, int target_sum)
{
if (combination.size() == 6 && current_sum == target_sum)
{
for (int i = 0; i < 6; i++)
{
fout << combination[i] << " ";
}
found = true;
return;
}
if (index >= numbers.size() || current_sum > target_sum)
{
return;
}
for (int i = index; i < numbers.size(); i++)
{
combination.push_back(numbers[i]);
backtrack(numbers, combination, i, current_sum + numbers[i], target_sum);
combination.pop_back();
if (found)
{
return;
}
}
}
int main()
{
int N, S;
fin >> N >> S;
vector<int> numbers(N);
for (int i = 0; i < N; i++)
{
fin >> numbers[i];
}
fin.close();
vector<int> combination;
backtrack(numbers, combination, 0, 0, S);
if (!found)
{
fout << -1;
}
fout.close();
return 0;
}