QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#748388 | #5304. Money Game | zaqmju# | TL | 0ms | 0kb | C++23 | 835b | 2024-11-14 20:15:39 | 2024-11-14 20:15:39 |
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define LF(x) fixed << setprecision(x)
const int N = 2e8;
void solve() {
int n; cin >> n;
vector<long double>a(n);
int m = N / n;
for(auto &i:a)cin >> i;
vector<long double>b = a;
auto cal = [&](vector<long double> &v) -> void{
for(int i = 0; i < n - 1; i++){
v[i + 1] += v[i] / 2.0;
v[i] /= 2.0;
}
v[0] += v[n - 1] / 2.0;
v[n - 1] /= 2.0;
};
int cnt = 1;
cal(b);
while(cnt < m){
cnt++;
cal(b);
// for(auto i:b)cout << i <<' ';
// cout <<endl;
}
// cout << cnt << endl;
for(int i = 0; i < n; i++) {
cout << LF(10) << b[i] << " ";
}
// cout << endl;
}
#undef int
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin >> t;
while(t--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Time Limit Exceeded
input:
2 4 2
output:
4.0000000000 2.0000000000