![[백준 알고리즘] 10872번 팩토리얼 (Python, Java)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fee2fOE%2FbtqCD7VCDWH%2FAAAAAAAAAAAAAAAAAAAAAN0zfpBK8hAqHuiNIGV0TZlptPkBsVhLfuwkswh0vGKf%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3Dewoey%252FtYvgpV0O1EprUO21d0CbQ%253D)
언어, 알고리즘 공부/백준2020. 3. 10. 17:16[백준 알고리즘] 10872번 팩토리얼 (Python, Java)
재귀로 푸는 방법 N = int(input()) def factorial(N): if N 0: factorial *= N N-=1 print(factorial) 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(f..