作业 - 结论题

题目大意:
已知: f 0 = 1 1 e , f n = 1 n f n 1 f_0=1-\frac1e,f_n=1-nf_{n-1}
f n , n 1 0 4 f_n,n\le10^4 精度要求 1 0 4 10^{-4}
题解:
注意到 f n f_n 可以写成 a n b n e 1 a_n-b_ne^{-1} 的形式, a 0 = 1 , b 0 = 1 a_0=1,b_0=1
经过一些推导化简可以显然得知:
b n = ( n ) b n 1 = ( 1 ) n n ! a n = i = 0 n n ! ( n i ) ! ( 1 ) i = n ! ( 1 ) n i = 0 n ( 1 ) i i ! b_n=(-n)b_{n-1}=(-1)^nn!\\ a_n=\sum_{i=0}^n\frac{n!}{(n-i)!}(-1)^i=n!(-1)^n\sum_{i=0}^n\frac{(-1)^i}{i!}
显然 l i m i t n + inf i = 0 n ( 1 ) i i ! = e 1 \mathrm{limit}_{n\rightarrow+\inf}\sum_{i=0}^n\frac{(-1)^i}{i!}=e^{-1}
l i m i t n + inf f n = n ! ( 1 ) n e 1 n ! ( 1 ) n e 1 = 0 \mathrm{limit}_{n\rightarrow+\inf}f_n=n!(-1)^ne^{-1}-n!(-1)^ne^{-1}=0
(顺带由刚刚的推导可以看出误差大约在 O ( 1 n ) O\left(\frac1n\right) 左右的样子)
因此设 f N = 0 f_{N}=0 ,并取 N 1 0 5 N\ge10^5 ,然后反着推回来即可。

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define Rep(i,v) rep(i,0,(int)v.size()-1)
#define lint long long
#define ull unsigned lint
#define db long double
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define gc getchar()
#define debug(x) cerr<<#x<<"="<<x
#define sp <<" "
#define ln <<endl
using namespace std;
typedef pair<int,int> pii;
typedef set<int>::iterator sit;
inline int inn()
{
    int x,ch;while((ch=gc)<'0'||ch>'9');
    x=ch^'0';while((ch=gc)>='0'&&ch<='9')
        x=(x<<1)+(x<<3)+(ch^'0');return x;
}
const int N=500010;
db f[N];
int main()
{
    int n=inn();f[N-1]=0;
    for(int i=N-2;i>=0;i--)
        f[i]=(1-f[i+1])/(i+1);
    printf("%.4f\n",double(f[n]));
    return 0;
}

猜你喜欢

转载自blog.csdn.net/Mys_C_K/article/details/84930700