Pagini recente » Cod sursa (job #1911951) | Cod sursa (job #3202653) | Cod sursa (job #968836) | Cod sursa (job #3257751) | Cod sursa (job #588325)
Cod sursa(job #588325)
#include <iostream>
#include <fstream>
using namespace std;
long int s,s1;
int n,a[102],b[7],nr,ok;
int main()
{
ifstream fin("loto.in");
ofstream fout("loto.out");
fin>>n>>s;
for (int i=0;i<n;i++)
{
fin>>a[i];
b[i]=a[i];
s1=s1+b[i];
}
nr=6-n;
if (nr==0)
ok=1;
if (nr==1 && ok==0)
{
for (int i=0;i<n;i++)
if (a[i]+s1==s)
{
ok=1;
b[5]=a[i];
}
}
if (ok==0)
{
for (int i=0;i<n;i++)
{
if (ok==0)
{
int k=s1;
int x=nr;
for (int j=0;j<n;j++)
{
k=k+a[i];
b[x]=a[i];
x++;
if (x<=6 && j!=i)
{
k=k+a[j];
b[x]=a[j];
x++;
}
}
if (k==s)
ok=1;
}
}
}
if (ok==0)
fout<<"-1";
else
for (int i=0;i<6;i++)
fout<<b[i]<<" ";
fin.close();
fout.close();
return 0;
}