Selection of Personnel

最新推荐文章于 2022-10-15 17:04:38 发布

zl_666

最新推荐文章于 2022-10-15 17:04:38 发布

阅读量345

点赞数

分类专栏： cf-公式专场

本文链接：https://blog.csdn.net/zl_666/article/details/50829286

版权

cf-公式专场专栏收录该内容

1 篇文章 0 订阅

订阅专栏

F - Selection of Personnel

Time Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

One company of IT City decided to create a group of innovative developments consisting from 5 to 7 people and hire new employees for it. After placing an advertisment the company received n resumes. Now the HR department has to evaluate each possible group composition and select one of them. Your task is to count the number of variants of group composition to evaluate.

Input

The only line of the input contains one integer n (7 ≤ n ≤ 777) — the number of potential employees that sent resumes.

Output

Output one integer — the number of different variants of group composition.

Sample Input

Input

Output

题目大意：有n条东西向的路，有n条南北向的路，并且东西向的每条路都与南北向的每条路相交，也就形成了n*n个十字路口，现在要在这么多个路口放5条长椅，并且每条路上最多能放一条长椅，问有多少种放法。

解题思路：思路sum=C(n,5)*C(n,5)*120。先挑出5行，再挑出5列，每种情况会有120种放法*/

#include<stdio.h>
#include<string.h>
__int64 C(int n,int m)
{
	__int64 ans=1;
	int i;
	for(i=1;i<=m;i++)//一个for循环解决组合的计算！ 
	{
		ans=ans*(n)/i;
		n--;
	}
	return ans;
} 
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		__int64 t;
		t=C(n,5);
		printf("%I64d\n",120*t*t);
	}
	return 0;
}