Pagini recente » Cod sursa (job #349169) | Cod sursa (job #859212) | Cod sursa (job #2815810) | Cod sursa (job #2157081) | Cod sursa (job #45532)
Cod sursa(job #45532)
#include <iostream.h>
#include <fstream.h>
int main()
{
int p,n,k,i,j,t,x[101];
long s,ss,a[101];
ifstream fin("loto.in");
ofstream fout("loto.out");
fin>>n>>s;
for (i=1;i<=n;i++)
fin>>a[i];
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++)
if (a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
k=1; x[k]=0;
if (6*a[n]<s && 6*a[1]>s)
{
fout<<"-1"<<endl;
fout.close();
fin.close();
}
while (k>0)
{
p=0;
while (p==0 && x[k]<n)
{
x[k]++;
ss=0;
for (i=1;i<=k;i++)
ss=ss+a[x[i]];
if (ss<=s)
{
p=1;
}
}
if (p==0)
{
k--;
}
else
if (k==6)
{
ss=0;
for (i=1;i<=k;i++)
ss=ss+a[x[i]];
if (ss==s)
{
for (i=1;i<=k;i++)
fout<<a[x[i]]<<" ";
break;
}
}
else
{
k++;
x[k]=0;
}
}
fout<<endl;
fout.close();
fin.close();
return 0;
}