Pagini recente » Cod sursa (job #2875146) | Cod sursa (job #2802255) | Cod sursa (job #2314754) | Cod sursa (job #2447091) | Cod sursa (job #2652249)
#include <fstream>
using namespace std;
const int NMAX = 100;
int v[1 + NMAX];
int sol[7];
int n, s;
bool gasit = false;
int suma_crt;
void back(int index)
{
if (index > 6)
{
if (suma_crt == s)
{
gasit = true;
}
return;
}
else
{
for (int i = 1; i <= n; i++)
{
sol[index] = i;
suma_crt += v[i];
back(index + 1);
if (gasit)
{
return;
}
suma_crt -= v[i];
}
}
}
int main()
{
ifstream in("loto.in");
ofstream out("loto.out");
in >> n >> s;
for (int i = 1; i <= n; i++)
{
in >> v[i];
}
back(1);
if (!gasit)
{
out << -1;
}
else
{
for (int i = 1; i <= 6; i++)
{
out << v[sol[i]] << ' ';
}
}
return 0;
}