Pagini recente » Cod sursa (job #1754813) | Cod sursa (job #2287090) | Cod sursa (job #1662906) | Cod sursa (job #1149284) | Cod sursa (job #189655)
Cod sursa(job #189655)
#include<stdio.h>
long long n,m,k,l;
long long d[100010],v[100010],ram,sum;
int main()
{
freopen("progresii.in","r",stdin);
freopen("progresii.out","w",stdout);
scanf("%lld%lld%lld%lld",&n,&m,&k,&l);
int i;
long long aux,aux1;
for(i=1; i<=n; i++)
{
scanf("%d",&aux);
d[i]=l-aux;
v[i]=d[i]/m+1;
if(d[i]%m)
v[i]--;
sum+=v[i];
}
//for(i=n; i>1; i--)
// v[i-1]+=v[i];
if(sum>k)
{
printf("-1\n");
return 0;
}
if(sum==k)
for(i=1; i<=n; i++)
printf("%lld\n",m);
ram=k-sum;
for(i=1; (i<=n)&&(ram); i++)
{
if(ram==1)
{
aux=d[i]+1;
if(aux<m)
{
printf("%lld\n",aux);
ram--;
}
else
printf("%lld\n",m);
}
else
{
aux=d[i]/(ram-1);
if(d[i]%(ram-1))
aux++;
if(aux<m)
{
printf("%lld\n",aux);
aux1=d[i]/aux+1;
if(d[i]%aux)
aux1++;
ram=ram-aux1+v[i];
}
else
printf("%lld\n",m);
}
}
return 0;
}