Pagini recente » Cod sursa (job #619660) | Cod sursa (job #139513) | Cod sursa (job #368100) | Cod sursa (job #1219677) | Cod sursa (job #346295)
Cod sursa(job #346295)
#include<iostream.h>
#include<fstream.h>
main()
{
int a[100],n,i,s,j,max=0,s2=1,k;
ifstream f("loto.in");
ofstream g("loto.out");
f>>n;
f>>s;
for(i=1; i<=n; i++)
{
f>>a[i];
if(a[i] > max) max=a[i];
}
i=5;
k=1;
while(s != s2 || i!=0 )
{
if(i*max < s){
s2=i*max;
for(j=1; j<=n; j++)
{
if(s2+a[j]*k==s){
s2=s2+a[j]*k;
while(k)
{
g<<a[j]<<" ";
k--;
}
while(i)
{
g<<max<<" ";
i--;
}
break;
}
}
}
if(s != s2){ i--;
k++;
}
}
if(s!=s2)g<<"-1";
f.close();
g.close();
return 0;
}