Cod sursa(job #2346385)
| Utilizator | Data | 17 februarie 2019 16:56:34 | |
|---|---|---|---|
| Problema | Progresii | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("progresii.in");
ofstream out("progresii.out");
const int maxn = 100005;
int sp[maxn];
int v[maxn];
int main()
{
int n, m, k, L;
in >> n >> m >> k >> L;
for(int i = 1; i <= n; i++)
{
in >> v[i];
v[i] = L - v[i];
sp[i] = sp[i - 1] + v[i] / m + 1;
}
int sum = 0;
for(int i = 1; i <= n; i++)
{
int r = k - (sum + sp[n] - sp[i]);
int vit = v[i] / r + 1;
out << vit << "\n";
sum = sum + v[i] / vit + 1;
}
return 0;
}
