Pagini recente » Cod sursa (job #2126402) | Cod sursa (job #139561) | Cod sursa (job #1068089) | Cod sursa (job #2909235) | Cod sursa (job #3131916)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ifstream fin("loto.in");
ofstream fout("loto.out");
int N, S;
fin >> N >> S;
vector<int> numbers(N);
for (int i = 0; i < N; i++) {
fin >> numbers[i];
}
fin.close();
sort(numbers.begin(), numbers.end());
vector<int> ticket(6);
bool found = false;
for (int i = 0; i < N && !found; i++) {
for (int j = i; j < N && !found; j++) {
for (int k = j; k < N && !found; k++) {
for (int l = k; l < N && !found; l++) {
for (int m = l; m < N && !found; m++) {
for (int n = m; n < N && !found; n++) {
if (numbers[i] + numbers[j] + numbers[k] + numbers[l] + numbers[m] + numbers[n] == S) {
ticket[0] = numbers[i];
ticket[1] = numbers[j];
ticket[2] = numbers[k];
ticket[3] = numbers[l];
ticket[4] = numbers[m];
ticket[5] = numbers[n];
found = true;
}
}
}
}
}
}
}
if (found) {
for (int i = 0; i < 6; i++) {
fout << ticket[i] << " ";
}
fout << "\n";
} else {
fout << "-1\n";
}
fout.close();
return 0;
}