Knots (组合数学)
来源:互联网 发布:网络搜索优化方案 编辑:程序博客网 时间:2024/06/09 21:12
Description
An even number N of strands are stuck through a wall. On one side of the wall, a girl ties N/2 knots between disjoint pairs of strands. On the other side of the wall, the girl's groom-to-be also ties N/2 knots between disjoint pairs of strands. You are to find the probability that the knotted strands form one big loop (in which case the couple will be allowed to marry). For example, suppose that N = 4 and you number the strands 1, 2, 3, 4. Also suppose that the girl has created the following pairs of strands by tying knots: {(1, 4), (2,3)}. Then the groom-to-be has two choices for tying the knots on his side: {(1,2), {3,4)} or {(1,3), (2,4)}.
Input
The input file consists of one or more lines. Each line of the input file contains a positive even integer, less than or equal to 100. This integer represents the number of strands in the wall.
Output
For each line of input, the program will produce exactly one line of output: the probability that the knotted strands form one big loop, given the number of strands on the corresponding line of input. Print the probability to 5 decimal places.
Sample Input
420
Sample Output
0.666670.28377
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<set>#include<vector>#include<map>#include<cmath>using namespace std;typedef long long ll;const int inf = 0x3f3f3f3f;const int N = 10000;ll a[111],b[111];double c[111];int main(){int i,j,n;c[2]=1.0;a[2]=1;b[2]=1;for(i=4;i<=100;i=i+2) c[i]=c[i-2]*(i-2)/(i-1);while(scanf("%d",&n)!=EOF) {printf("%.5lf\n",c[n]);}return 0;}
0 0
- Knots (组合数学)
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- Hanoi Tower Troubles Again! (找规律)
- LightOJ 1089 Points in Segments (II) 离散化 标记
- 263. Ugly Number
- BlueTooth: 蓝牙协议栈实现模式分析
- Struts2入门~工作原理及访问Servlet API
- Knots (组合数学)
- HDU 3078Network (LCA)
- Internet Explorer 升级到IE11遇到问题案例分析
- leetcode:字符串
- Emergency relief (枚举+状态压缩)
- marshmallow (博弈论)
- 两个版本的python在同一系统下的安装
- 从网页(web page)到应用(Application)
- poj 2533 Longest Ordered Subsequence