Pagini recente » Cod sursa (job #1861107) | Cod sursa (job #2288122) | Cod sursa (job #598240) | Cod sursa (job #2594004) | Cod sursa (job #973537)
Cod sursa(job #973537)
#include<fstream>
#include<cstdlib>
#include<iostream>
using namespace std;
int n,i,j,k,a[101],sol[101],ok;
long S,s;
ofstream g("loto.out");
void backi(int k)
{
if(S==s)
{
for(i=1;i<=k-1;i++)
for(j=1;j<=sol[i];j++)
g<<a[i]<<" ";
ok=1;
exit(EXIT_SUCCESS);
}
else
{
sol[k]=-1;
while(sol[k]*a[k]+s<S && k<n+1)
{
sol[k]++;
s=sol[k]*a[k]+s;
backi(k+1);
s=s-sol[k]*a[k];
}
}
}
int main()
{
ifstream f("loto.in");
f>>n>>S;
for(i=1;i<=n;i++)
f>>a[i];
backi(1);
if(!ok) g<<-1;
}