[백준 알고리즘] 10872번 팩토리얼 (Python, Java)

 

<Python>

재귀로 푸는 방법

N = int(input())

def factorial(N):
    if N <= 1:
        return 1
    return N * factorial(N-1)

print(factorial(N))

while문으로 푸는 방법

N = int(input())

factorial = 1
while N >0:
    factorial *= N
    N-=1
print(factorial)

 

<Java>

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

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());
        System.out.println(fac(n));

    }
    public static int fac(int n){
        if(n==1 || n==0)
            return 1;
        return n*fac(n-1);
    }
}

 

▼ 링크

https://www.acmicpc.net/problem/10872

10872번: 팩토리얼