首页 > 代码库 > CSU 1290
CSU 1290
1290: Random Integers
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 72 Solved: 45
[Submit][Status][Web Board]
Description
We choose an integer K (K > 0). Then we generate N (N > 0) integers one by one randomly, each of them is in range [0, K - 1], and the appearing probabilities of each interger is the same,they are all 1/K.
Can you tell us the expectation of the number of distinct integers in that N integers?
Input
There is an integer T (1 <= T <= 200) in the first line, means there are T test cases in total.
For each test case, there are two integers K (1 <= K <= 1000), N (1 <= N <= 1000), which have the same meaning as above.
Output
For each test case, you should print the result in one line. You should keep the first 5 digits after the decimal point.
Sample Input
51 12 23 23 45 3
Sample Output
1.000001.500001.666672.407412.44000
HINT
Source
Multi-University Contest Fina
没看出这是DP
看出来也不一定想得到
1 #include <cstdio> 2 double dp[1005]; 3 int main() 4 { 5 int t; 6 scanf("%d", &t); 7 while (t--) 8 { 9 int m,n;10 scanf("%d %d", &m, &n);11 dp[1] = 1.0;12 for (int i = 2; i <= n; ++i)13 dp[i] = dp[i-1] + (m/1.0 - dp[i-1])/1.0/m;14 printf("%.5f\n", dp[n]);15 }16 return 0;17 }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。