Pagini recente » Cod sursa (job #2612039) | Cod sursa (job #2520611) | Cod sursa (job #3245211) | Cod sursa (job #2060127) | Cod sursa (job #3279643)
#include <bits/stdc++.h>
#define DIM 101
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n, s, sum=0;
int v[DIM], sol[7];
bool gasit = false;
bool verificare(int &suma){
suma = 0;
for(int i=1;i<=6;i++){
suma+=sol[i];
}
return suma==s;
}
void bkt(int poz){
if(gasit == true) {
return;
}
if(poz==7){
if(verificare(sum)){
gasit = true;
}
return;
}
for(int i=1;i<=n;i++){
sol[poz] = v[i];
bkt(poz+1);
if(gasit){
return;
}
}
}
int main() {
fin >> n >> s;
for(int i=1;i<=n;i++){
fin >> v[i];
}
sort(v+1,v+n+1);
bkt(1);
if(gasit){
for(int i=1;i<=6;i++){
fout << sol[i] << " ";
}
}
else
fout << -1;
return 0;
}