| | | |

2014年3月12日

摘要：题目来源：http://acm.hdu.edu.cn/showproblem.php?pid=1695GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4947Accepted Submission(s): 1772Problem 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. 阅读全文

posted @ 2014-03-12 19:33 goodniao_1 阅读(285) 评论(0) 推荐(0)

hdu 1796 容斥原理 + longlong

摘要：题目来源：http://acm.hdu.edu.cn/showproblem.php?pid=1796How many integers can you findTime Limit: 12000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3539Accepted Submission(s): 994Problem DescriptionNow you get a number N, and a M-integers set, you should find out ho 阅读全文

posted @ 2014-03-12 14:26 goodniao_1 阅读(270) 评论(2) 推荐(0)