Compilation error

#1

what is wrong with the code

#2

@mayank10 after taking the mod of M with N, simply calculate the GCD using Euler method in log(n). You can use long or int for Euler method as after taking mod M will be less than N, and N is in range of int.
If this resolves your doubt mark it as resolved.

#3

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.

#4

i used biginteger and my all tests are getting passed and one test case is giving wrong output what is mistake in my code l

#5

i used biginteger and my all tests are getting passed and one test case is giving wrong output what is mistake in my code and the link is https://ide.codingblocks.com/s/223519