Pagini recente » Cod sursa (job #347353) | Cod sursa (job #2924755) | Cod sursa (job #194997) | Cod sursa (job #2696916) | Cod sursa (job #590825)
Cod sursa(job #590825)
#include<fstream.h>
int n,i,j,t,l,r,k;
long s,v[101],y[101];
void merge(long v[101],int p,int q)
{int m=(p+q)/2,i,j,k;
if(p==q)
return;
merge(v,p,m);
merge(v,m+1,q);
for(i=p,j=m+1,k=p;i<=m||j<=q;)
if(j>q||(i<=m&&v[i]<v[j]))
y[k++]=v[i++];
else
y[k++]=v[j++];
for(i=p;i<=q;i++)
v[i]=y[i];}
int main()
{ifstream f("loto.in");
ofstream g("loto.out");
f>>n>>s;
for(i=1;i<=n;i++)
f>>v[i];
merge(v,1,n);
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
for(t=j;t<=n;t++)
for(l=t;l<=n;l++)
for(k=l;k<=n;k++)
for(r=k;r<=n;r++)
if(v[i]+v[j]+v[t]+v[l]+v[k]+v[r]==s)
{g<<v[i]<<" "<<v[j]<<" "<<v[t]<<" "<<v[l]<<" "<<v[k]<<" "<<v[r];
return 0;}
g<<"-1";
f.close();
g.close();
return 0;}