Pagini recente » Cod sursa (job #1177293) | Cod sursa (job #487123) | Cod sursa (job #2191120) | Cod sursa (job #1188086) | Cod sursa (job #1252612)
#include <fstream>
#define Vect 110
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
long long nr,S,i,j,k,l,m,n,ok,a[Vect];
int main()
{
f >> nr >> S;
for(i = 1; i <= nr; i++)
f >> a[i];
for(i = 1; i <= nr && ok == 0; i++)
for(j = 1; j <= nr && ok == 0; j++)
for(k = 1; k <= nr && ok == 0; k++)
for(l = 1; l <= nr && ok == 0; l++)
for(m = 1; m <= nr && ok == 0; m++)
for(n = 1; n <= nr && ok == 0; n++){
if(a[i]+a[j]+a[k]+a[l]+a[m]+a[n]==S){
g<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<a[l]<<" "<<a[m]<<" "<<a[n];
ok=1;
break;
}
if(a[i]+a[j]+a[k]+a[l]+a[m]+a[n] > S){
ok = 2;
break;
}
}
if(ok==0 || ok==2)
g<<-1;
return 0;
}