Submission #1776895
Source Code Expand
#include<iostream> #include<algorithm> #include<math.h> using namespace std; typedef long long ll; #define MOD 1000000007 #define Nmax 200010 long long inv[Nmax],fact[Nmax],invfact[Nmax]; void PRE(){ inv[1]=fact[0]=invfact[0]=1; for(int i=1;i<Nmax;i++){ if(i>1)inv[i]=(MOD-(MOD/i)*inv[MOD%i]%MOD)%MOD; fact[i]=fact[i-1]*i%MOD; invfact[i]=invfact[i-1]*inv[i]%MOD; } } long long C(int n,int k){ return fact[n]*invfact[k]%MOD*invfact[n-k]%MOD; } int main(){ PRE(); ll n,k; cin>>n>>k; if(n>k){ cout<<C(n+k-1,k)<<endl; } else{ cout<<C(n,k%n)<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | ynymxiaolongbao |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 641 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 4992 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 | 6 ms | 4992 KB |
subtask0_sample_02.txt | AC | 6 ms | 4992 KB |
subtask0_sample_03.txt | AC | 6 ms | 4992 KB |
subtask1_01.txt | AC | 6 ms | 4992 KB |
subtask1_02.txt | AC | 6 ms | 4992 KB |
subtask1_03.txt | AC | 6 ms | 4992 KB |
subtask1_04.txt | AC | 6 ms | 4992 KB |
subtask1_05.txt | AC | 6 ms | 4992 KB |
subtask1_06.txt | AC | 6 ms | 4992 KB |
subtask1_07.txt | AC | 6 ms | 4992 KB |
subtask1_08.txt | AC | 6 ms | 4992 KB |
subtask1_09.txt | AC | 6 ms | 4992 KB |
subtask1_10.txt | AC | 6 ms | 4992 KB |
subtask1_11.txt | AC | 6 ms | 4992 KB |
subtask1_12.txt | AC | 6 ms | 4992 KB |
subtask1_13.txt | AC | 6 ms | 4992 KB |
subtask1_14.txt | AC | 6 ms | 4992 KB |
subtask1_15.txt | AC | 6 ms | 4992 KB |
subtask1_16.txt | AC | 6 ms | 4992 KB |
subtask1_17.txt | AC | 6 ms | 4992 KB |
subtask1_18.txt | AC | 6 ms | 4992 KB |
subtask1_19.txt | AC | 6 ms | 4992 KB |
subtask2_01.txt | AC | 6 ms | 4992 KB |
subtask2_02.txt | AC | 6 ms | 4992 KB |
subtask2_03.txt | AC | 6 ms | 4992 KB |
subtask2_04.txt | AC | 6 ms | 4992 KB |
subtask2_05.txt | AC | 6 ms | 4992 KB |
subtask2_06.txt | AC | 6 ms | 4992 KB |
subtask2_07.txt | AC | 6 ms | 4992 KB |
subtask2_08.txt | AC | 6 ms | 4992 KB |
subtask2_09.txt | AC | 6 ms | 4992 KB |
subtask2_10.txt | AC | 6 ms | 4992 KB |
subtask2_11.txt | AC | 6 ms | 4992 KB |