inverse modulo 1169 C

Правка en1, от user121, 2019-06-01 22:21:53

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

Теги #binary search, modular arithmetic, #algorithms, discrete math

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский user121 2019-06-01 22:21:53 567 Initial revision (published)