zoukankan      html  css  js  c++  java
  • CodeForces 454C——数学——Little Pony and Expected Maximum

    Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dice that were used in the game.

    The dice has m faces: the first face of the dice contains a dot, the second one contains two dots, and so on, the m-th face contains m dots. Twilight Sparkle is sure that when the dice is tossed, each face appears with probability . Also she knows that each toss is independent from others. Help her to calculate the expected maximum number of dots she could get after tossing the dice n times.

    Input

    A single line contains two integers m and n (1 ≤ m, n ≤ 105).

    Output

    Output a single real number corresponding to the expected maximum. The answer will be considered correct if its relative or absolute error doesn't exceed 10  - 4.

    Sample Input

    Input
    6 1
    Output
    3.500000000000
    Input
    6 3
    Output
    4.958333333333
    Input
    2 2
    Output
    1.750000000000

    Hint

    Consider the third test example. If you've made two tosses:

    1. You can get 1 in the first toss, and 2 in the second. Maximum equals to 2.
    2. You can get 1 in the first toss, and 1 in the second. Maximum equals to 1.
    3. You can get 2 in the first toss, and 1 in the second. Maximum equals to 2.
    4. You can get 2 in the first toss, and 2 in the second. Maximum equals to 2.

    The probability of each outcome is 0.25, that is expectation equals to:

    You can read about expectation using the following link: http://en.wikipedia.org/wiki/Expected_value

    /*
       对于一个数i他出现的次数为i^m - (i-1)^m
       (1^m - 0^m)*1 + ... + (i^m - (i-1)^m) * i + .... + (n^m - (n-1)^m)*m
       化简得 n^(m+1) - (1^m + 2^m + 3^m + ... + (n-1)^m)
       除以总数 n^m 得
       n - (1/n)^m - (2/n)^m - (3/n)^m - ... - (n-1/n)^m
    */
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <algorithm>
    using namespace std;
    int main()
    {
    int n, m;
    while(~scanf("%d%d", &n, &m)){
        double x = (double)n;
        for(int i = 1; i < n; i++){
           x -= pow(1.0*i/n, m);
        }
        printf("%.10f
    ", x);
    }
    return 0;
    }
    

      

  • 相关阅读:
    截取某一个元素的图
    11、python的异常机制
    10、python面向对象三大特性:封装、继承、多态
    9、python之面向对象
    软件测试有前途吗?
    对应届生做测试的同学们的一些建议
    没有代码基础如何学习自动化测试?
    接口自动化测试有哪些工具或者框架?
    软件测试流程
    接口自动化测试中logging实际用法
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4675734.html
Copyright © 2011-2022 走看看