#include #define pq priority_queue using namespace std; typedef pair P; typedef pair P2; typedef pair P3; constexpr long long gcd(long long a, long long b){return b ? gcd(b, a % b) : a;} constexpr long long lcm(long long a, long long b){return a / gcd(a, b) * b;} constexpr int INF = 1e9, MOD = INF + 7, around[] = {0, 1, 1, -1, -1, 0, -1, 1, 0, 0}; constexpr int mod_pow(long long x, long long n, const int mod){long long ret=1;while(n){if(n&1)(ret*=x)%=mod;(x*=x)%=mod;n>>=1;}return ret;} template struct Prime{bool arr[n+1];constexpr bool operator[](int k){return arr[k];}constexpr Prime():arr(){for(int i=2;i struct Factorial{long long arr[n+1],ary[n+1];constexpr Factorial():arr(),ary(){arr[0]=1;ary[0]=1;for(int i=0;i fact; constexpr Prime<10> prime; constexpr long long comb(int a, int b){if(a < b) return 0LL;if(!a or !b) return 1LL; long long pos = fact.arr[a], pot = fact.ary[a - b], por = fact.ary[b]; return pos * pot % MOD * por % MOD;} template struct Bernoulli{long long arr[n+1];constexpr Bernoulli():arr(){arr[0]=1;for(int i=1;i<=n;i++){long long sum=0;for(int j=0;j> s; int sum[100010] = {}; for(int i = 0; i < s.size(); i++) sum[i + 1] = sum[i] + (s[i] == 'o'); for(int i = 0; i < s.size(); i++){ cout << fixed << setprecision(10); cout << (long double)(sum[s.size()] - sum[i]) * 100.0 / (long double)(s.size() - i) << endl; } return 0; }