Pagini recente » Cod sursa (job #109796) | Cod sursa (job #2097861) | Cod sursa (job #364292) | Cod sursa (job #1659423) | Cod sursa (job #45518)
Cod sursa(job #45518)
#include <iostream.h>
#include <fstream.h>
int main()
{
int p,n,k,i,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];
k=1; x[k]=0;
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-(n-k)*a[1])
{
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.close();
fin.close();
return 0;
}