๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

Algorithm/Baekjoon

[6์ฃผ์ฐจ] ๋ฐฑ์ค€ 10872 ํŒฉํ† ๋ฆฌ์–ผ

ํŒฉํ† ๋ฆฌ์–ผ ๋ฌธ์ œํ’€์ด

 

๐Ÿ’ปQ

0๋ณด๋‹ค ํฌ๊ฑฐ๋‚˜ ๊ฐ™์€ ์ •์ˆ˜ N์ด ์ฃผ์–ด์ง„๋‹ค. ์ด๋•Œ, N!์„ ์ถœ๋ ฅํ•˜๋Š” ํ”„๋กœ๊ทธ๋žจ์„ ์ž‘์„ฑํ•˜์‹œ์˜ค.
์ž…๋ ฅ
์ฒซ์งธ ์ค„์— ์ •์ˆ˜ N(0 ≤ N ≤ 12)์ด ์ฃผ์–ด์ง„๋‹ค.
์ถœ๋ ฅ
์ฒซ์งธ ์ค„์— N!์„ ์ถœ๋ ฅํ•œ๋‹ค.

์˜ˆ์ œ ์ž…๋ ฅ 1
์˜ˆ์ œ ์ถœ๋ ฅ 1
์˜ˆ์ œ ์ž…๋ ฅ 2
์˜ˆ์ œ ์ถœ๋ ฅ 2

 

๐Ÿ’กA

1์ด๊ฑฐ๋‚˜ 0์ผ๋•Œ 1์„ ๋ฐ˜ํ™˜ํ•˜๊ณ  n * factorial(n-1)์„ ํ•ด์ฃผ์–ด ์žฌ๊ท€ ํ˜ธ์ถœํ•˜๋Š” ํ•จ์ˆ˜ factorial()๋กœ ํ’€์—ˆ๋‹ค.
์žฌ๊ท€๋Š” ๋ฐ˜๋ณต๋ฌธ์œผ๋กœ๋„ ๋ฐ”๊ฟ€ ์ˆ˜ ์žˆ๋‹ค.
import java.io.*;

public class Main {
    
    public static int factorial(int n) {
        if(n <= 1) {
            return 1;
        }else {
            return n * factorial(n-1);
            }
        }
    
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        int answer = factorial(n);
        System.out.println(answer);
    }
}โ€‹

 

import java.io.*;

public class Main {
    
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        int answer = 1;
        
        while(n != 0) {
            answer = answer * n;
            n--;
        }
        System.out.println(answer);
    }
}