[BOJ] 11401 이항 계수 3

Time Lapse :None

11401.c

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include <stdio.h>
#define MOD 1000000007
#define MAX_N 4000000
#define ll long long
ll FACT[MAX_N+1];
ll REFACT[MAX_N+1];
ll getPOWED(ll N, ll P){
ll result = 1;
do{
if(P&1==1){
result *= N;
result %= MOD;
}
N *= N;
N %= MOD;
}while(P>>=1);
return result;
}
int main(void) {
int N,R,i;
FACT[1] = 1;
scanf("%d %d",&N,&R);
if(N==R||R==0){
printf("1");
return 0;
}
for(i = 2; i<=N; i++)
FACT[i] = (FACT[i-1]*i)%MOD;
REFACT[N] = getPOWED(FACT[N],MOD-2);
R = N-R > R ? R : N-R;
for(i=N-1; i>=R; i--)
REFACT[i] = (REFACT[i+1]*(i+1))%MOD;
printf("%lld",(((FACT[N]*REFACT[R])%MOD)*REFACT[N-R])%MOD);
}

Author: Song Hayoung
Link: https://songhayoung.github.io/2020/07/23/PS/BOJ/11401/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.