Pagini recente » Borderou de evaluare (job #2623622) | Diferente pentru problema/transform2 intre reviziile 1 si 2 | Borderou de evaluare (job #2542634) | Borderou de evaluare (job #3365820) | Cod sursa (job #3365820)
#include <fstream>
using namespace std;
int v[101];
int main()
{
ifstream fin("loto.in");
ofstream fout("loto.out");
int n;
long long S;
bool gasit = false;
fin >> n >> S;
for (int i = 0; i < n; i++)
{
fin >> v[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 p = 0; p < n; p++)
{
for (int q = 0; q < n; q++)
{
long long suma = v[i] + v[j] + v[k]
+ v[l] + v[p] + v[q];
if (suma == S)
{
fout << v[i] << " "
<< v[j] << " "
<< v[k] << " "
<< v[l] << " "
<< v[p] << " "
<< v[q];
gasit = true;
break;
}
}
}
}
}
}
}
if (!gasit)
{
fout << -1;
}
return 0;
}