Codeforces--630F--Selection of Personnel(组合数)


F -Selection of Personnel

Crawling in process...Crawling failedTime Limit:500MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Description

One company of IT City decided to create a group of innovative developments consisting from5 to 7 people and hire new employees for it. After placing an advertisment the company receivedn 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
7
Output
29
给n个人,然后判断从中取出5,6,7个人的情况有多少,C(n,5)+C(n,6)+C(n,7)
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
__int64 C(__int64 n,__int64 m)
{
	int num=1;
	__int64 ans=1;
	while(m--)
	{
		ans*=(n-m);
		ans/=num;
		num++;
	}
	return ans;
}
int main()
{
	__int64 n;
	while(cin>>n)
	{
		__int64 ans=0;
		for(__int64 i=5;i<=7;i++)
		ans+=C(n,i);
		cout<<ans<<endl;
	}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值