Pagini recente » Cod sursa (job #3146308) | Cod sursa (job #975480) | Cod sursa (job #2712457) | Cod sursa (job #1983127) | Cod sursa (job #1010423)
#include<fstream>
using namespace std;
int N,i,j,k,l,m,o,v[100];
bool ok=1;
long S;
int main()
{ifstream f("loto.in");
ofstream g("loto.out");
f>>N>>S;
for(i=1;i<=N;i++)
f>>v[i];
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
for(k=1;k<=N;k++)
for(l=1;l<=N;l++)
for(m=1;m<=N;m++)
for(o=1;o<=N&&ok;o++)
if(v[i]+v[j]+v[k]+v[l]+v[m]+v[o]==S)
{g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[m]<<" "<<v[o];
ok=0;}
if(ok)
g<<-1;
f.close();g.close();
return 0;
}