HPUACM 省赛B

最新推荐文章于 2019-11-25 21:31:20 发布

gtuif

最新推荐文章于 2019-11-25 21:31:20 发布

阅读量457

点赞数

分类专栏： HPU ACM 思维

本文链接：https://blog.csdn.net/gtuif/article/details/64176589

版权

思维同时被 2 个专栏收录

29 篇文章 0 订阅

订阅专栏

HPU ACM

17 篇文章 0 订阅

订阅专栏

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.

Example

Input

abc

Output

1.000000000000000

Input

zzz

Output

3.000000000000000

题意：有两个男孩，写两张具有相同字符串的纸条，他们将这些纸条撕成小碎片，一个小碎片只有一个字母，然后每人随机抽一个碎片，若碎片上的字母相同就兴奋一次，求兴奋次数的数学期望。。。。（expected居然是期望的意思。。。醉了，怪不得输入没看懂，要好好学英语了QAQ）；

思路：就是求期望的方法。。。统计每个字母出现的次数，算出期望即可。。。。

下面附上代码：

#include<cstdio>
#include<cstring>
char s[200000];
int a[26];
int main()
{
	while(gets(s)!=NULL)
	{
		int l=strlen(s);
		memset(a,0,sizeof(a));
		for(int i=0;i<l;i++)
		{
			a[s[i]-'a']++;
		}
		double ans=0.0;
		for(int i=0;i<26;i++)
		{
			ans+=(double)a[i]*a[i]/l;
		}
		printf("%0.15lf\n",ans);
	}	
	return 0;
}