본문 바로가기

알고리즘/백준

[BOJ 6591] 이항 숏다운

# 중간값이 왜 항상 정수인지 생각

# nCk = n-1Ck-1 + n-1Ck로 모든 문제를 풀려고 하지 말기

 

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
36
37
38
39
40
41
import java.util.*;
import java.lang.*;
import java.io.*;
 
class Main
{
    static Scanner sc = new Scanner(System.in);
    static int n, k;
    static int[][] dp;
    static long answer = 1;
    
    public static void main (String[] args) throws java.lang.Exception
    {
        while(true){
            n = sc.nextInt();
            k = sc.nextInt();
            
            answer = 1;
            
            // Exit
            if(n == 0 && k == 0)
                break;
            
            // nCk = nCn - k
            if(n - k < k)
                k = n - k;
                
            // nCk (중간값은, nC1, nC2, ... nCk-1)
            int div = 1;
            while(div <= k){
                answer *= n;
                answer /= div;
                
                n -= 1;
                div += 1;
            }
            
            System.out.println(answer);
        }
    }
}

java.util.<span