Pagini recente » Cod sursa (job #1227093) | Cod sursa (job #2217037) | Cod sursa (job #1788650) | Cod sursa (job #2829906) | Cod sursa (job #1035654)
#include <fstream>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int main()
{
int n, s, sc;
int i, j, t, o, p, q;
fin >> n >> s;
int sn[101];
for ( i = 1; i <= n; i++ )
fin >> sn[i];
for ( i = 1; i <= n; i++ )
for ( j = 1; j <= n; j++ )
for ( t = 1; t <= n; t++ )
for ( o = 1; o <= n; o++ )
for ( p = 1; p <= n; p++ )
for ( q = 1; q <= n; q++ )
if ( sn[i] + sn[j] + sn[t] + sn[o] + sn[p] + sn[q] == s )
{
fout << ' ' << sn[i] << ' ' << sn[j] << ' ' << sn[t] << ' ' << sn[o] << ' ' << sn[p] << ' ' << sn[q] << '\n';
fin.close();
fout.close();
return 0;
}
fout << "-1\n";
fin.close();
fout.close();
return 0;
}