Pagini recente » Cod sursa (job #2944380) | Cod sursa (job #2528716) | Cod sursa (job #2522391) | Monitorul de evaluare | Cod sursa (job #2536953)
#include <fstream>
#include <math.h>
using namespace std;
int oua[100001];
int oua1[100001];
int S[100001];
ifstream fin("ou.in");
ofstream fout("ou.out");
int main(){
int n,i,cas;
fin>>n;
for(i=1;i<=n;i++){
fin>>oua[i];
}
for(i=2;i<n;i++){
if(i<=n/2.0+0.5){
cas=(i-1)*2;
}else{
cas=(n-i)*2;
}
oua[i-cas/2]+=oua[i]/cas;
oua[i+cas/2+1]-=oua[i]/cas;
oua[i]-=2*(oua[i]/cas);
}
for(i=1;i<=n;i++)
S[i]=S[i-1]+oua[i];
for(i=1;i<=n;i++)
fout<<S[i]<<' ';
return 0;
}