Submission #1078284
Source Code Expand
#include <algorithm> #include <cassert> #include <cfloat> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <deque> #include <iomanip> #include <iostream> #include <limits> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <vector> #define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i)) #define rep(i,n) FOR(i,0,n) #define pb push_back #define all(v) begin(v), end(v) #define debug(x) cerr<< #x <<": "<<x<<endl #define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vector<int> > vvi; typedef vector<ll> vll; typedef vector<vector<ll> > vvll; template<class T> using vv=vector<vector< T > >; int mod = 1e9 + 7; ll po(ll k, ll x) { if (x == 0) { return 1; } if (x == 1) { return k % mod; } ll y = po(k, x/2); y = y * y % mod; if (x % 2 == 1) { y = y * k % mod; } return y; } ll combination(ll n, ll k) { k = min(k, n-k); if (k == 0) { return 1; } ll ret = 1; FOR (i, n-k+1, n+1) { ret = ret * i % mod; } ll denomi = 1; // denominator FOR (i, 1, k+1) { denomi = denomi * i % mod; } ret = ret * po(denomi, mod-2) % mod; return ret; } int main() { int n, k; scanf("%d %d", &n, &k); if (n > k) { printf("%lld\n", combination(n + k - 1, k)); } else { printf("%lld\n", combination(n, k % n)); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | tspcx |
Language | C++14 (Clang++ 3.4) |
Score | 100 |
Code Size | 1638 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 928 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | 20 / 20 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask0_sample_01.txt, subtask0_sample_02.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 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.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_01.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, subtask2_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 19 ms | 796 KB |
subtask0_sample_02.txt | AC | 17 ms | 796 KB |
subtask0_sample_03.txt | AC | 17 ms | 672 KB |
subtask1_01.txt | AC | 17 ms | 796 KB |
subtask1_02.txt | AC | 18 ms | 796 KB |
subtask1_03.txt | AC | 17 ms | 800 KB |
subtask1_04.txt | AC | 17 ms | 792 KB |
subtask1_05.txt | AC | 17 ms | 800 KB |
subtask1_06.txt | AC | 18 ms | 788 KB |
subtask1_07.txt | AC | 21 ms | 924 KB |
subtask1_08.txt | AC | 17 ms | 800 KB |
subtask1_09.txt | AC | 16 ms | 924 KB |
subtask1_10.txt | AC | 18 ms | 796 KB |
subtask1_11.txt | AC | 16 ms | 788 KB |
subtask1_12.txt | AC | 17 ms | 796 KB |
subtask1_13.txt | AC | 16 ms | 796 KB |
subtask1_14.txt | AC | 18 ms | 672 KB |
subtask1_15.txt | AC | 16 ms | 928 KB |
subtask1_16.txt | AC | 18 ms | 928 KB |
subtask1_17.txt | AC | 18 ms | 800 KB |
subtask1_18.txt | AC | 16 ms | 796 KB |
subtask1_19.txt | AC | 17 ms | 928 KB |
subtask2_01.txt | AC | 18 ms | 800 KB |
subtask2_02.txt | AC | 17 ms | 800 KB |
subtask2_03.txt | AC | 17 ms | 924 KB |
subtask2_04.txt | AC | 18 ms | 800 KB |
subtask2_05.txt | AC | 17 ms | 928 KB |
subtask2_06.txt | AC | 16 ms | 672 KB |
subtask2_07.txt | AC | 18 ms | 924 KB |
subtask2_08.txt | AC | 18 ms | 844 KB |
subtask2_09.txt | AC | 17 ms | 920 KB |
subtask2_10.txt | AC | 18 ms | 796 KB |
subtask2_11.txt | AC | 18 ms | 916 KB |