Pagini recente » Cod sursa (job #2634203) | Cod sursa (job #2204499) | Cod sursa (job #567649) | Cod sursa (job #2927357) | Cod sursa (job #52300)
Cod sursa(job #52300)
#include <fstream.h>
#include <iostream.h>
ifstream f("loto.in");
ofstream g("loto.out");
main()
{
int b[7],n,a[101],i,j,k,l,m,o,s,sw=0;
f>>n;
f>>s;
for (i=1;i<=n;i++)
f>>a[i];
f.close();
int aux;
for (i=1;i<=n-1;i++)
for (j=i+1;j<=n;j++)
if (a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for (i=1;i<=n && sw==0;i++)
for (j=1;j<=n && sw==0;j++)
for (k=1;k<=n && sw==0;k++)
for (l=1;l<=n && sw==0;l++)
for (m=1;m<=n && sw==0;m++)
for (o=1;o<=n && sw==0;o++)
if(a[i]+a[j]+a[k]+a[l]+a[m]+a[o]==s)
{
sw=1;
b[1]=a[i];
b[2]=a[j];
b[3]=a[k];
b[4]=a[l];
b[5]=a[m];
b[6]=a[o];
}
if (sw==1)
for(i=1;i<=6;i++)
g<<b[i]<<" ";
else
g<<"-1";
g.close();
}