AcWing 4509. 归一化处理
原题链接
简单
作者:
Coinisi.
,
2023-01-11 08:41:44
,
所有人可见
,
阅读 207
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 1007;
int a[N];
double d;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int n, sum = 0; cin >> n;
for(int i = 1; i <= n; i ++)
{
cin >> a[i];
sum = sum + a[i];
}
double av = (double)sum / (double)n;
for(int i = 1; i <= n; i ++)
d = d + pow(a[i] - av, 2);
d = d * (1 / (double)n), d = sqrt(d);
for(int i = 1; i <= n; i ++)
printf("%.16lf\n", ((double)a[i] - av) / d);
}