写的很好的一个模板,感谢作者。文章来源:http://www.cppblog.com/acronix/archive/2010/08/23/124470.aspx?opt=admin下面是 m^n % k 的快速幂:// m^n % k int quickpow(int m,int n,int k) { int b = 1; while (n > 0) { if (n & 1) b = (b*m)%k; n = n >> 1 ; m = (m*m)%k; } retur... Read More
posted @ 2012-08-20 10:17 free斩 Views(174) Comments(0) Diggs(0) Edit