![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
-----数学
文章平均质量分 82
chenchenT_
这个作者很懒,什么都没留下…
展开
-
-----hdu 6047-Maximum Sequence
Problem DescriptionSteph is extremely obsessed with “sequence problems” that are usually seen on magazines: Given the sequence 11, 23, 30, 35, what is the next number? Steph always finds them too easy...原创 2018-03-18 14:42:49 · 253 阅读 · 0 评论 -
拓展欧几里得算法
拓展欧几里得算法其实就是解一个二元一次方程,ax+by=c, 求解x, y; ax+by=c; ax+by=gcd(a,b); 把上面那个方程转化为解下面的那个方程; 当然只有c%(gcd(a,b))==0,方程ax+by=c 才有解; 我们又知道gcd(a,b)==gcd(b,a%b); 设未知数x1,y1: 则有:ax+by=bx1+(a%b)y1; 又因为:a...原创 2018-03-22 20:57:37 · 247 阅读 · 0 评论