Pagini recente » Cod sursa (job #2039246) | Cod sursa (job #561387) | Cod sursa (job #1354479) | Cod sursa (job #402415) | Cod sursa (job #1369846)
#include <iostream>
#include <fstream>
#define VECTOR_SIZE 100
#define FIN "loto.in"
#define FOUT "loto.out"
using namespace std;
int N,S;
int v[VECTOR_SIZE];
int sume[VECTOR_SIZE*VECTOR_SIZE*VECTOR_SIZE];
int main(){
ifstream in(FIN);
ofstream out(FOUT);
in >> N >> S;
for(int i=0; i < N; i++){
in >> v[i];
}
for(int i=0; i < N; i++){
for(int j=0; j < N; j++){
for(int k=0; k < N; k++){
for(int l=0; l < N; l++){
for(int o=0; o < N; o++){
for(int p=0; p < N; p++){
if(S == v[i] + v[j] + v[k] + v[l] + v[o] + v[p]){
out << v[i] << " "
<< v[j] << " "
<< v[k] << " "
<< v[l] << " "
<< v[o] << " "
<< v[p];
in.close();
out.close();
return 0;
}
}
}
}
}
}
}
in.close();
out.close();
return 0;
}