bzoj 4001 [TJOI2015]概率论 数学

4010: [HNOI2015]菜肴制作

Time Limit: 20 Sec Memory Limit: 256 MB

题目连接

http://www.lydsy.com/JudgeOnline/problem.php?id=4001

Description

Input

输入一个正整数N，代表有根树的结点数

Output

输出这棵树期望的叶子节点数。要求误差小于1e-9

[b]Sample Input[/b]

1

Sample Output

1.000000000

HINT

1<=N<=10^9

[b]题意 [/b]

[b]题解：[/b]

一看就是蛋疼结论题，打表打法好，然后看就好了= =

然而证明如下：
http://blog.miskcoo.com/2015/04/bzoj-4001#comment-2070
[b]代码：[/b]

//qscqesze
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 200001
#define mod 10007
#define eps 1e-9
int Num;
char CH[20];
//const int inf=0x7fffffff;   //нчоч╢С
const int inf=0x3f3f3f3f;
/*

inline void P(int x)
{
Num=0;if(!x){putchar('0');puts("");return;}
while(x>0)CH[++Num]=x%10,x/=10;
while(Num)putchar(CH[Num--]+48);
puts("");
}
*/
inline ll read()
{
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
inline void P(int x)
{
Num=0;if(!x){putchar('0');puts("");return;}
while(x>0)CH[++Num]=x%10,x/=10;
while(Num)putchar(CH[Num--]+48);
puts("");
}
//**************************************************************************************

int main()
{
//freopen("test.txt","r",stdin);
double a;
cin>>a;
printf("%.9f\n",a*(a+1)/(4*a-2));
}