Problem: Monk and Divisor Conundrum
Solution: Tutorial||MyCode||MyCode

…………………………….GCD……………………………………
Problem : Codechef Maximum GCD
Solution:Time Complexity O(n*logn)MyCode