Submission #405806

---

Source Code Expand

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

int mod=1e9+7;

int N,K;

int comb[200][200];

void latte(){
    for(int i=1;i<=100;i++){
        comb[i][0]=comb[i][i]=1;
        for(int j=1;j<i;j++){
            comb[i][j]=(comb[i-1][j-1]+comb[i-1][j])%mod;
        }
    }
}

signed main(){
    latte();
    cin>>N>>K;

    if(N>K){
        int ans=0;
        for(int i=1;i<=K;i++)ans=(ans+comb[N][i])%mod;
        cout<<ans<<endl;
        return 0;
    }
    int to=K/N;
    int cur=(to?K%(to*N):0);

    cout<<comb[N][cur]<<endl;
    return 0;
}

Submission Info

Judge Result