Code&Data Insights
BaekJoon Algorithm - Stage 10 [10872,10870] ( Python 3 / JAVA ) 본문
BaekJoon Algorithm - Stage 10 [10872,10870] ( Python 3 / JAVA )
paka_corn 2022. 1. 23. 03:46
2022.01.22
< Stage 10 - Recursive Function (재귀함수) >
# 1. Stage 10 - [ 10872 ]
[JAVA]
import java.util.Scanner;
public class Main {
public static int Factorial(int a){
if (a == 1) {
return 1;
}else if(a==0) {
return 1;
}else {
return a *Factorial(a-1);
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println(Factorial(n));
}
}
--------------------------------------------
[Python]
n = int(input())
def factorial(a):
if a == 1:
return 1
elif a == 0:
return 1
else:
return (a* factorial(a-1))
print(factorial(n))
# 2. Stage 10 - [ 10870 ]
[JAVA]
import java.util.Scanner;
public class Main {
public static int Fibonacci(int a){
if (a == 0) {
return 0;
}else if(a==1) {
return 1;
}else {
return Fibonacci(a-1) + Fibonacci(a-2);
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println(Fibonacci(n));
}
}
-------------------
[Python 3]
n = int(input())
def fibonacci(a):
if a == 0:
return 0
elif a == 1:
return 1
else:
return (fibonacci(a-1) + fibonacci(a-2))
print(fibonacci(n))
'Algorithm > BaekJoon Online Judge' 카테고리의 다른 글
| BaekJoon Algorithm - Stage 8 [10757, 2775 ] ( Python 3 ) (0) | 2022.01.27 |
|---|---|
| BaekJoon Algorithm - Stage 8 [2839 - 설탕 배달] ( Python 3 ) (0) | 2022.01.26 |
| BaekJoon Algorithm - Stage 8 [1712, 2869] ( Python 3 ) (0) | 2022.01.18 |
| BaekJoon Algorithm - Stage 1 ~ 7 [Review] (0) | 2022.01.18 |
| BaekJoon Algorithm - Stage 7 [ 5-10 ] ( Python 3 ) (0) | 2022.01.18 |
