inverse modulo 1169 C can someone give me an approach how can i solve this problem? I am trying to solve this problem from two days but not getting the solution just a bit of idea will be enough ,Please help Although I found one solution here but he simplified the basic condition of ques (aij+1)mod m to difference of two numbers I am getting the binary search part not getting how (aij+1)mod m getting satisfied in above approach