Submission #1001152


Source Code Expand

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

long long mod=1000000007ll;
long long v[10010],P[10010],rP[10010];

void pre(int N)
{
  v[1]=1;
  for(int i=2;i<N;i++){
    v[i]=(mod-mod/i)*v[mod%i]%mod;
  }
  P[0]=rP[0]=1ll;
  for(int i=1;i<N;i++){
    P[i]=P[i-1]*i%mod;
    rP[i]=rP[i-1]*v[i]%mod;
  }
}

long long C(int a,int b)
{
  return P[a]*rP[b]%mod*rP[a-b]%mod;
}

int main()
{
  pre(10010);
  int n,a,b,c;
  scanf("%d%d%d%d",&n,&a,&b,&c);
  if(b%2!=0){
    printf("0\n");
    return 0;
  }
  b/=2;
  long long ans=0ll;
  for(int x=0;x<=a;x++){
    for(int y=0;(a-x)+3*y<=c;y++){
      int m=a+y,r=c-(a-x)-3*y;
      long long P=C(m,a)%mod*C(a,x)%mod,Q;
      if(b==0){
	Q=(r==0?1:0);
      }
      else{
	Q=C(b+m,m)*C(r+b-1,b-1)%mod;
      }
      ans+=P*Q%mod;
      ans%=mod;
    }
  }
  printf("%lld\n",ans);
  return 0;
}

Submission Info

Submission Time
Task J - 123 Pairs
User Huziwara
Language C++14 (GCC 5.4.1)
Score 1500
Code Size 887 Byte
Status AC
Exec Time 136 ms
Memory 512 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d",&n,&a,&b,&c);
                                ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1500 / 1500
Status
AC × 2
AC × 52
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 66 ms 512 KB
001.txt AC 4 ms 512 KB
002.txt AC 3 ms 512 KB
003.txt AC 3 ms 512 KB
004.txt AC 4 ms 512 KB
005.txt AC 3 ms 512 KB
006.txt AC 3 ms 512 KB
007.txt AC 4 ms 512 KB
008.txt AC 3 ms 512 KB
009.txt AC 3 ms 512 KB
010.txt AC 3 ms 512 KB
011.txt AC 3 ms 512 KB
012.txt AC 3 ms 512 KB
013.txt AC 3 ms 512 KB
014.txt AC 4 ms 512 KB
015.txt AC 107 ms 512 KB
016.txt AC 10 ms 512 KB
017.txt AC 32 ms 512 KB
018.txt AC 9 ms 512 KB
019.txt AC 37 ms 512 KB
020.txt AC 14 ms 512 KB
021.txt AC 93 ms 512 KB
022.txt AC 12 ms 512 KB
023.txt AC 22 ms 512 KB
024.txt AC 95 ms 512 KB
025.txt AC 18 ms 512 KB
026.txt AC 56 ms 512 KB
027.txt AC 88 ms 512 KB
028.txt AC 34 ms 512 KB
029.txt AC 44 ms 512 KB
030.txt AC 87 ms 512 KB
031.txt AC 95 ms 512 KB
032.txt AC 10 ms 512 KB
033.txt AC 3 ms 512 KB
034.txt AC 37 ms 512 KB
035.txt AC 49 ms 512 KB
036.txt AC 11 ms 512 KB
037.txt AC 3 ms 512 KB
038.txt AC 136 ms 512 KB
039.txt AC 3 ms 512 KB
040.txt AC 3 ms 512 KB
041.txt AC 25 ms 512 KB
042.txt AC 4 ms 512 KB
043.txt AC 3 ms 512 KB
044.txt AC 3 ms 512 KB
045.txt AC 3 ms 512 KB
046.txt AC 3 ms 512 KB
047.txt AC 3 ms 512 KB
048.txt AC 3 ms 512 KB
049.txt AC 3 ms 512 KB
example0.txt AC 3 ms 512 KB
example1.txt AC 4 ms 512 KB