CodeForces 888D Almost Identity Permutations (组合数学)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=3e5+100;
const int maxm=1e5+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int solve(int x){
    if(x==0) return 1;
    else if(x==1) return 0;
    else if(x==2) return 1;
    else if(x==3) return 2;
    else return 9;
}
int n,k;
ll C(int p,int q){
    q=min(q,p-q);
    ll ret=1;
    for(int i=p;i>=p-q+1;i--){
        ret=ret*i/(p+1-i);
    }
    return ret;
}
int main(){
    cin>>n>>k;
    k=min(k,n);
    ll ans=0;
    rep(i,0,k+1) ans+=1LL*C(n,i)*solve(i);
        cout<<ans;
    return 0;
}