zoj3609 Modular Inverse（扩展欧几里德算法求逆元）模板

  Time Limit: 2 Seconds Memory Limit: 65536 KBios The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1≡x (mod m). This is equivalent to ax≡1 (mod m).ui Inp

>>阅读原文<<