Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def pow(a,b):
- if b == 0: return 1
- if b % 2 == 0:
- x = pow(a, b/2)
- return x * x
- else:
- return f(a,b-1) * a
- # pow O(lg(n))
- ##################################################################
- '''
- kpk => kalikan semua angka pangkat terkecil
- fpb => kalikan angka paling kecil yang sama dengan pangkat terbesar
- a * b == fpb(a,b) * kpk(a,b)
- fpb(20, 35) == fpb(20, 35%20)
- fpb(20, 15) == fpb(5, 15)
- fpb(5, 0) == 5
- fpb(a, b):
- return fpb(b, a%b)
- kpk(a, b) == a*b / fpb(a,b)
- MINDBLOOOWWNN
- using memoization for Combination
- '''
Add Comment
Please, Sign In to add comment