Submission #3426873
Source Code Expand
#include <vector> #include <iostream> using namespace std; const long long mod = (1e9) + 7; long long mod_inv(long long x){ long long k = mod - 2, ret = 1; while(k){ if(k&1){ ret *= x; ret %= mod; } x *= x; x %= mod; k >>= 1; } return ret; } int main(){ long long n, k; cin >> n >> k; vector<long long> F(n+k); F[0] = 1; for(int i = 1; i < n+k+1; ++i) F[i] = (F[i-1]*i)%mod; cout << (((F[n+k-1]*mod_inv(F[k]))%mod)*mod_inv(F[n-1]))%mod << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 多重ループ |
User | TAB |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 541 Byte |
Status | RE |
Exec Time | 99 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 99 | 0 / 1 | ||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
Subtask1 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | RE | 98 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask0_sample_04.txt | AC | 1 ms | 256 KB |
subtask0_sample_05.txt | AC | 3 ms | 1792 KB |
subtask1_01.txt | RE | 97 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | RE | 99 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | RE | 98 ms | 256 KB |
subtask1_09.txt | RE | 97 ms | 256 KB |
subtask1_10.txt | RE | 96 ms | 256 KB |
subtask1_11.txt | RE | 96 ms | 256 KB |
subtask1_12.txt | RE | 98 ms | 256 KB |
subtask1_13.txt | RE | 97 ms | 256 KB |
subtask1_14.txt | RE | 98 ms | 256 KB |
subtask1_15.txt | AC | 1 ms | 256 KB |
subtask1_16.txt | RE | 97 ms | 256 KB |
subtask1_17.txt | AC | 1 ms | 256 KB |
subtask1_18.txt | RE | 97 ms | 256 KB |
subtask1_19.txt | AC | 1 ms | 256 KB |
subtask2_02.txt | AC | 2 ms | 768 KB |
subtask2_03.txt | AC | 2 ms | 1280 KB |
subtask2_04.txt | AC | 2 ms | 768 KB |
subtask2_05.txt | AC | 2 ms | 1536 KB |
subtask2_06.txt | AC | 1 ms | 512 KB |
subtask2_07.txt | AC | 2 ms | 1024 KB |
subtask2_08.txt | AC | 2 ms | 1408 KB |
subtask2_09.txt | AC | 2 ms | 1024 KB |
subtask2_10.txt | AC | 3 ms | 1792 KB |