216622026-01-13 17:52:01algoproJáték (50 pont)cpp17Wrong answer 0/5017ms8180 KiB
// UUID: ffd7be8c-c6a2-4d28-bdef-3854fe119e83
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007

int fpow(int a, int b){
    int k = 1;
    for(int i = 0; (1<<i) <= b; i++){
        if((1<<i)&b){
            k= (k*a)%MOD;
        }
        a*= a;
        a%= MOD;
    }
    return k;
}
int t[1000000] = {1};

int n_c_k(int n, int k){
    return ((t[n]* fpow(t[k], MOD -2))%MOD * fpow(t[n-k], MOD -2))%MOD;
}

signed main() {
    int c,b;
    cin >> b >> c;
    for(int i = 1; i < 1000000; i++){
        t[i] = (t[i-1]* i)%MOD;    
    }
    c--;
    cout << (MOD+n_c_k(b+c, c)-n_c_k(b+c, c+1))%MOD;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Accepted0/014ms7988 KiB
2Wrong answer0/014ms7988 KiB
3Wrong answer0/216ms8180 KiB
4Wrong answer0/316ms7984 KiB
5Wrong answer0/314ms7988 KiB
6Wrong answer0/317ms7988 KiB
7Wrong answer0/317ms7988 KiB
8Wrong answer0/314ms7988 KiB
9Wrong answer0/316ms8004 KiB
10Wrong answer0/314ms7988 KiB
11Wrong answer0/316ms7988 KiB
12Wrong answer0/314ms8180 KiB
13Wrong answer0/316ms7988 KiB
14Wrong answer0/314ms8172 KiB
15Wrong answer0/317ms7988 KiB
16Wrong answer0/314ms8172 KiB
17Wrong answer0/314ms7988 KiB
18Wrong answer0/316ms7988 KiB
19Wrong answer0/314ms8144 KiB