Pagini recente » Cod sursa (job #2887951) | Cod sursa (job #373963) | Cod sursa (job #1726548) | Cod sursa (job #2088549) | Cod sursa (job #1994183)
#include <fstream>
#define MAX 100002
#define ll long long
using namespace std;
ifstream fin("progresii.in");
ofstream fout("progresii.out");
int v[MAX],n,m;
ll k,l;
int main()
{
fin >> n >> m >> k >> l;
ll s=0;
for (int i=1;i<=n;i++)
{
fin >> v[i];
s+=(l-v[i]+1)/m;
if ((l-v[i]+1)%m)
s++;
}
if (s>k)
fout << "-1\n";
for (int i=1;i<=n;i++)
{
s-=(l-v[i]+1)/m;
if ((l-v[i]+1)%m)
s--;
int nr=(l-v[i]+1)/(k-s);
if ((l-v[i]+1)%(k-s))
nr++;
fout << nr << "\n";
s+=(l-v[i]+1)/nr;
if ((l-v[i]+1)%nr)
s++;
}
return 0;
}