题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4465
解题思路:
首先可以很容易的利用高中排列组合的知识写出方程。
然后问题就来了....发现怎么实现精度都损失的不行不行的.....还是太弱,知道的东西太少,后来才知道可以用log,再后来才知道了快速排列组合这东西~ 真是收获好大/*求不鄙视*/
快速排列组合:
然后 组合数C(n,m)=exp(logC(n,m))f[0]=0; for(int i=1;i<=400002;i++) f[i]=f[i-1]+log(i*1.0); double logC(int m,int n){ return f[m]-f[n]-f[m-n]; }</span>
然后之前的公式就变成了
然后代码就有啦哈哈哈~
#include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<iostream> #include<algorithm> #include<string> #include<set> #include<map> #include<queue> #include<stack> #include<ctime> #include<vector> #include<utility> #define INF (1<<30) #define EPS 1e-6 #define PI acos(-1) #define lowbit(x) ((x) & (-(x))) #define IDX(l,r) ((l)+(r) | (l)!=(r)) #define ABS(x) ((x)>0?(x):-(x)) #define SET(a,b) memset(a,b,sizeof(a)) #define NN 40 #define MM 10010 inline long long ReadInt() { char ch = getchar(); long long data = 0; while (ch < '0' || ch > '9') ch = getchar(); do { data = data * 10 + ch - '0'; ch = getchar(); } while (ch >= '0' && ch <= '9'); return data; } using namespace std; double f[400002]; double logC (int n, int m) { return f[n] - f[m] - f[n - m]; } int main() { for (int i = 1; i <= 400001; i++) f[i] = f[i - 1] + log (i * 1.0); int tt = 1, n; double p, q; while (scanf ("%d%lf", &n, &p)!=EOF) { q = 1 - p; double ans = 0; for (int i = 0; i < n; i++) ans += (n - i) * (exp (logC (n + i, i) + (n + 1) * log (p) + i * log (q)) + exp (logC (n + i, i) + (n + 1) * log (q) + i * log (p))); printf ("Case %d: %.6f\n", tt++, ans); } return 0; } </span>
另外,这位大神的办法更精妙http://www.csdn123.com/html/itweb/20130901/93816_93834_93826.htm