Pagini recente » Cod sursa (job #1013692) | Cod sursa (job #2828756) | Cod sursa (job #1014410) | Cod sursa (job #1673014) | Cod sursa (job #2745253)
#include <fstream>
#include <unordered_map>
#include <string>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n,aux, s, v[101],ok;
unordered_map<string, int> umap;
int main(){
fin>>n>>s;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
aux=v[i]+v[j]+v[k];
umap[to_string(aux)]=k+j*1000+i*1000000;
if(umap[to_string(s-aux)]!=0){
fout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[umap[to_string(s-aux)]%1000]<<" "<<v[umap[to_string(s-aux)]/1000%1000]<<" "<<v[umap[to_string(s-aux)]/1000000];
ok=1;
break;
}
}
if(ok==1)
break;
}
if(ok==1)
break;
}
}