Pagini recente » Infoarena Monthly 2014 - Runda 9, Solutii | Cod sursa (job #145433) | Cod sursa (job #2279079) | Cod sursa (job #223574) | Cod sursa (job #1160839)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f1("loto.in");
ofstream f2("loto.out");
main()
{long long s, v[100001];
unsigned int n, g=0, i, j, k, l, m, p;
f1>>n>>s;
for (i=1; i<=n; i++)
f1>>v[i];
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
for (k=1; k<=n; k++)
for (l=1; l<=n; l++)
for (m=1; m<=n; m++)
for (p=1; p<=n; p++)
if(((v[i]+v[j]+v[k]+v[l]+v[m]+v[p])==s)&&(g==0))
{f2<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[m]<<" "<<v[p];
g=1;}
if (g==0) f2<<"-1";
f2.close();
return 0;
}