Cod sursa(job #2841249)
Utilizator | Data | 29 ianuarie 2022 14:02:48 | |
---|---|---|---|
Problema | Loto | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int V[1009];
int main()
{
long long S;
int i,j,k,l,n,m,N;
f>>N>>S;
for(i=1;i<=N;i++) f>>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(n=1;n<=N;n++)
if (V[i]+V[j]+V[k]+V[l]+V[m]+V[n]==S)
{
g<<V[i]<<" "<<V[j]<<" "<<V[k]<<" "<<V[l]<<" "<<V[m]<<" "<<V[n]<<" "<<endl;
return 1;
}
g<<-1;
}