Pagini recente » Cod sursa (job #74436) | Cod sursa (job #1891612) | Rating Nagy Marton (NMy_ia) | Cod sursa (job #1914839) | Cod sursa (job #52545)
Cod sursa(job #52545)
#include<fstream.h>
int n,i,j,k,m,q;
long long int s,a[100],p;
int main()
{ ifstream fin("loto.in");
ofstream fout("loto.out");
fin>>n>>s;
for(i=1;i<=n;i++)
{ fin>>a[i];
if(a[i]*6==s) for(j=1;j<=6;j++)
fout<<a[i]<<" ";
}
if(a[n]*6<s) fout<<-1;
else for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{ if(s-a[i]*5==a[j]){ for(k=1;k<=5;k++)
fout<<a[i]<<" ";
fout<<a[j];
break;
}
else
{ if(s-(a[i]*4)==(a[j]*2)){ for(k=1;k<=4;k++)
fout<<a[i]<<" ";
fout<<a[j]<<" "<<a[j];
break;
}
p=s-(a[i]*4);
for(m=1;m<=n;m++)
for(q=m;q<=n;q++)
if(p==a[m]+a[q]) { for(k=1;k<=4;k++)
fout<<a[i]<<" ";
fout<<a[m]<<" "<<a[q];
}
break;
}
}
fin.close();
fout.close();
return 0;
}