Pagini recente » Cod sursa (job #885651) | Cod sursa (job #1113032) | Cod sursa (job #3219757) | Cod sursa (job #763207) | Cod sursa (job #2390812)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
long long v[101];
int x[7];
int main()
{
long long n, s, a, e, i, o, u, j, S, aux, ok=0;
fin >> n >> S;
for(i=1; i<=n; i++)
fin>> v[i];
i=1;
while(i!=0 && ok==0)
{
while(i<=6 && i>0)
{
x[i]++;
if(x[i]>n)
{
x[i]=0;
i--;
}
else
i++;
}
if(i>6)
{
i=6;
s=0;
for(j=1; j<=6; j++)
s=s+v[x[j]];
if(s==S) ok=1;
}
}
if(ok==0) fout << -1;
else
for(i=1; i<=6; i++)
fout << v[x[i]] << ' ';
return 0;
}