Pagini recente » Cod sursa (job #1779912) | Cod sursa (job #2574363) | Cod sursa (job #1464736) | Cod sursa (job #1652336) | Cod sursa (job #987342)
Cod sursa(job #987342)
# include <iostream>
# include <fstream>
# include <vector>
using namespace std;
# define MAXN 103
# define MOD 666013
ifstream f("loto.in");
ofstream g("loto.out");
int n, s;
int a[MAXN];
vector<int> hash[MAXN];
void addHash(int x) {
int aux = x % MOD;
hash[aux].push_back(x);
}
bool getHash(int x) {
bool ok = false;
int aux = x % MOD;
for (int i = 0; i < hash[aux].size(); i++) {
if (hash[aux][i] == x) {
ok = true;
break;
}
}
return ok;
}
int main()
{
f >> n >> s;
for (int i = 1; i <= n; i++) {
f >> a[i];
addHash(a[i]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
for (int l = 1; l <= n; l++) {
for (int m = 1; m <= n; m++) {
int aux = s - a[i] - a[j] - a[k] - a[l] - a[m];
if (aux > 0 && getHash(aux) == true) {
g << a[i] << ' ' << a[j] << ' ' << a[k] << ' ';
g << a[l] << ' ' << a[m] << ' ' << aux;
return 0;
}
}
}
}
}
}
g << -1;
return 0;
}