Pagini recente » Cod sursa (job #76631) | Cod sursa (job #1680145) | Cod sursa (job #1215448) | Cod sursa (job #358624) | Cod sursa (job #1336897)
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <limits>
#include <sstream>
#include <deque>
#include <bitset>
#include <complex>
#include <functional>
#include <memory>
#include <numeric>
#define x first
#define y second
typedef std::pair<int, int> pii;
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n, s, x[102];
int main () {
fin >> n >> s;
for(int i = 0; i < n; i++)
fin >> x[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 m = 0; m < n; m++)
for(int v = 0; v < n; v++)
if((x[i] + x[j] + x[k] + x[l] + x[m] + x[v]) == s)
{
fout << x[i] << " " << x[j] << " " << x[k] << " " << x[l] << " " << x[m] << " " << x[v] << " ";
exit(0);
}
fout << "-1";
return 0;
}