Submission #2016500
Source Code Expand
#include<bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int exp(int x, int n) { int ret = 1; while(n) { if(n & 1) ret = 1LL * ret * x % mod; x = 1LL * x * x % mod; n >>= 1; } return ret; } int inv(int x) { return exp(x, mod - 2); } int fact[20010], invf[20010]; int comb(int n, int k) { return 1LL * fact[n] * invf[k] % mod * invf[n - k] % mod; } int H(int n, int k) { if(n == 0 && k == 0) return 1; return comb(n + k - 1, k); } int N, A, B, C; int main() { fact[0] = 1; for(int i = 1; i < 20010; i++) { fact[i] = 1LL * fact[i - 1] * i % mod; } for(int i = 0; i < 20010; i++) { invf[i] = inv(fact[i]); } cin >> N >> A >> B >> C; if(B % 2) { printf("0"); return 0; } int ans = 0; for(int i = 0; i <= N; i++) { for(int j = 0; j <= N; j++) { if(i > A) continue; if(i + 3 * j > C) continue; ans += 1LL * comb(i + j, i) * comb(i + j + B / 2, B / 2) % mod * comb(i + j + B / 2 + A - i, A - i) % mod * H(B / 2, C - i - 3 * j) % mod; ans %= mod; } } cout << ans; }
Submission Info
Submission Time | |
---|---|
Task | J - 123 Pairs |
User | choikiwon |
Language | C++14 (GCC 5.4.1) |
Score | 1500 |
Code Size | 1237 Byte |
Status | AC |
Exec Time | 46 ms |
Memory | 384 KB |
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 | 35 ms | 384 KB |
001.txt | AC | 21 ms | 384 KB |
002.txt | AC | 21 ms | 384 KB |
003.txt | AC | 29 ms | 384 KB |
004.txt | AC | 21 ms | 384 KB |
005.txt | AC | 21 ms | 384 KB |
006.txt | AC | 29 ms | 384 KB |
007.txt | AC | 21 ms | 384 KB |
008.txt | AC | 21 ms | 384 KB |
009.txt | AC | 29 ms | 384 KB |
010.txt | AC | 29 ms | 384 KB |
011.txt | AC | 20 ms | 384 KB |
012.txt | AC | 21 ms | 384 KB |
013.txt | AC | 5 ms | 384 KB |
014.txt | AC | 5 ms | 384 KB |
015.txt | AC | 39 ms | 384 KB |
016.txt | AC | 7 ms | 384 KB |
017.txt | AC | 16 ms | 384 KB |
018.txt | AC | 7 ms | 384 KB |
019.txt | AC | 18 ms | 384 KB |
020.txt | AC | 17 ms | 384 KB |
021.txt | AC | 38 ms | 384 KB |
022.txt | AC | 21 ms | 384 KB |
023.txt | AC | 29 ms | 384 KB |
024.txt | AC | 39 ms | 384 KB |
025.txt | AC | 29 ms | 384 KB |
026.txt | AC | 33 ms | 384 KB |
027.txt | AC | 39 ms | 384 KB |
028.txt | AC | 31 ms | 384 KB |
029.txt | AC | 31 ms | 384 KB |
030.txt | AC | 37 ms | 384 KB |
031.txt | AC | 39 ms | 384 KB |
032.txt | AC | 25 ms | 384 KB |
033.txt | AC | 4 ms | 384 KB |
034.txt | AC | 18 ms | 384 KB |
035.txt | AC | 29 ms | 384 KB |
036.txt | AC | 14 ms | 384 KB |
037.txt | AC | 4 ms | 384 KB |
038.txt | AC | 46 ms | 384 KB |
039.txt | AC | 4 ms | 384 KB |
040.txt | AC | 4 ms | 384 KB |
041.txt | AC | 25 ms | 384 KB |
042.txt | AC | 23 ms | 384 KB |
043.txt | AC | 4 ms | 384 KB |
044.txt | AC | 4 ms | 384 KB |
045.txt | AC | 4 ms | 384 KB |
046.txt | AC | 4 ms | 384 KB |
047.txt | AC | 4 ms | 384 KB |
048.txt | AC | 4 ms | 384 KB |
049.txt | AC | 4 ms | 384 KB |
example0.txt | AC | 4 ms | 384 KB |
example1.txt | AC | 5 ms | 384 KB |