Pagini recente » Cod sursa (job #172442) | Cod sursa (job #544869) | Cod sursa (job #488745) | Cod sursa (job #439865) | Cod sursa (job #51540)
Cod sursa(job #51540)
#include <iostream>
#include <fstream>
//#include <algoritm>
using namespace std;
int i,j,k,l,m,n,p,moneda[7],ok,sum,s;
int main() {
ifstream fin("loto.in");
fin>>n>>s;
for(i=1;i<=n;i++) fin>>moneda[i];
//sort(moneda+1,moneda+n);
fin.close();
ofstream fout("loto.out");
sum=0;
ok=1;
for(i=1;i<=n&&ok;i++)
for(j=1;j<=n&&ok;j++)
for(k=1;k<=n&&ok;k++)
for(l=1;l<=n&&ok;l++)
for(m=1;m<=n&&ok;m++)
for(p=1;p<=n&&ok;p++)
if(moneda[i]+moneda[j]+moneda[k]+moneda[l]+moneda[m]+moneda[p]==s) {
fout<<moneda[i]<<" "<<moneda[j]<<" "<<moneda[k]<<" "<<moneda[l]<<" "<<moneda[m]<<" "<<moneda[p];
ok=0;
}
if(ok) fout<<-1;
fout.close();
return 0;
}