hdu4465
来源:互联网 发布:淘宝注册账号打电话 编辑:程序博客网 时间:2024/05/22 05:01
Candy
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2705 Accepted Submission(s): 1199
Special Judge
Problem DescriptionLazyChild is a lazy child who likes candy very much. Despite being very young, he has two large candy boxes, each contains n candies initially. Everyday he chooses one box and open it. He chooses the first box with probability p and the second box with probability (1 - p). For the chosen box, if there are still candies in it, he eats one of them; otherwise, he will be sad and then open the other box.
He has been eating one candy a day for several days. But one day, when opening a box, he finds no candy left. Before opening the other box, he wants to know the expected number of candies left in the other box. Can you help him?
InputThere are several test cases.
For each test case, there is a single line containing an integer n (1 ≤ n ≤ 2 × 105) and a real number p (0 ≤ p ≤ 1, with 6 digits after the decimal).
Input is terminated by EOF.
OutputFor each test case, output one line “Case X: Y” where X is the test case number (starting from 1) and Y is a real number indicating the desired answer.
Any answer with an absolute error less than or equal to 10-4 would be accepted.
Sample Input10 0.400000100 0.500000124 0.432650325 0.325100532 0.4875202276 0.720000
Sample OutputCase 1: 3.528175Case 2: 10.326044Case 3: 28.861945Case 4: 167.965476Case 5: 32.601816Case 6: 1390.500000
Candy
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2705 Accepted Submission(s): 1199
Special Judge
Problem DescriptionLazyChild is a lazy child who likes candy very much. Despite being very young, he has two large candy boxes, each contains n candies initially. Everyday he chooses one box and open it. He chooses the first box with probability p and the second box with probability (1 - p). For the chosen box, if there are still candies in it, he eats one of them; otherwise, he will be sad and then open the other box.
He has been eating one candy a day for several days. But one day, when opening a box, he finds no candy left. Before opening the other box, he wants to know the expected number of candies left in the other box. Can you help him?
InputThere are several test cases.
For each test case, there is a single line containing an integer n (1 ≤ n ≤ 2 × 105) and a real number p (0 ≤ p ≤ 1, with 6 digits after the decimal).
Input is terminated by EOF.
OutputFor each test case, output one line “Case X: Y” where X is the test case number (starting from 1) and Y is a real number indicating the desired answer.
Any answer with an absolute error less than or equal to 10-4 would be accepted.
Sample Input10 0.400000100 0.500000124 0.432650325 0.325100532 0.4875202276 0.720000
Sample OutputCase 1: 3.528175Case 2: 10.326044Case 3: 28.861945Case 4: 167.965476Case 5: 32.601816Case 6: 1390.500000
这题是数学期望的题,主要是求排列组合的时候会爆掉,所以要用快速排列组;
预定义一个f数组for(in i=1;i<N;i++)f[i]=f[i-1]+log(1.0*i);f数组存放的是log1乘到i;所以C(n,m)=f[n]-f[m]-f[n-m];贴下ac代码#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int N=2e5+5;
double v1[N],v2[N];
typedef long long ll;
double f[N];
double logc(ll m,ll n)
{
return f[m]-f[n]-f[m-n];
}
int main()
{
int n,cas=0;
double p;
f[0]=0;
//freopen("input.txt","r",stdin);
for(int i=1;i<N;i++)
f[i]=f[i-1]+log(i*1.0);
while(~scanf("%d%lf",&n,&p))
{
double ans=0;ll i=0;
for(ll i=0;i<=n;i++)
{
v1[i]=logc(2*n-i,n)+1.0*(n+1)*log(p)+1.0*(n-i)*log(1-p);
v2[i]=logc(2*n-i,n)+(n+1)*log(1-p)+(n-i)*log(p);
ans+=1.0*i*(1.0*exp(v1[i])+1.0*exp(v2[i]));
}
printf("Case %d: %.6lf\n",++cas,ans);
}
return 0;
}
Candy
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2705 Accepted Submission(s): 1199
Special Judge
Problem Description
LazyChild is a lazy child who likes candy very much. Despite being very young, he has two large candy boxes, each contains n candies initially. Everyday he chooses one box and open it. He chooses the first box with probability p and the second box with probability (1 - p). For the chosen box, if there are still candies in it, he eats one of them; otherwise, he will be sad and then open the other box.
He has been eating one candy a day for several days. But one day, when opening a box, he finds no candy left. Before opening the other box, he wants to know the expected number of candies left in the other box. Can you help him?
He has been eating one candy a day for several days. But one day, when opening a box, he finds no candy left. Before opening the other box, he wants to know the expected number of candies left in the other box. Can you help him?
Input
There are several test cases.
For each test case, there is a single line containing an integer n (1 ≤ n ≤ 2 × 105) and a real number p (0 ≤ p ≤ 1, with 6 digits after the decimal).
Input is terminated by EOF.
For each test case, there is a single line containing an integer n (1 ≤ n ≤ 2 × 105) and a real number p (0 ≤ p ≤ 1, with 6 digits after the decimal).
Input is terminated by EOF.
Output
For each test case, output one line “Case X: Y” where X is the test case number (starting from 1) and Y is a real number indicating the desired answer.
Any answer with an absolute error less than or equal to 10-4 would be accepted.
Any answer with an absolute error less than or equal to 10-4 would be accepted.
Sample Input
10 0.400000100 0.500000124 0.432650325 0.325100532 0.4875202276 0.720000
Sample Output
Case 1: 3.528175Case 2: 10.326044Case 3: 28.861945Case 4: 167.965476Case 5: 32.601816Case 6: 1390.500000
Candy
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2705 Accepted Submission(s): 1199
Special Judge
Problem Description
LazyChild is a lazy child who likes candy very much. Despite being very young, he has two large candy boxes, each contains n candies initially. Everyday he chooses one box and open it. He chooses the first box with probability p and the second box with probability (1 - p). For the chosen box, if there are still candies in it, he eats one of them; otherwise, he will be sad and then open the other box.
He has been eating one candy a day for several days. But one day, when opening a box, he finds no candy left. Before opening the other box, he wants to know the expected number of candies left in the other box. Can you help him?
He has been eating one candy a day for several days. But one day, when opening a box, he finds no candy left. Before opening the other box, he wants to know the expected number of candies left in the other box. Can you help him?
Input
There are several test cases.
For each test case, there is a single line containing an integer n (1 ≤ n ≤ 2 × 105) and a real number p (0 ≤ p ≤ 1, with 6 digits after the decimal).
Input is terminated by EOF.
For each test case, there is a single line containing an integer n (1 ≤ n ≤ 2 × 105) and a real number p (0 ≤ p ≤ 1, with 6 digits after the decimal).
Input is terminated by EOF.
Output
For each test case, output one line “Case X: Y” where X is the test case number (starting from 1) and Y is a real number indicating the desired answer.
Any answer with an absolute error less than or equal to 10-4 would be accepted.
Any answer with an absolute error less than or equal to 10-4 would be accepted.
Sample Input
10 0.400000100 0.500000124 0.432650325 0.325100532 0.4875202276 0.720000
Sample Output
Case 1: 3.528175Case 2: 10.326044Case 3: 28.861945Case 4: 167.965476Case 5: 32.601816Case 6: 1390.500000
#include<cmath>
#include<cstring>
using namespace std;
const int N=2e5+5;
double v1[N],v2[N];
typedef long long ll;
double f[N];
double logc(ll m,ll n)
{
return f[m]-f[n]-f[m-n];
}
int main()
{
int n,cas=0;
double p;
f[0]=0;
//freopen("input.txt","r",stdin);
for(int i=1;i<N;i++)
f[i]=f[i-1]+log(i*1.0);
while(~scanf("%d%lf",&n,&p))
{
double ans=0;ll i=0;
for(ll i=0;i<=n;i++)
{
v1[i]=logc(2*n-i,n)+1.0*(n+1)*log(p)+1.0*(n-i)*log(1-p);
v2[i]=logc(2*n-i,n)+(n+1)*log(1-p)+(n-i)*log(p);
ans+=1.0*i*(1.0*exp(v1[i])+1.0*exp(v2[i]));
}
printf("Case %d: %.6lf\n",++cas,ans);
}
return 0;
}
0 0
- hdu4465
- hdu4465 Candy
- HDU4465 Candy
- hdu4465 期望公式
- Candy----HDU4465----数学题
- Candy----HDU4465----数学题
- HDU4465-数学期望
- HDU4465(数学期望+大数处理)
- hdu4465 Candy(快速排列组合+概率)
- hdu4465 Candy(快速排列组合+概率)
- Android开发学习之路-- 关于服务Service
- HTML 学习(一)之 简介
- 自定义view教你如何打造圆形的seekbar
- 好文章
- 在ubuntu linux下搭建Java Web开发环境
- hdu4465
- 公共子序列的个数
- bzoj 4569: [Scoi2016]萌萌哒 (st表+并查集)
- 使用友盟SDK提交Appstore审核被拒的常见解决方法
- 32位保护模式学习小结(2)---任务的隔离和特权级保护
- HDU 4496 D-City (并查集)
- poj 2299 Ultra-QuickSort
- 【PAT】Dijkstra+最短路径种数(★)+输出路径+卡内存
- java 快速排序 插入排序 选择排序