比较简单的一道题目,直接暴力求解即可,同时要记得将方差的公式进行化简之后再使用,具体实现见如下代码:
#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;
typedef long double LL;
unsigned long long seed;
long double gen() {
static const long double Z = (long double)1.0 / (1LL << 32); seed >>= 16;
seed &= (1ULL << 32) - 1;
seed *= seed;
return seed * Z;
}
int main(){
LL T;
cin >> T;
for (LL i = 1; i <= T; i++){
LL n;
cin >> n >> seed;
LL sum1 = 0, sum2 = 0;
for (int i = 0; i < n; i++){
LL temp = gen();
sum1 += temp*temp;
sum2 += temp;
}
sum2 = sum2 / n;
LL ans = sum1 / n - sum2*sum2;
cout << "Case #" << i << ": "<<fixed<<setprecision(5)<< sqrt(ans) << endl;
cout << defaultfloat;
}
}