#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
long long mp[];
double ans[];
void init(){
mp[] = mp[] = ;
for(int i = ; i <= ; i++){
mp[i] = mp[i-]*i;
}
ans[] = 1.0;
ans[] = 2.0;
ans[] = 2.5;
for(int i = ; i <= ; i++){
ans[i] = ans[i-]+1.0/mp[i];
}
}
int main()
{
init();
printf("n e\n- -----------\n");
printf("0 1\n1 2\n2 2.5\n");
for(int i = ; i <= ; i++){
printf("%d %.9lf\n",i,ans[i]);
}
return ;
}
相关文章
- Codeforces Round #272 (Div. 2) A. Dreamoon and Stairs 水题
- LightOJ 1214 Large Division 水题
- 一道超级坑爹的水题(ACdream oj 无耻的出题人)
- Codeforces Beta Round #2 A. Winner 水题
- Codeforces Round #367 (Div. 2)---水题 | dp | 01字典树
- Codeforces Testing Round #12 A. Divisibility 水题
- Codeforces Beta Round #37 A. Towers 水题
- HDU 1029 Ignatius and the Princess IV --- 水题
- kuangbin专题十二 HDU1029 Ignatius and the Princess IV (水题)
- 2017 Multi-University Training Contest - Team 1 1001&&HDU 6033 Add More Zero【签到题,数学,水】