Pagini recente » Cod sursa (job #2989142) | Cod sursa (job #960759) | Cod sursa (job #2325082) | Cod sursa (job #1861585) | Cod sursa (job #130502)
Cod sursa(job #130502)
#include <iostream>
#include <fstream>
using namespace std;
int S(0),
N(0),
v[100];
int main(int argc, char *argv[]) {
ifstream fin("loto.in");
fin >> N >> S;
for (int i(0); i < N; ++i)
fin >> v[i];
fin.close();
for (int i(0); i < N; ++i)
for (int j(0); j < N; ++j)
for (int k(0); k < N; ++k)
for (int l(0); l < N; ++l)
for (int m(0); m < N; ++m)
for (int n(0); n < N; ++n)
if (v[i] + v[j] + v[k] + v[l] + v[m] + v[n] == S) {
ofstream fout("loto.out");
fout << v[i] << " " << v[j] << " " << v[k] << " " << v[l] << " " << v[m] << " " << v[n] << endl;
fout.close();
return 0;
}
ofstream fout("loto.out");
fout << -1 << endl;
fout.close();
return 0;
}