def recursive_function(i):
if i == 100:
return
recursive_function(i+1)
n! = 1x2x3x4x...x(n-1)n
n! = n (n-1)!
def factorial_recursive(n):
if n<=1:
return
return n * factorial_recursive(n-1)
=> 최대공약수 계산
# a>b 일때
def gcd(a,b):
if a%b == 0:
return b
else:
return gcd(b, a%b)