題目鏈接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?

problemId=5381

Information Theory is one of the most popular courses in Marjar University. In this course, there is an important chapter about information entropy.

Entropy is the average amount of information contained in each message received. Here, a message stands for an event, or a sample or a character drawn from a distribution or a data stream. Entropy thus characterizes our uncertainty about our source of information. The source is also characterized by the probability distribution of the samples drawn from it. The idea here is that the less likely an event is, the more information it provides when it occurs.

Generally, "entropy" stands for "disorder" or uncertainty. The entropy we talk about here was introduced by Claude E. Shannon in his 1948 paper "A Mathematical Theory of Communication". We also call it Shannon entropy or information entropy to distinguish from other occurrences of the term, which appears in various parts of physics in different forms.

Named after Boltzmann's H-theorem, Shannon defined the entropy Η (Greek letter Η, η) of a discrete random variable?X?with possible values?{x₁, x₂, ..., x_n}?and probability mass function?P(X)?as:

H(X)=E(?ln(P(x)))

Here E is the expected value operator. When taken from a finite sample, the entropy can explicitly be written as

H(X)=?∑i=1nP(xi)log?b(P(xi))

Where?b?is the base of the logarithm used. Common values of b are 2, Euler's number?e, and 10. The unit of entropy is?bit?for?b?= 2,?nat?for?b?=?e, and?dit?(or digit) for?b?= 10 respectively.

In the case of?P(x_i)?= 0 for some?i, the value of the corresponding summand 0 log_b(0) is taken to be a well-known limit:

0log?b(0)=limp→0+plog?b(p)

Your task is to calculate the entropy of a finite sample with?N?values.

Input

There are multiple test cases. The first line of input contains an integer?T?indicating the number of test cases. For each test case:

The first line contains an integer?N?(1 <=?N?<= 100) and a string?S. The string?S?is one of "bit", "nat" or "dit", indicating the unit of entropy.

In the next line, there are?N?non-negative integers?P₁,?P₂, ..,?P_N.?P_i?means the probability of the?i-th value in percentage and the sum of?P_i?will be 100.

Output

For each test case, output the entropy in the corresponding unit.

Any solution with a relative or absolute error of at most 10^-8?will be accepted.

Sample Input

3 3 bit 25 25 50 7 nat 1 2 4 8 16 32 37 10 dit 10 10 10 10 10 10 10 10 10 10

Sample Output

1.500000000000 1.480810832465 1.000000000000

---

Author:?ZHOU, Yuchen

PS:2014年ACM/ICPC 亞洲區(qū)域賽牡丹江（第一站）現(xiàn)場(chǎng)賽

代碼例如以下：

#include<cstdio> #include<cmath> #include <cstring> const double e = exp(1.0); double judge(char s[]) {if(strcmp("bit",s) == 0)return 2.0;else if(strcmp("nat",s) == 0)return e;else if(strcmp("dit",s) == 0)return 10.0;} int main() {int t;int n;char s[7];double p[117];//printf("%lf\n",e);scanf("%d",&t);while(t--){scanf("%d",&n);scanf("%s",s);double b = judge(s);for(int i = 0; i < n; i++){scanf("%lf",&p[i]);p[i] /= 100.0;}double ans = 0;double tt = log(b);for(int i = 0; i < n; i++){if(p[i] != 0)ans+=p[i]*log(p[i])/tt;else if(p[i] == 0){ans+=0;}}ans = -ans;printf("%.12lf\n",ans);}return 0; }

轉(zhuǎn)載于:https://www.cnblogs.com/gccbuaa/p/6856836.html

與50位技術(shù)專家面對(duì)面20年技術(shù)見證，附贈(zèng)技術(shù)全景圖

總結(jié)

以上是生活随笔為你收集整理的ZOJ 3827 Information Entropy（数学题 牡丹江现场赛）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。