HDU 1695 GCD (欧拉函数+容斥原理)
摘要:
GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4272Accepted Submission(s): 1492Problem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x an 阅读全文
posted @ 2013-08-19 23:25 kuangbin 阅读(2825) 评论(0) 推荐(0) 编辑