Pagini recente » Cod sursa (job #2024724) | Cod sursa (job #597066) | Cod sursa (job #1404831) | Cod sursa (job #2833533) | Cod sursa (job #593970)
Cod sursa(job #593970)
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n,a[105];
long long s;
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);
scanf("%d",&n);
scanf("%lld",&s);
for (int i=0; i<n; ++i)
scanf("%d",a+i);
for (int i=0; i<n /*&& 6*a[i] >= s*/; ++i)
for (int j=i; j<n/* && a[i]+5*a[j] >= s*/; ++j)
for (int k=j; k<n/* && a[i]+a[j]+4*a[k] >=s*/; ++k)
for (int l=k; l<n/* && a[i]+a[j]+a[k]+3*a[l] >= s*/; ++l)
for (int p=l; p<n/* && a[i]+a[j]+a[k]+a[l]+2*a[p] >= s*/; ++p)
for (int q=p; q<n /*&& a[i]+a[j]+a[k]+a[l]+a[p]+a[q] >= s*/; ++q)
if (a[i]+a[j]+a[k]+a[l]+a[p]+a[q] == s){
printf("%d %d %d %d %d %d",a[i],a[j],a[k],a[l],a[p],a[q]);
return 0;
}
printf("-1");
return 0;
}