正常 普通gcd操作简单并且经常模几下就没了 二进制复杂度是满的
by Mr_Spade @ 2018-10-24 09:04:44
用这个,这个贼快(这是在一个dalao的博客上看到的):
```cpp
int gcd(int a , int b) {
if (!b) return a;
while (b ^= a ^= b ^= a %= b);
return a;
}
```
by RiverFun @ 2018-10-24 09:07:18
@[zxy2004](/space/show?uid=71749)
by RiverFun @ 2018-10-24 09:09:29
@[Steve_braveman](/space/show?uid=96570) 感觉不是很快啊有个取模在那啊(
by fbhou @ 2018-10-24 09:11:28
@[fbhou](/space/show?uid=65589)
比上面两个快多了(本人亲测)
by RiverFun @ 2018-10-24 09:12:10
@[Mr_Spade](/space/show?uid=7253) @[Steve_braveman](/space/show?uid=96570) 唔,谢谢
by zxy2004 @ 2018-10-24 09:22:37
@[Steve_braveman](/space/show?uid=96570) 那可能是因为没有递归(
by fbhou @ 2018-10-24 09:23:30
@[Steve_braveman](/space/show?uid=96570) 怎么更慢了...
14.553s
by zxy2004 @ 2018-10-24 09:26:41
@[zxy2004](/space/show?uid=71749)
不对啊,我的电脑上这个明显比递归快啊~~看看是不是你的电脑的问题~~
by RiverFun @ 2018-10-24 09:28:26
好像确实不快
by 空の軌跡 @ 2018-10-24 09:32:09