Submission #5327329
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define int long long #define endl "\n" #define REP(i,a,n) for(int i=a;i<n;++i) #define RUP(a,b) ((a+b-1)/(b)) #define SORTG(v) sort(v.begin(),v.end(),greater<>()) #define SORT(v) sort(v.begin(),v.end()) #define ALL(v) (v).begin(),(v).end() #define pb push_back #define mp make_pair #define mt make_tuple #define MOD 1000000007 #define INF LLONG_MAX/3 typedef long long ll; typedef pair<int,int> Pii; typedef tuple<int,int,int> Tiii; typedef vector<int> Vi; typedef vector<Vi> VVi; typedef vector<string> Vs; template<class T> void chmax(T& a, T b) {if(a<b){a=b;}} template<class T> void chmin(T& a, T b) {if(a>b){a=b;}} void YesNo(int a) {if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}} void YESNO(int a) {if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}} void AorB(int a,string b,string c) {if(a){cout<<b<<endl;}else{cout<<c<<endl;}} int gcd(int a,int b){return b?gcd(b,a%b):a;} void start(){cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);} const int MAX = 510000; long long fac[MAX], finv[MAX], inv[MAX]; // テーブルを作る前処理 void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } // 二項係数計算 long long COM(int n, int k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } signed main(){start(); int n,k; cin>>n>>k; COMinit(); if(n>k) cout<< COM(n+k-1,k)<<endl; else cout << COM(n,k%n)<< endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | hanaoka_ |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1751 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 12160 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 | 12160 KB |
subtask0_sample_02.txt | AC | 19 ms | 12160 KB |
subtask0_sample_03.txt | AC | 19 ms | 12160 KB |
subtask1_01.txt | AC | 19 ms | 12160 KB |
subtask1_02.txt | AC | 19 ms | 12160 KB |
subtask1_03.txt | AC | 20 ms | 12160 KB |
subtask1_04.txt | AC | 19 ms | 12160 KB |
subtask1_05.txt | AC | 20 ms | 12160 KB |
subtask1_06.txt | AC | 19 ms | 12160 KB |
subtask1_07.txt | AC | 19 ms | 12160 KB |
subtask1_08.txt | AC | 19 ms | 12160 KB |
subtask1_09.txt | AC | 19 ms | 12160 KB |
subtask1_10.txt | AC | 19 ms | 12160 KB |
subtask1_11.txt | AC | 20 ms | 12160 KB |
subtask1_12.txt | AC | 19 ms | 12160 KB |
subtask1_13.txt | AC | 19 ms | 12160 KB |
subtask1_14.txt | AC | 19 ms | 12160 KB |
subtask1_15.txt | AC | 19 ms | 12160 KB |
subtask1_16.txt | AC | 19 ms | 12160 KB |
subtask1_17.txt | AC | 19 ms | 12160 KB |
subtask1_18.txt | AC | 19 ms | 12160 KB |
subtask1_19.txt | AC | 20 ms | 12160 KB |
subtask2_01.txt | AC | 19 ms | 12160 KB |
subtask2_02.txt | AC | 19 ms | 12160 KB |
subtask2_03.txt | AC | 19 ms | 12160 KB |
subtask2_04.txt | AC | 19 ms | 12160 KB |
subtask2_05.txt | AC | 19 ms | 12160 KB |
subtask2_06.txt | AC | 19 ms | 12160 KB |
subtask2_07.txt | AC | 19 ms | 12160 KB |
subtask2_08.txt | AC | 19 ms | 12160 KB |
subtask2_09.txt | AC | 19 ms | 12160 KB |
subtask2_10.txt | AC | 19 ms | 12160 KB |
subtask2_11.txt | AC | 20 ms | 12160 KB |