![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
binggo1226
这个作者很懒,什么都没留下…
展开
-
51nod_1179_计算N个数之间两两之间GCD的最大值
![这里写图片描述](http://img.blog.csdn.net/20170724160720895?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvcXFfMjk2NjAxNTM=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/SouthEast)#include<原创 2017-07-24 16:09:19 · 1347 阅读 · 0 评论 -
51nod_1247可能的路径
#include#include#include#include#include#include#includeusing namespace std;int t;long long a, b;long long c, d;long long gcd(long long x, long long y){ return y == 0 ? x : gcd(y, x%y)原创 2017-07-24 16:28:25 · 293 阅读 · 0 评论