The Hardest GCD Problem - CodeChef April Lunchtime

Hey guys, this is a video editorial for the CodeChef lunchtime problem - The Hardest GCD problem.
The prerequisite to solve the problem is Euclid's algorithm to find GCD of A and B: How to prove the Euclid's Algorithm -...
Problem Statement: https://www.codechef.com/LTIME59A/pro...

• #education
• #gcd
• #coding_contest
• #codechef
• #euclids_algorithm
• #coding
• #computer_science
• #competitive_programming
• #codechef_problem
• #gaurav_sen
• #gkcs
• #algorithm