hdoj 2407 Knots

最新推荐文章于 2022-06-26 21:55:37 发布

l踏雪无痕ll

最新推荐文章于 2022-06-26 21:55:37 发布

阅读量317

点赞数

分类专栏：规律

本文链接：https://blog.csdn.net/longge33445/article/details/51008743

版权

规律专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Knots

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 253 Accepted Submission(s): 176

Problem 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

Sample Output

公式：((n-2)*(n-4)*(n-6)*...)/((n-1)*(n-3)*(n-5)*...)

代码：

#include<stdio.h>  
#include<stdlib.h>  
#include<string.h>  
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f
int main()
{
	int n,i;
	double a[105];
	a[2]=1.0;
	for(i=4;i<=105;i+=2)
	{
		a[i]=a[i-2]*(i-2)/(i-1);
	}
	while(scanf("%d",&n)!=EOF)
	printf("%.5lf\n",a[n]);
	return 0;
}