排列组合 计算 C(N,5)+C(N,6)+C(N,7)
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long LL;
LL C(LL n,LL r){
LL i,j,s=1;
if(n-r<r)r=n-r;
for(i=0,j=1;i<r;i++){
s*=(n-i);
while(j<=r&&s%j==0)
s/=j,j++;
}
return s;
}
int main()
{
LL n;
cin>>n;
cout<<C(n,5)+C(n,6)+C(n,7)<<endl;
}