Pagini recente » Cod sursa (job #2061551) | Cod sursa (job #2829691) | Cod sursa (job #136711) | Cod sursa (job #1788485) | Cod sursa (job #2742860)
#include <vector>
#include <iostream>
#include <fstream>
using namespace std;
int main(){
int n;
int suma;
vector < int > v;
vector < vector < int > > elemente_2;
vector < vector < int > > elemente_4;
ifstream fin( "loto.in" );
ofstream fout( "loto.out" );
fin >> n >> suma;
for( int i = 0; i < n; i++ ){
int x;
fin >> x;
v.push_back(x);
}
for( int i = 0; i < v.size(); i++ ){
for( int j = 0; j < v.size(); j++ ){
if( v[i]+v[j] < suma ){
vector < int > v1;
v1.push_back(v[i]);
v1.push_back(v[j]);
elemente_2.push_back(v1);
}
}
}
int ok = 1;
for( int i = 0; i < elemente_2.size() && ok == 1 ; i++ ){
for( int j = 0; j < elemente_2.size() && ok == 1 ; j++ ){
for( int k = 0; k < elemente_2.size() && ok == 1; k++ ){
if( elemente_2[i][0] + elemente_2[i][1] + elemente_2[j][0] + elemente_2[j][1] + elemente_2[k][0] + elemente_2[k][1] == suma ){
fout << elemente_2[i][0] << " " << elemente_2[i][1] << " " << elemente_2[j][0] << " " << elemente_2[j][1] << " " << elemente_2[k][0] << " " << elemente_2[k][1];
ok = 0;
}
}
}
}
if( ok == 1 ) fout << -1;
}