Pagini recente » Cod sursa (job #2503252) | Cod sursa (job #1222188) | Cod sursa (job #2774606) | Cod sursa (job #2662573) | Cod sursa (job #189553)
Cod sursa(job #189553)
#include <stdio.h>
int main ()
{
int n,l,k,m,a,s=0,i,j=1;
int p[200000000];
int v[200000000];
int c[200000000];
freopen ("progresii.in","r",stdin);
freopen ("progresii.out","w",stdout);
scanf("%d%d%d%d",&n,&m,&k,&l);
for (i=1;i<=n;i++)
scanf ("%d",&p[i]);
for (i=1;i<=n;i++)
{
c[i]=0;
a=p[i];
while (a<=l)
{
c[i]++;
a+=m;
}
s+=c[i];
}
//printf ("%d",s);
i=1;
while ((s<k)&&(i<=n))
{
s-=c[i];
c[i]=0;
a=p[i];
while (a<=l)
{
c[i]++;
a+=m-j;
}
s+=c[i];
j++;
if ((s>k)||(m-j<1))
{
i++;
j=1;
}
}
for (i=1;i<=n;i++)
{
v[i]=(l-p[i]+1)/c[i];
}
for (i=1;i<=n;i++)
printf ("%d\n",v[i]);
//printf ("%d",s);
return 0;
}