Pagini recente » Cod sursa (job #3246789) | Cod sursa (job #2603458) | Cod sursa (job #1282733) | Cod sursa (job #2764305) | Cod sursa (job #3132044)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
bool genereaza(const vector<int>& num, vector<int>& num_selectate, int suma_finala, int suma_curenta, size_t start, size_t k) {
if (k == 0) {
return suma_curenta == suma_finala;
}
for (size_t i = start; i <= num.size() - k; i++) {
int new_sum = suma_curenta + num[i];
if (new_sum <= suma_finala) {
num_selectate.push_back(num[i]);
if (genereaza(num, num_selectate, suma_finala, new_sum, i + 1, k - 1)) {
return true;
}
num_selectate.pop_back();
}
}
return false;
}
vector<int> gaseste_finale(int N, int S, const vector<int>& num_loterie) {
vector<int> sortate = num_loterie;
sort(sortate.begin(), sortate.end());
vector<int> num_selectate;
if (genereaza(sortate, num_selectate, S, 0, 0, 6)) {
return num_selectate;
} else {
return vector<int>{-1};
}
}
int main() {
int N, S;
vector<int> num_loterie;
// CITIREA
ifstream input("loto.in");
input >> N >> S;
num_loterie.resize(N);
for (int i = 0; i < N; i++) {
input >> num_loterie[i];
}
input.close();
// CALCULARE NUMERE CASTIGATOARE
vector<int> castigator = gaseste_finale(N, S, num_loterie);
// AFISARE
ofstream output("loto.out");
if (castigator[0] == -1) {
output << "-1" << endl;
} else {
for (size_t i = 0; i < castigator.size(); i++) {
output << castigator[i] << " ";
}
output << endl;
}
output.close();
return 0;
}