Pagini recente » Cod sursa (job #225322) | Cod sursa (job #1995548) | Cod sursa (job #2614821) | Cod sursa (job #2892862) | Cod sursa (job #52517)
Cod sursa(job #52517)
#include<fstream.h>
int n,i,j,k;
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(n==6){ for(i=1;i<=n;i++)
p+=a[i];
if(p==s) for(j=1;j<=n;j++)
fout<<a[j]<<" ";
}
else
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)){ if(a[i]<a[j])
{ for(k=1;k<=4;k++)
fout<<a[i]<<" ";
fout<<a[j]<<" "<<a[j];
}
else
{ fout<<a[j]<<" "<<a[j]<<" ";
for(k=1;k<=4;k++)
fout<<a[i]<<" ";
}
}
break;
}
}
fin.close();
fout.close();
return 0;
}