Pagini recente » Cod sursa (job #1400450) | Cod sursa (job #1364775) | Cod sursa (job #186234) | Cod sursa (job #2367686) | Cod sursa (job #190291)
Cod sursa(job #190291)
#include<stdio.h>
long long n,m,k,l,s,v[100010],ram;
long long p[100010];
char c[20];
int caut(int x)
{
int p=1,q=m,mij,aux;
while(p<q)
{
mij=(p+q)>>1;
aux=v[x]/mij;
if(aux<=ram)
q=mij;
else
p=mij+1;
}
return p;
}
/*void citeste(int w)
{
fgets(c,20,stdin);
int i;
for(i=0; (c[i]!='\0')&&(c[i]!='\n'); i++)
v[w]=v[w]*10+c[i]-'0';
}*/
int main()
{
freopen("progresii.in","r",stdin);
freopen("progresii.out","w",stdout);
scanf("%lld%lld%lld%lld\n",&n,&m,&k,&l);
int aux,aux1;
int i;
s=n;
for(i=1; i<=n; i++)
{
scanf("%lld",&v[i]);
//citeste(i);
v[i]=l-v[i];
if(v[i]>0)
{
aux=v[i]/m;
p[i]=aux;
s+=aux;
}
}
ram=k-s;
if(ram<0)
{
printf("-1\n");
return 0;
}
for(i=1; i<=n; i++)
{
ram+=p[i];
aux=caut(i);
if(aux<m)
{
aux1=v[i]/aux;
while(aux1>ram)
{
aux++;
aux1=v[i]/aux;
}
printf("%d\n",aux);
ram-=aux1;
}
else
{
ram-=p[i];
printf("%lld\n",m);
}
}
return 0;
}