結果

問題 No.1044 正直者大学
ユーザー butsurizukibutsurizuki
提出日時 2020-05-27 03:38:20
言語 C
(gcc 12.3.0)
結果
AC  
実行時間 13 ms / 2,000 ms
コード長 5,219 bytes
コンパイル時間 323 ms
コンパイル使用メモリ 34,560 KB
実行使用メモリ 9,984 KB
最終ジャッジ日時 2024-10-13 03:11:12
合計ジャッジ時間 1,530 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

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

ソースコード

diff # 

//set many funcs template
//Ver.20190820
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#include<time.h>
#include<assert.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
#define size 524288

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 nHr(int a,int b){return nCr(a+b-1,b);}
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;}
int dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}
int dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}
int sankaku(int x){return ((1+x)*x)/2;}
void swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}
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 llnHr(long long a,long long b){return llnCr(a+b-1,b);}
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;}
long long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}
long long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}
long long llsankaku(long long x){return ((1+x)*x)/2;}
void llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}
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);}
void dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}
void chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}
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;}
int strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}
int strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}
int chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}
int chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)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[size];
long long invfact[size];

void cfact(){
  long long i;
  factorial[0]=1;
  factorial[1]=1;
  for(i=2;i<size;i++){
    factorial[i]=factorial[i-1]*i;
    factorial[i]%=mod;
  }
  invfact[size-1]=modular_inverse(factorial[size-1]);
  for(i=size-2;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;
}

long long calcnHr(long long a,long long b){
  return calcnCr(a+b-1,b);
}

int main(void){
  cfact();
  long long n,m,k,i,res=0,v,c;
  scanf("%lld%lld%lld",&n,&m,&k);
  for(i=2;i<=(n+m);i+=2){
    if(((n+m)-i)<k){break;}
    c=(i/2);
    v=2*calcnHr(c,n-c)*calcnHr(c,m-c);v%=mod;
    v+=calcnHr((c+1),n-(c+1))*calcnHr(c,m-c);v%=mod;
    v+=calcnHr(c,n-c)*calcnHr((c+1),m-(c+1));v%=mod;
    //printf("%lld : %lld\n",i,v);
    res+=v;res%=mod;
  }
  res*=factorial[n];res%=mod;
  res*=factorial[m];res%=mod;
  res*=modular_inverse(n+m);res%=mod;
  printf("%lld\n",res);
  return 0;
}
0