Pagini recente » Cod sursa (job #1915518) | Cod sursa (job #911529) | Cod sursa (job #1934247) | Cod sursa (job #396887) | Cod sursa (job #2740554)
#include <iostream>
#include <fstream>
using namespace std;
int v[200],p[200],i,j,k,n,s,t=0,a,suma,ok,ok1=0;
int main()
{
ifstream f("loto.in");
ofstream g("loto.out");
f>>n>>s;
for (i=0;i<n;i++) f>>v[i];
for (i=0;i<n;i++)
for (j=0;j<n;j++)
for (k=0;k<n;k++)
{
p[t]=v[i]+v[j]+v[k];
t++;
}
for (i=0;i<n;i++)
for (j=0;j<n;j++)
for (k=0;k<n;k++)
{
suma=s-v[i]-v[j]-v[k];
ok=0;
for (a=0;a<t;a++)
if (p[a]==suma) {ok=1;break;}
if (ok==1)
{
g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" ";
ok1=1;
for (i=0;i<n;i++)
for (j=0;j<n;j++)
for (k=0;k<n;k++)
if (v[i]+v[j]+v[k]==suma)
{
g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" ";
return 0;
}
}
}
if (ok1==0) g<<-1;
f.close();
g.close();
return 0;
}