Pagini recente » Cod sursa (job #2487929) | Cod sursa (job #1372178) | Monitorul de evaluare | Cod sursa (job #817024) | Cod sursa (job #1851144)
#include<fstream>
#define DIM 100005
using namespace std;
int n, m, i, v;
long long k, r, L;
int p[DIM];
long long nd[DIM];
ifstream fin("progresii.in");
ofstream fout("progresii.out");
int main(){
fin>> n >> m >> k >> L;
for(i = 1; i <= n; i++){
fin>> p[i];
nd[i] = (L - p[i]) / m + 1;
r += nd[i];
}
if(r > k){
fout<<"-1\n";
return 0;
}
for(i = 1; i <= n; i++){
r -= nd[i];
v = (L - p[i]) / (k - r) + 1;
k -= ( (L - p[i]) / v + 1);
fout<< v <<"\n";
}
return 0;
}