Pagini recente » Cod sursa (job #2261355) | Cod sursa (job #151310) | Cod sursa (job #1844909) | Cod sursa (job #2480032) | Cod sursa (job #2032679)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
struct loto
{
int a;
int b;
int c;
int suma;
}bilet[1000010];
int n, s, nr;
int v[110];
int main()
{
in >> n >> s;
for (int i = 1; i <= n; i++)
in >> v[i];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
for (int k = 1; k <= n; k++)
{
nr++;
bilet[nr].suma = v[i] + v[j] + v[k];
bilet[nr].a = v[i];
bilet[nr].b = v[j];
bilet[nr].c = v[k];
}
}
}
for (int i = 1; i <= nr; i++)
{
for (int j = 1; j <= nr; j++)
{
if (bilet[i].suma + bilet[j].suma == s)
{
out << bilet[i].a << ' ' << bilet[i].b << ' ' << bilet[i].c << ' ' << bilet[j].a << ' ' << bilet[j].b << ' ' << bilet[j].c;
return 0;
}
}
}
out << -1;
return 0;
}