AndyQsmart - 博客园

ACM学习历程—HDU 5072 Coprime（容斥原理）

摘要： DescriptionThere are n people standing in a line. Each of them has a unique id number.Now the Ragnarok is coming. We should choose 3 people to defend ... 阅读全文

posted @ 2015-10-24 19:17 AndyQsmart 阅读(279) 评论(0) 推荐(0)

ACM学习历程—SNNUOJ1132 余数之和(数论)

摘要： DescriptionF(n) = (n % 1) + (n % 2) + (n % 3) + ...... (n % n)。其中%表示Mod，也就是余数。例如F(6) = 6 % 1 + 6 % 2 + 6 % 3 + 6 % 4 + 6 % 5 + 6 % 6 = 0 + 0 + 0 + 2 +... 阅读全文

posted @ 2015-10-23 22:01 AndyQsmart 阅读(494) 评论(0) 推荐(0)

ACM学习历程—ZOJ 3868 GCD Expectation（莫比乌斯 || 容斥原理）

摘要： DescriptionEdwardhasasetofnintegers{a1,a2,...,an}.Herandomlypicksanonemptysubset{x1,x2,…,xm}(eachnonemptysubsethasequalprobabilitytobepicked),andwould... 阅读全文

posted @ 2015-10-10 21:23 AndyQsmart 阅读(319) 评论(0) 推荐(0)

ACM学习历程—HDU4675 GCD of Sequence（莫比乌斯）

摘要： DescriptionAliceisplayingagamewithBob.AliceshowsNintegersa1,a2,…,aN,andM,K.Shesayseachintegers1≤ai≤M.AndnowAlicewantstoaskforeachd=1toM,howmanydiffere... 阅读全文

posted @ 2015-10-10 20:42 AndyQsmart 阅读(307) 评论(0) 推荐(0)

ACM学习历程—HDU4746 Mophues（莫比乌斯）

摘要： DescriptionAs we know, any positive integer C ( C >= 2 ) can be written as the multiply of some prime numbers:C = p1×p2× p3× ... × pkwhich p1, p2 ... ... 阅读全文

posted @ 2015-10-09 21:56 AndyQsmart 阅读(1139) 评论(0) 推荐(1)

ACM学习历程—POJ3090 Visible Lattice Points（容斥原理 || 莫比乌斯）

摘要： DescriptionA lattice point (x, y) in the first quadrant (x and y are integers greater than or equal to 0), other than the origin, is visible from the ... 阅读全文

posted @ 2015-10-09 17:47 AndyQsmart 阅读(368) 评论(0) 推荐(0)

ACM学习历程—HDU1695 GCD（容斥原理 || 莫比乌斯）

摘要： 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... 阅读全文

posted @ 2015-10-08 22:54 AndyQsmart 阅读(292) 评论(0) 推荐(0)

ACM学习历程—HDU5476 Explore Track of Point（平面几何）（2015上海网赛09题）

摘要： Problem DescriptionIn Geometry, the problem of track is very interesting. Because in some cases, the track of point may be beautiful curve. For exampl... 阅读全文

posted @ 2015-10-06 19:59 AndyQsmart 阅读(279) 评论(0) 推荐(0)

ACM学习历程—HDU5478 Can you find it（数论）（2015上海网赛11题）

摘要： Problem DescriptionGiven a prime numberC(1≤C≤2×105), and three integers k1, b1, k2(1≤k1,k2,b1≤109). Please find all pairs (a, b) which satisfied the e... 阅读全文

posted @ 2015-10-06 18:58 AndyQsmart 阅读(341) 评论(0) 推荐(0)

ACM学习历程—HDU5475 An easy problem（线段树）(2015上海网赛08题)

摘要： Problem DescriptionOne day, a useless calculator was being built by Kuros. Let's assume that number X is showed on the screen of calculator. At first,... 阅读全文

posted @ 2015-10-06 17:22 AndyQsmart 阅读(291) 评论(0) 推荐(0)