Fast exponential algorithm + python Code

Algorithm works:

 

 

Python code:

 

. 1  DEF kuaiSuZhiShu (DI, zhiShu, MOD):
 2      zhiShu2 = bin (zhiShu) [2 :]
 . 3      length = len (zhiShu2)
 . 4      jieGuo ** DI = int (zhiShu2 [0])
 . 5      for I in Range (. 1 , length):
 . 6          jieGuo jieGuo ** = 2% MOD
 . 7          jieGuo jieGuo = int ** * DI (zhiShu2 [I])% MOD
 . 8      return jieGuo
 . 9  Print (kuaiSuZhiShu (. 11, 23 is, 187))

Guess you like

Origin www.cnblogs.com/kexve/p/11622336.html