This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
const int G=20;
const int N=15;
int n,g;
ld dp[N];
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
string s;
cin >> s;
n=s.size();
for(int i=1;i<=n;i++){
dp[i]=dp[i-1];
dp[i]+=1.l*(1ll*(i/2)*(i/2-1))/i;
if(i&1)dp[i]+=1.l*(i/2)/i;
}
cout << dp[n] << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |