結果

問題 No.1126 SUM
ユーザー butsurizukibutsurizuki
提出日時 2020-07-24 22:41:33
言語 C
(gcc 12.3.0)
結果
AC  
実行時間 12 ms / 1,000 ms
コード長 3,454 bytes
コンパイル時間 566 ms
コンパイル使用メモリ 32,512 KB
実行使用メモリ 10,112 KB
最終ジャッジ日時 2024-06-25 22:18:10
合計ジャッジ時間 1,571 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
9,984 KB
testcase_01 AC 8 ms
9,856 KB
testcase_02 AC 9 ms
9,984 KB
testcase_03 AC 9 ms
9,972 KB
testcase_04 AC 9 ms
9,984 KB
testcase_05 AC 8 ms
9,984 KB
testcase_06 AC 8 ms
9,984 KB
testcase_07 AC 9 ms
9,984 KB
testcase_08 AC 9 ms
9,876 KB
testcase_09 AC 12 ms
9,984 KB
testcase_10 AC 8 ms
9,984 KB
testcase_11 AC 8 ms
9,984 KB
testcase_12 AC 8 ms
9,984 KB
testcase_13 AC 9 ms
9,984 KB
testcase_14 AC 9 ms
9,984 KB
testcase_15 AC 8 ms
9,984 KB
testcase_16 AC 8 ms
9,984 KB
testcase_17 AC 9 ms
9,936 KB
testcase_18 AC 9 ms
9,984 KB
testcase_19 AC 9 ms
9,984 KB
testcase_20 AC 8 ms
9,856 KB
testcase_21 AC 8 ms
9,984 KB
testcase_22 AC 9 ms
9,984 KB
testcase_23 AC 9 ms
9,984 KB
testcase_24 AC 9 ms
9,984 KB
testcase_25 AC 9 ms
10,112 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c:12:5: warning: conflicting types for built-in function 'round'; expected 'double(double)' [-Wbuiltin-declaration-mismatch]
   12 | int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |     ^~~~~
main.c:5:1: note: 'round' is declared in header '<math.h>'
    4 | #include<stdlib.h>
  +++ |+#include <math.h>
    5 | #define inf 1072114514
main.c:13:5: warning: conflicting types for built-in function 'ceil'; expected 'double(double)' [-Wbuiltin-declaration-mismatch]
   13 | int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
      |     ^~~~
main.c:13:5: note: 'ceil' is declared in header '<math.h>'
main.c:18:5: warning: conflicting types for built-in function 'pow'; expected 'double(double,  double)' [-Wbuiltin-declaration-mismatch]
   18 | int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
      |     ^~~
main.c:18:5: note: 'pow' is declared in header '<math.h>'
main.c:22:11: warning: conflicting types for built-in function 'llround'; expected 'long long int(double)' [-Wbuiltin-declaration-mismatch]
   22 | long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |           ^~~~~~~
main.c:22:11: note: 'llround' is declared in header '<math.h>'

ソースコード

diff # 

//ABC003-D nCr logN
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007

int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}

long long power(long long a,long long b){
  long long x=1,y=a;
  while(b>0){
    if(b&1ll){
      x=(x*y)%mod;
    }
    y=(y*y)%mod;
    b>>=1;
  }
  return x%mod;
}

long long modular_inverse(long long n){
  return power(n,mod-2);
}

long long factorial[524288];
long long invfact[524288];

void cfact(){
  long long i;
  factorial[0]=1;
  factorial[1]=1;
  for(i=2;i<524288;i++){
    factorial[i]=factorial[i-1]*i;
    factorial[i]%=mod;
  }
  invfact[524287]=modular_inverse(factorial[524287]);
  for(i=524286;i>=0;i--){
    invfact[i]=invfact[i+1]*(i+1);
    invfact[i]%=mod;
  }
}

long long calcnCr(long long n,long long k){
  if(k<0 || n<k){return 0;}
  return (factorial[n]*((invfact[k]*invfact[n-k])%mod))%mod;
}

int main(void){
    cfact();
    long long n,m;
    scanf("%lld%lld",&n,&m);
    printf("%lld\n",calcnCr(m+1,n+1));
    return 0;
}
0