morejarphone~

从爱好,到梦想

UVA 11388 (GCD&&LCM 水~)

题意:求a,b使得gcd(a,b) = G, lcm(a,b) = L且a最小. 设a=k1*G, b = k2*G,gcd (k1,k2)=0,设k=L/G,枚举一下k1判断互质就好了. #include #include #include #include #include #i...

2016-06-07 12:18:47

阅读数:191

评论数:0

HDU 5584 (数学)

LCM Walk Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 87    Accepted Submission(s): 46 ...

2015-11-29 23:58:30

阅读数:484

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭