Pagini recente » Cod sursa (job #1028612) | Cod sursa (job #2340423) | Cod sursa (job #669171) | Cod sursa (job #155473) | Cod sursa (job #1165635)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int main()
{
int N, S, a[102], b[102];
fin >> N >> S;
for ( int i = 0; i < N; ++i )
fin >> a[i], b[i] = a[i];
sort ( a, a + N);
if ( 6 * a[N-1] < S ) fout << "-1";
for ( int i = 0; i < N; ++i )
for ( int j = 0; j < N; ++j )
for ( int k = 0; k < N; ++k )
for ( int l = 0; l < N; ++l )
for ( int m = 0; m < N; ++m )
for ( int n = 0; n < N; ++n )
{
if ( b[i] + b[j] + b[k] + b[l] + b[m] + b[n] == S ) fout << b[i] << ' '<< b[j] << ' ' << b[k] << ' ' << b[l] << ' ' << b[m] << ' ' << b[n] << '\n', i = N, j = N, k = N, l = N, m = N, n = N;
}
fin.close();
fout.close();
return 0;
}