这篇博客介绍了Codeforces Gym中的一道题目B. A Lot of Joy。题目要求计算两个男孩在分别将字符串s切分成单个字母并轮流取出比较，直到所有字母取出时，他们因取出相同字母而欢欣的期望次数。输入为长度1到200000的字符串s，由小写拉丁字母组成。输出为期望的欢欣次数，精确到10^-9。样例输入为'abc'，输出为1.000000000000000。博客提供了题意解析和作者的猜测答案。
B. A Lot of Joy
Time Limit: 20 Sec
Memory Limit: 256 MB
题目连接
http://codeforces.com/gym/100187/problem/A
Description
Two boys Gena and Petya wrote on two strips of paper the same string s that consisted of lowercase Latin letters. Then each boy took one strip, cut it into small pieces so that each piece contained exactly one letter and put all pieces into his pocket. After that Gena and Petya repeated the following procedure until their pockets became empty: they took one piece from their pockets and rejoiced if the letters on these pieces were equal.
Determine the expected number of times the boys rejoiced during this process.
Input
The input contains the only string s which was initially written on Gena's and Petya's strips. The string has length between 1 and 200000, inclusively, and consists of lowercase Latin letters.
Output
Output the only real number — the expected number of times Gena and Petya rejoiced during their business. The absolute or relative error of the answer should not exceed 10 - 9.
Sample Input
abc
最低0.47元/天 解锁文章
13万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
