Pagini recente » Cod sursa (job #1385886) | Cod sursa (job #1488962) | Cod sursa (job #2552386) | Cod sursa (job #1470460) | Cod sursa (job #2761315)
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
string NumeFisier = "loto";
ifstream fin(NumeFisier + ".in");
ofstream fout(NumeFisier + ".out");
typedef unsigned long long int ull;
int main()
{
int n, SUM, v[102];
fin >> n >> SUM;
for (int i = 1; i <= n; i++)
fin >> v[i];
//sort
for (int i = 1; i < n; i++)
for (int j = i + 1; j <= n; j++)
if (v[i] > v[j])
swap(v[i], v[j]);
if (v[n] * 6 < SUM)
{
fout << -1;
return 0;
}
for (int i1 = 1; i1 <= n; i1++)
for (int i2 = 1; i2 <= n; i2++)
for (int i3 = 1; i3 <= n; i3++)
for (int i4 = 1; i4 <= n; i4++)
for (int i5 = 1; i5 <= n; i5++)
for (int i6 = 1; i6 <= n; i6++)
if (v[i1] + v[i2] + v[i3] + v[i4] + v[i5] + v[i6] == SUM)
{
fout << v[i1] << " " << v[i2] << " " << v[i3] << " " << v[i4] << " " << v[i5] << " " << v[i6];
return 0;
}
fout << -1;
}