Pagini recente » Cod sursa (job #349713) | Cod sursa (job #1307182) | Cod sursa (job #138077) | Cod sursa (job #2142175) | Cod sursa (job #1020820)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("loto.in");
ofstream out ("loto.out");
int N, S, v[101];
int subprogram()
{
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 p=0;p<N;p++)
if (v[i]+v[j]+v[k]+v[l]+v[m]+v[p]==S)
{
out<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[m]<<" "<<v[p];
return 0;
}
return -1;
}
int main()
{
int ok=0;
in>>N>>S;
for (int i=0;i<N;i++)
in>>v[i];
if (subprogram()==-1) out<<-1;
return 0;
}