How we can solve this type of question in general?

#1

If coefficients of a and b are different for many test cases for example in a program.Ex:-
if a program is like this ,we are given 2 integers say m and n for each test case ,find the maximum value of x which cant be achieved such that x=am+bn,where a>0&b>0?

#2

and can you share me some notes on circular permutations

#3

@chhabrapiyush480 could you please provide the question to me, its not visible to me.
As for notes please ask for them on WhatsApp grp.

#4

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.