数论
「已注销」
这个作者很懒,什么都没留下…
展开
-
HDU-1695-GCD(莫比乌斯反演)
Problem Description Given 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 and y. Since the number of choices may原创 2014-08-15 14:49:13 · 1119 阅读 · 0 评论 -
HDU-4947-GCD Array(树状数组+莫比乌斯反演)
Problem Description Teacher Mai finds that many problems about arithmetic function can be reduced to the following problem: Maintain an array a with index from 1 to l. There are two kinds of ope原创 2014-08-18 15:21:42 · 2025 阅读 · 1 评论 -
HDU-4407-Sum(容斥原理)
Problem Description XXX is puzzled with the question below: 1, 2, 3, ..., n (1 Operation 1: among the x-th number to the y-th number (inclusive), get the sum of the numbers which are co-prim原创 2014-09-30 00:34:04 · 1266 阅读 · 0 评论