Pagini recente » Cod sursa (job #2538832) | Cod sursa (job #197346) | Cod sursa (job #46363) | Cod sursa (job #120170) | Cod sursa (job #1869421)
#include <fstream>
using namespace std;
ifstream fin("progresii.in");
ofstream fout("progresii.out");
int n,m,j,k,l,i,p[100005],s,sol[100005],ct;
int main()
{fin>>n>>m>>k>>l;
for(i=1;i<=n;i++)
{fin>>p[i];
s=s+l-p[i]+1;
}
for(i=n;i>=1;i--)
{if(s-(l-p[i]+1)+(l-p[i]+1)/m+1>=k){ct++;sol[ct]=m;s=s-(l-p[i]+1)+(l-p[i]+1)/m+1;}
else {s=s-(l-p[i]+1);
m=(l-p[i]+1)/(k-s-1);
s=k;ct++;sol[ct]=m;break;
}
if(s==k)break;
}
for(i=n;i>=1;i--)
{if(sol[i])fout<<sol[i]<<"\n";
else fout<<"1\n";
}
}