Pagini recente » Istoria paginii utilizator/mihu | Cod sursa (job #2012648) | Clasament rating | Monitorul de evaluare | Cod sursa (job #133020)
Cod sursa(job #133020)
#include <fstream.h>
long nr[101],s;
int n;
ifstream f("loto.in");
ofstream g("loto.out");
void sort()
{
int i,j;
long aux;
for (i=1;i<=n-1;i++)
for (j=i+1;j<=n;j++)
if (nr[i]<nr[j])
{
aux=nr[i];
nr[i]=nr[j];
nr[j]=aux;
}
}
void rezolva()
{
int i,j,k,l,m,x,sw;
sw=1;
for (i=n;i>=1 && sw==1;i--)
for (j=n;j>=1 && sw==1;j--)
for (k=n;k>=1 && sw==1;k--)
for (l=n;l>=1 && sw==1;l--)
for (m=n;m>=1 && sw==1;m--)
for (x=n;x>=1 && sw==1;x--)
if (nr[i]+nr[j]+nr[k]+nr[l]+nr[m]+nr[x]==s)
{
g<<nr[i]<<" "<<nr[j]<<" "<<nr[k]<<" "<<nr[l]<<" "<<nr[m]<<" "<<nr[x];
sw=0;
}
if (sw==1)
g<<-1;
g.close();
}
void citeste()
{
f>>n>>s;
int i;
for (i=1;i<=n;i++)
f>>nr[i];
f.close();
}
int main()
{
citeste();
sort();
rezolva();
return 0;
}