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

    Little Pony and Expected Maximum
    Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    Description

    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 

     1 #include <stdio.h>
     2 #include <string.h>
     3 #include <math.h>
     4 int main()
     5 {
     6     int m,n;
     7     while(scanf("%d %d",&m,&n)!=EOF)
     8     {
     9         double s=(double) m;
    10         for(int i=1;i<=m;i++)
    11         {
    12             s=s-pow(1.0-(double)i/m,(double) n);
    13         }
    14         printf("%lf
    ",s);
    15     }
    16     return 0;
    17 }
    View Code
  • 相关阅读:
    [笔记] 基于nvidia/cuda的深度学习基础镜像构建流程
    [笔记] Ubuntu 18.04源码编译安装OpenCV 4.0流程
    [笔记] Ubuntu 18.04安装Docker CE及nvidia-docker2流程
    [笔记] Ubuntu 18.04安装cuda 10及cudnn 7流程
    [笔记]Win10下编译Tesseract-OCR 4.0
    [笔记]Python中模块互相调用的例子
    [笔记]mosh使用笔记
    [笔记]Delphi 2007写DLL供VC调用实例
    [笔记]Python的调试器pudb简易教程
    [笔记] Ubuntu下编译ffmpeg+openh264+x264
  • 原文地址:https://www.cnblogs.com/cyd308/p/4771531.html
Copyright © 2011-2022 走看看