Pagini recente » Cod sursa (job #860228) | Cod sursa (job #1620490) | Cod sursa (job #366748) | Cod sursa (job #1865178) | Cod sursa (job #2910677)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n;
int A[110];
int V[10];
long long s, S;
void Read();
void Solve(int k, int poz);
void Print();
int main()
{
Read();
Solve(1, 1);
fout << -1;
}
void Read()
{
S = 0;
fin >> n >> s;
for(int i = 1; i <= n; ++i)
fin >> A[i];
sort(A + 1, A + n + 1);
}
void Solve(int k, int poz)
{
if(k > 6)
{
Print();
return;
}
for(int i = poz; i <= n and S <= s; ++i)
{
V[k] = A[i];
S += A[i];
Solve(k + 1, i);
S -= A[i];
}
}
void Print()
{
if(s == S)
{
for(int i = 1; i <= 6; ++i)
fout << V[i] << ' ';
exit(0);
}
}