Pagini recente » Cod sursa (job #2500878) | Cod sursa (job #1529735) | Cod sursa (job #2919668) | Cod sursa (job #934547) | Cod sursa (job #165758)
Cod sursa(job #165758)
#include <cstdio>
const int maxn = 100001;
FILE *in = fopen("progresii.in","r"), *out = fopen("progresii.out","w");
int n, m, k, l;
int a[maxn];
int b[maxn];
int tot;
void read()
{
fscanf(in, "%d %d %d %d", &n, &m, &k, &l);
for ( int i = 1; i <= n; ++i )
{
fscanf(in, "%d", &a[i]);
tot = tot + (l - a[i] + 1);
}
}
void go()
{
int vi, kk;
for ( int i = n; i; --i )
{
vi = 1;
kk = l - a[i];
while ( vi <= m && tot > k )
{
++vi;
tot = tot - (kk / vi + 1);
}
b[i] = vi;
}
for ( int i = 1; i <= n; ++i )
fprintf(out, "%d\n", b[i]);
}
int main()
{
read();
go();
return 0;
}