![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
扩展欧几里得算法
努力前行吧
这个作者很懒,什么都没留下…
展开
-
Wolf and Rabbit(欧几里得)
Wolf and Rabbit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5929 Accepted Submission(s): 2977 Problem Description There is a转载 2015-07-08 14:35:19 · 519 阅读 · 0 评论 -
A/B(扩展欧几里得算法)
A/B Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2814 Accepted Submission(s): 2082 Problem Description 要求(A/B)%9973,但由于A很大,我们转载 2015-07-08 12:47:17 · 420 阅读 · 0 评论 -
(扩展)欧几里德算法
欧几里德是用来求最大公约数的,可以把它看成是状态转移, 对任意两个数a,b(a>b),d=gcd(a,b),如果b不为零,那么gcd(a,b)=gcd(b,a%b) 证明: 令 r=a%b,即存在k,使得 a=b*k+r,那么r=a-b*k;显然r>=0, r%d=((a%d)-(b*k)%d)%d,因为a%d=b%d=0,所以r%d=0; 因此求gcd(a,b)可以转移到转载 2015-07-06 20:01:02 · 377 阅读 · 0 评论 -
Romantic(扩展欧几里得算法)
Romantic Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3507 Accepted Submission(s): 1423 Problem Description The Sky is Sprite转载 2015-07-08 13:17:53 · 320 阅读 · 0 评论