Submission #1939505
Source Code Expand
#include<stdio.h> #include<math.h> #include<algorithm> #include<queue> #include<deque> #include<string> #include<string.h> #include<vector> #include<set> #include<map> #include<bitset> #include<stdlib.h> #include<cassert> using namespace std; const long long mod=1000000007; const long long inf=mod*mod; const long long d2=500000004; const double EPS=1e-6; const double PI=acos(-1.0); int ABS(int a){return max(a,-a);} long long ABS(long long a){return max(a,-a);} long long fact[12100]; long long inv[12100]; long long finv[12100]; long long C(int a,int b){ if(a<b)return 0; return fact[a]*finv[b]%mod*finv[a-b]%mod; } int main(){ fact[0]=finv[0]=1; inv[1]=1; for(int i=2;i<12100;i++){ inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod; } for(int i=1;i<12100;i++){ fact[i]=fact[i-1]*i%mod; finv[i]=finv[i-1]*inv[i]%mod; } int n,a,b,c; scanf("%d%d%d%d",&n,&a,&b,&c); if(b%2){ printf("0\n");return 0; } long long ks=C(a+b/2,a); long long ret=0; if(b==0){ for(int i=0;i<=c/3;i++){ ret=(ret+C(a,c-i*3)*C(a+c/3,a))%mod; } }else{ for(int i=0;i<=c/3;i++){ long long ks2=C(a+b/2+i,i); for(int j=0;j<=min(a,c-i*3);j++){ long long tmp=C(a,j); int rem=c-i*3-j; ret=(ret+tmp*C(rem+b/2-1,rem)%mod*ks2)%mod; } } } ret=ret*ks%mod; printf("%lld\n",ret); }
Submission Info
Submission Time | |
---|---|
Task | J - 123 Pairs |
User | tozangezan |
Language | C++14 (GCC 5.4.1) |
Score | 1500 |
Code Size | 1351 Byte |
Status | AC |
Exec Time | 15 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:40:31: 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 |
|
|
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 | 8 ms | 384 KB |
001.txt | AC | 1 ms | 384 KB |
002.txt | AC | 1 ms | 384 KB |
003.txt | AC | 1 ms | 384 KB |
004.txt | AC | 1 ms | 384 KB |
005.txt | AC | 1 ms | 384 KB |
006.txt | AC | 1 ms | 384 KB |
007.txt | AC | 1 ms | 384 KB |
008.txt | AC | 1 ms | 384 KB |
009.txt | AC | 1 ms | 384 KB |
010.txt | AC | 1 ms | 384 KB |
011.txt | AC | 1 ms | 384 KB |
012.txt | AC | 1 ms | 384 KB |
013.txt | AC | 1 ms | 384 KB |
014.txt | AC | 1 ms | 384 KB |
015.txt | AC | 12 ms | 384 KB |
016.txt | AC | 2 ms | 384 KB |
017.txt | AC | 4 ms | 384 KB |
018.txt | AC | 2 ms | 384 KB |
019.txt | AC | 5 ms | 384 KB |
020.txt | AC | 2 ms | 384 KB |
021.txt | AC | 11 ms | 384 KB |
022.txt | AC | 2 ms | 384 KB |
023.txt | AC | 3 ms | 384 KB |
024.txt | AC | 11 ms | 384 KB |
025.txt | AC | 3 ms | 384 KB |
026.txt | AC | 7 ms | 384 KB |
027.txt | AC | 10 ms | 384 KB |
028.txt | AC | 4 ms | 384 KB |
029.txt | AC | 5 ms | 384 KB |
030.txt | AC | 10 ms | 384 KB |
031.txt | AC | 11 ms | 384 KB |
032.txt | AC | 2 ms | 384 KB |
033.txt | AC | 1 ms | 384 KB |
034.txt | AC | 5 ms | 384 KB |
035.txt | AC | 6 ms | 384 KB |
036.txt | AC | 2 ms | 384 KB |
037.txt | AC | 1 ms | 384 KB |
038.txt | AC | 15 ms | 384 KB |
039.txt | AC | 1 ms | 384 KB |
040.txt | AC | 1 ms | 384 KB |
041.txt | AC | 3 ms | 384 KB |
042.txt | AC | 1 ms | 384 KB |
043.txt | AC | 1 ms | 384 KB |
044.txt | AC | 1 ms | 384 KB |
045.txt | AC | 1 ms | 384 KB |
046.txt | AC | 1 ms | 384 KB |
047.txt | AC | 1 ms | 384 KB |
048.txt | AC | 1 ms | 384 KB |
049.txt | AC | 1 ms | 384 KB |
example0.txt | AC | 1 ms | 384 KB |
example1.txt | AC | 1 ms | 384 KB |