This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#define mod 1000000007
#define inv(a) exp(a,mod-2)
typedef long long lld;
lld exp(lld a, lld b){
if(b==0)return 1;
lld k=exp(a, b/2);
k=(k*k)%mod;
if(b%2)k=(k*a)%mod;
return k;
}
lld n, k, sum;
int main(){
lld i, fac=1;
scanf("%lld%lld", &n, &k);
for(i=1; i<=n+1; i++)fac=(fac*i)%mod;
for(i=k+1; i<=n; i++){
lld im = fac*(n-i+1)%mod * inv(i+1);
sum += im, sum%=mod;
}
printf("%lld", sum);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |