C - Little Pony and Expected Maximum
2016-09-22 22:56
387 查看
C - Little Pony and Expected Maximum
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice CodeForces
454C
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
Output
Input
Output
Input
Output
Hint
Consider the third test example. If you've made two tosses:
You can get 1 in the first toss, and 2 in the second. Maximum equals to 2.
You can get 1 in the first toss, and 1 in the second. Maximum equals to 1.
You can get 2 in the first toss, and 1 in the second. Maximum equals to 2.
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
思路:
找规律的问题,只要你有一定的数学推理能力,一定是一道水题
输入写x,y
最后总结规律为:结果=x-(pow(i/x),y)i从1到x
ac代码:
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
using namespace std;
int main()
{
double x,y;
while(cin>>x>>y)
{
double sum=0;
for(int i=1;i<x;i++)
{
sum+=pow(i/x,y);
}
printf("%.4llf\n",x-sum);
}
return 0;
}
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice CodeForces
454C
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:
You can get 1 in the first toss, and 2 in the second. Maximum equals to 2.
You can get 1 in the first toss, and 1 in the second. Maximum equals to 1.
You can get 2 in the first toss, and 1 in the second. Maximum equals to 2.
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
思路:
找规律的问题,只要你有一定的数学推理能力,一定是一道水题
输入写x,y
最后总结规律为:结果=x-(pow(i/x),y)i从1到x
ac代码:
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
using namespace std;
int main()
{
double x,y;
while(cin>>x>>y)
{
double sum=0;
for(int i=1;i<x;i++)
{
sum+=pow(i/x,y);
}
printf("%.4llf\n",x-sum);
}
return 0;
}
相关文章推荐
- codeforces C. Little Pony and Expected Maximum
- Codeforces Round #259 (Div. 1)——Little Pony and Expected Maximum
- Codeforces Round #259 (Div. 2) C - Little Pony and Expected Maximum
- Codeforces Round #259 (Div. 2) C. Little Pony and Expected Maximum
- Little Pony and Expected Maximum
- A. Little Pony and Expected Maximum
- Little Pony and Expected Maximum CodeForces - 453A (数学期望)
- 神奇stl- - Little Pony and Expected Maximum
- 【CF 453A】 A. Little Pony and Expected Maximum(期望、快速幂)
- Codeforces 453 A. Little Pony and Expected Maximum
- C. Little Pony and Expected Maximum
- Codeforces Round #259 (Div. 2) C - Little Pony and Expected Maximum (数学期望)
- Codeforces Round #259 (Div. 1) A. Little Pony and Expected Maximum 数学公式结论找规律水题
- A. Little Pony and Expected Maximum
- Codeforces Round #259 (Div. 2) C - Little Pony and Expected Maximum
- codeforces #259 DIV2 C题 Little Pony and Expected Maximum(容斥+快速幂+公式推导)
- [Codeforces453A]Little Pony and Expected Maximum(概率期望+快速幂)
- Codeforces Round #259 (Div. 2) C. Little Pony and Expected Maximum
- CodeForces 453 A.Little Pony and Expected Maximum(快速幂)
- codeforces——Little Pony and Expected Maximum