Pagini recente » Cod sursa (job #421377) | Cod sursa (job #2144335) | Cod sursa (job #1480112) | Cod sursa (job #1862825) | Cod sursa (job #1165496)
#include <cstdio>
using namespace std;
int X[105];
int main()
{
freopen("loto.out","w",stdout);
freopen("loto.in","r",stdin);
int N,S,k;
scanf("%d%d",&N,&S);
for(register int i=1; i<=N; ++i)
scanf("%d",&X[i]);
///N=k;
for (register int i = 1; i <= N && 6 * X[i] <= S; ++i)
for (register int j = i; j <= N && X[i] + 5 * X[j] <= S; ++j)
for (register int k = j; k <= N && X[i] + X[j] + 4 * X[k] <= S; ++k)
for (register int l = k; l <= N && X[i] + X[j] + X[k] + 3 * X[l] <= S; ++l)
for (register int m = l; m <= N && X[i] + X[j] + X[k] + X[l] + 2 * X[m] <= S; ++m)
for (register int n = m; n <= N && X[i] + X[j] + X[k] + X[l] + X[m] + X[n] <= S; ++n)
if ( X[i] + X[j] + X[k] + X[l] + X[m] + X[n] == S)
{
printf("%d %d %d %d %d %d\n", X[i], X[j], X[k], X[l], X[m], X[n]);
return 0;
}
printf("-1\n");
return 0;
}