Pagini recente » Cod sursa (job #1257757) | Cod sursa (job #2267748) | Cod sursa (job #824531) | Cod sursa (job #1845673) | Cod sursa (job #1281637)
#include <fstream>
#include<algorithm>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
long long s;
int n, i, j, k, l , m, o;
long a[105];
int main()
{
cin>>n>>s;
for(i=1;i<=n;i++)
cin>>a[i];
sort(a+1, a+n+1);
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
for(k=j;j<=n;k++)
for(l=k;l<=n;l++)
for(m=l;m<=n;m++)
for(o=m;o<=n;o++)
if(a[i]+a[j]+a[k]+a[l]+a[m]+a[o]==s)
{
cout<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<a[l]<<" "<<a[m]<<" "<<a[o];
return 0;
}
cout<<"-1";
return 0;
}