Submission #405793
Source Code Expand
const int MOD = 1000000009; // Calculates x raised to the y-th power modulo MOD // xのy乗を、繰り返し二乗法というのを使って求める long modPow(long x, long y) { long r=1, a=x; while (y > 0) { if ( (y&1)==1 ) { r = (r * a) % MOD; } a = (a * a) % MOD; y /= 2; } return r; } // Modular multiplicative inverse through Fermat's little theorem: // フェルマーの小定理より, a^-1 ≡ a^(p-2) (mod p) というのを使うらしい // ただし、pが素数の時しか成り立たない long modInverse(long x) { return modPow(x, MOD-2); } // Modular division x / y, find modular multiplicative inverse of y // and multiply by x. long modDivision(long p, long q) { return (p * modInverse(q)) % MOD; } // Binomial coifficient C(n,k) in O(k) time. long C(long n, int k) { if (k > n) { return 0; } long p = 1, q = 1; for (int i=1; i<=k; i++) { q = ( q * i) % MOD; p = ( p * (n - i + 1) ) % MOD; } return modDivision( p, q); }
Submission Info
Submission Time | |
---|---|
Task | A - A - B problem |
User | minus9d |
Language | Python (3.4.2) |
Score | 0 |
Code Size | 1115 Byte |
Status | RE |
Exec Time | 94 ms |
Memory | 6768 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_0.txt, sample_1.txt, sample_2.txt |
All | ansneg_0.txt, ansneg_1.txt, ansneg_2.txt, ansneg_3.txt, ansneg_4.txt, ansneg_5.txt, ansneg_6.txt, ansneg_7.txt, ansneg_8.txt, ansneg_9.txt, handmade_0.txt, handmade_1.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, top2fixed_0.txt, top2fixed_1.txt, top2fixed_2.txt, top2fixed_3.txt, top2fixed_4.txt, top2fixed_5.txt, top2fixed_6.txt, top2fixed_7.txt, top2fixed_8.txt, top2fixed_9.txt, topfixed_0.txt, topfixed_1.txt, topfixed_2.txt, topfixed_3.txt, topfixed_4.txt, topfixed_5.txt, topfixed_6.txt, topfixed_7.txt, topfixed_8.txt, topfixed_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
ansneg_0.txt | RE | 85 ms | 6668 KB |
ansneg_1.txt | RE | 87 ms | 6760 KB |
ansneg_2.txt | RE | 87 ms | 6632 KB |
ansneg_3.txt | RE | 86 ms | 6620 KB |
ansneg_4.txt | RE | 84 ms | 6632 KB |
ansneg_5.txt | RE | 83 ms | 6636 KB |
ansneg_6.txt | RE | 83 ms | 6632 KB |
ansneg_7.txt | RE | 85 ms | 6636 KB |
ansneg_8.txt | RE | 84 ms | 6636 KB |
ansneg_9.txt | RE | 84 ms | 6636 KB |
handmade_0.txt | RE | 85 ms | 6636 KB |
handmade_1.txt | RE | 86 ms | 6640 KB |
random_0.txt | RE | 83 ms | 6636 KB |
random_1.txt | RE | 85 ms | 6636 KB |
random_2.txt | RE | 85 ms | 6628 KB |
random_3.txt | RE | 84 ms | 6636 KB |
random_4.txt | RE | 83 ms | 6636 KB |
random_5.txt | RE | 83 ms | 6636 KB |
random_6.txt | RE | 85 ms | 6764 KB |
random_7.txt | RE | 87 ms | 6644 KB |
random_8.txt | RE | 83 ms | 6768 KB |
random_9.txt | RE | 84 ms | 6636 KB |
sample_0.txt | RE | 84 ms | 6764 KB |
sample_1.txt | RE | 85 ms | 6636 KB |
sample_2.txt | RE | 82 ms | 6732 KB |
top2fixed_0.txt | RE | 85 ms | 6636 KB |
top2fixed_1.txt | RE | 83 ms | 6636 KB |
top2fixed_2.txt | RE | 86 ms | 6728 KB |
top2fixed_3.txt | RE | 94 ms | 6636 KB |
top2fixed_4.txt | RE | 85 ms | 6636 KB |
top2fixed_5.txt | RE | 85 ms | 6636 KB |
top2fixed_6.txt | RE | 83 ms | 6616 KB |
top2fixed_7.txt | RE | 86 ms | 6760 KB |
top2fixed_8.txt | RE | 84 ms | 6636 KB |
top2fixed_9.txt | RE | 84 ms | 6632 KB |
topfixed_0.txt | RE | 85 ms | 6632 KB |
topfixed_1.txt | RE | 84 ms | 6636 KB |
topfixed_2.txt | RE | 86 ms | 6636 KB |
topfixed_3.txt | RE | 85 ms | 6636 KB |
topfixed_4.txt | RE | 87 ms | 6636 KB |
topfixed_5.txt | RE | 84 ms | 6648 KB |
topfixed_6.txt | RE | 84 ms | 6764 KB |
topfixed_7.txt | RE | 84 ms | 6636 KB |
topfixed_8.txt | RE | 86 ms | 6736 KB |
topfixed_9.txt | RE | 87 ms | 6740 KB |