Don't able to solve?

#1

Need help to sovle this problem.

#2

Hi Asish,
u can refer my code https://ide.codingblocks.com/s/610596

#3

i don’t understand why you do these -while(b != 0) { e = a % b; a = b; b = e; }

#4

hi… so this is the euclidian method for finding gcd… u can apply brute force also but this is an efficient method… u can refer this for more clarity https://www.geeksforgeeks.org/euclidean-algorithms-basic-and-extended/
also ig there is a video lecture on gcd in course contents also…

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.