Pagini recente » Cod sursa (job #336665) | Cod sursa (job #2635799) | Cod sursa (job #2482186) | Cod sursa (job #2906659) | Cod sursa (job #792036)
Cod sursa(job #792036)
//
// main.cpp
// a1
//
// Created by abc on 9/20/12.
// Copyright (c) 2012 abc. All rights reserved.
//
# include <iostream>
# include <cstdio>
# include <cstdlib>
# include <iomanip>
# include <cmath>
# include <map>
# include <vector>
# include <set>
# include <algorithm>
using namespace std;
# define ISALPHA(Q) (('a' <= Q && Q <= 'z') || ('A' <= Q && Q <= 'Z'))
# define ISDIGIT(a) ('0' <= a && a <= '9')
# define TODIGIT(a) (a - '0')
typedef unsigned char U8;
typedef long long LONG;
void init()
{
freopen("loto.in", "r", stdin);
freopen("loto.out", "w", stdout);
}
template <typename T> void read(vector<T> &vec)
{
for(size_t i=0; i<vec.size(); ++i) {
cin >> vec[i];
}
}
typedef struct {
int a,b,c;
} Cont_t;
int main(int argc, const char * argv[])
{
init();
int N, S; cin >> N >> S;
vector<int> vec(N); read(vec);
map<int, Cont_t> conv;
for(int i=0; i<N; ++i)
{
for(int k=0; k<N; ++k)
{
for(int j=0; j<N; ++j)
{
conv[vec[i]+vec[k]+vec[j]] = {vec[i], vec[k], vec[j]};
}
}
}
for(map<int, Cont_t>::iterator it = conv.begin(); it != conv.end(); ++it)
{
int left = it->first;
int right = S - left;
if (conv.find(right) != conv.end())
{
printf("%d %d %d %d %d %d", conv[left].a, conv[left].b, conv[left].c,
conv[right].a, conv[right].b, conv[right].c);
return 0;
}
}
cout << -1;
return 0;
}