Pagini recente » Cod sursa (job #785080) | Cod sursa (job #1127677) | Cod sursa (job #2273502) | Cod sursa (job #2149685) | Cod sursa (job #1276836)
#include<fstream>
#define MAX 114
using namespace std;
ifstream fin ("loto.in");
ofstream fout ("loto.out");
int N,S,V[MAX];
void citeste()
{
int i;
fin>>N>>S;
for(i=1; i<=N; i++)
fin>>V[i];
}
void proceseaza()
{
int i,j,k,l,m,n;
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(n=1; n<=N; n++)
if (V[i]+V[j]+V[k]+V[l]+V[m]+V[n]==S)
{
fout<<V[i]<<" "<<V[j]<<" "<<V[k]<<" "<<V[l]<<" "<<V[m]<<" "<<V[n];
return;
}
fout<<"-1";
}
int main()
{
citeste();
proceseaza();
return 0;
}