Pagini recente » Cod sursa (job #2185339) | Cod sursa (job #3128350) | Cod sursa (job #2123450) | Cod sursa (job #2890700) | Cod sursa (job #1807595)
#include<fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream in("loto.in");
int n, s;
int nb[100];
in >> n >> s;
int am = 0;
int sor = s;
for (int i = 0; i < n; i++)
{
in >> nb[i];
am = i;
}
int v[6] = { 0 };
int fs = 6;
int ar = am;
int fsum = 0;
for (int i = 0; i < 6; i++)
{
while (v[i] == 0)
{
if (nb[am] !=0 && s / nb[am] >= fs)
{
v[i] = nb[am];
s -= nb[am];
fs--;
fsum += nb[am];
am = ar;
}
else if (am > 0) am--; else { v[i] = -1; break; }
}
if (v[i] == -1) break;
}
ofstream out("loto.out");
if (fsum != sor) out << -1;
else
{
for (int i = 0; i < 6; i++)
{
out << v[i] << " ";
}
}
return 0;
}