https://blog.youkuaiyun.com/Lbbbbpro029zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Lbbbbpro029/article/details/52740263https://blog.youkuaiyun.com/Lbbbbpro029/article/details/52740263Lbbbbpro029Wed, 05 Oct 2016 20:34:54 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029438https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029438Lbbbbpro029Thu, 31 Mar 2016 19:34:58 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029397https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029397Lbbbbpro029Thu, 31 Mar 2016 19:28:09 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029339https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029339Lbbbbpro029Thu, 31 Mar 2016 19:23:05 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029298https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029298Lbbbbpro029Thu, 31 Mar 2016 19:07:47 +0800>T; while(T--) { for(int i]]>https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029262https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029262Lbbbbpro029Thu, 31 Mar 2016 19:02:16 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029229https://blog.youkuaiyun.com/Lbbbbpro029/article/details/51029229Lbbbbpro029Thu, 31 Mar 2016 18:58:34 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958564https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958564Lbbbbpro029Tue, 22 Mar 2016 21:27:22 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958480https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958480Lbbbbpro029Tue, 22 Mar 2016 21:14:50 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958409https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958409Lbbbbpro029Tue, 22 Mar 2016 21:06:23 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958317https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958317Lbbbbpro029Tue, 22 Mar 2016 20:57:43 +0800=m。 思路： 枚举n的因子x，当gcd(x,n)>=m时求n/x的欧拉函数。 因为要使gcd(x*i,n)=gcd(x,n)，i必须与n/x互质，这种情况有phi(n/x)种。 最后求和，即为所求结果。 #include #include using namespace std; int phi(int n) { in]]>https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958256https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958256Lbbbbpro029Tue, 22 Mar 2016 20:44:59 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958191https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958191Lbbbbpro029Tue, 22 Mar 2016 20:40:02 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958137https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50958137Lbbbbpro029Tue, 22 Mar 2016 20:30:46 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50932379https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50932379Lbbbbpro029Sat, 19 Mar 2016 19:16:48 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50912804https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50912804Lbbbbpro029Thu, 17 Mar 2016 13:29:20 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50897669https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50897669Lbbbbpro029Tue, 15 Mar 2016 16:43:51 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50897645https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50897645Lbbbbpro029Tue, 15 Mar 2016 16:32:21 +0800https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50887084https://blog.youkuaiyun.com/Lbbbbpro029/article/details/50887084Lbbbbpro029Mon, 14 Mar 2016 16:36:08 +08000时,有        BX'+(A mod B)Y'=GCD(B,A mod B)=GCD(A,B) 可以通过变形得到       AY'+B(X'-A/B*Y')=GCD(A,B) 由此可得 X=Y‘，Y=X'-]]>https://blog.youkuaiyun.com/Lbbbbpro029/article/details/49665793https://blog.youkuaiyun.com/Lbbbbpro029/article/details/49665793Lbbbbpro029Thu, 05 Nov 2015 17:39:11 +0800