Selection of Personnel
Time 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 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
7
Output
29
如果直接用公式那样乘,会超出long long 类型范围,故需要边乘边除。
AC-code:
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
long long n,ans,temp;
int i,j;
cin>>n;
ans=0;
for(i=5;i<=7;i++)
{
temp=1;
for(j=1;j<=i;j++)
temp=temp*(n-j+1)/j;
ans+=temp;
}
printf("%lld\n",ans);
}