Pagini recente » Cod sursa (job #2016562) | Cod sursa (job #907563) | Monitorul de evaluare | Cod sursa (job #2433324) | Cod sursa (job #183421)
Cod sursa(job #183421)
#include<stdio.h>
int main()
{
int s,v[101]={0},sm,da=0;
int n,i,j,k,t;
int x[7]={0},up,avans;
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);
scanf("%d%d",&n,&s);
for(i=1;i<=n;i++) scanf("%d",&v[i]);
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j]) {t=v[i];v[i]=v[j];v[j]=t;}
if(6*v[1]>s||6*v[n]<s) {printf("-1");return 0;}
k=1;x[k]=0;
while(k){
up=0;
if(x[k]<n) {
x[k]++;
up=1;
}
if(up)
if(k==6) { sm=0;
for(i=1;i<=6;i++) sm+=v[x[i]];
if(sm==s) {da=1;break;}
if(sm>s) k--;
}
else {k++;x[k]=x[k-1]-1;avans=0;}
else k--;
}
if(da)
for(i=1;i<=6;i++) printf("%d ",v[x[i]]);
else
printf("-1");
return 0;
}