容斥
文章平均质量分 57
NineFailure
这个作者很懒,什么都没留下…
展开
-
POJ1091 简单的欧几里得+简单的容斥
DescriptionZ城市居住着很多只跳蚤。在Z城市周六生活频道有一个娱乐节目。一只跳蚤将被请上一个高空钢丝的正中央。钢丝很长,可以看作是无限长。节目主持人会给该跳蚤发一张卡片。卡片上写有N+1个自然数。其中最后一个是M,而前N个数都不超过M,卡片上允许有相同的数字。跳蚤每次可以从卡片上任意选择一个自然数S,然后向左,或向右跳S个单位长度。而他最终的任务是跳到距离他左边一个单位长度的地方,并捡起位原创 2016-08-28 13:09:54 · 1376 阅读 · 2 评论 -
HDU1796 简单容斥
Description Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For example, N=12, a原创 2016-08-30 09:42:06 · 424 阅读 · 0 评论 -
HDU2841 一个关于互质的容斥
Description There are many trees forming a m * n grid, the grid starts from (1,1). Farmer Sherlock is standing at (0,0) point. He wonders how many trees he can see. If two trees and Sherlock are in on原创 2016-08-30 15:30:20 · 449 阅读 · 0 评论 -
HDU1695 略微有坑的容斥
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 be very large原创 2016-09-02 15:02:24 · 332 阅读 · 0 评论 -
HDU2204 第一道...超级水的容斥
DescriptionIgnatius 喜欢收集蝴蝶标本和邮票,但是Eddy的爱好很特别,他对数字比较感兴趣,他曾经一度沉迷于素数,而现在他对于一些新的特殊数比较有兴趣。 这些特殊数是这样的:这些数都能表示成M^K,M和K是正整数且K>1。 正当他再度沉迷的时候,他发现不知道什么时候才能知道这样的数字的数量,因此他又求助于你这位聪明的程序员,请你帮他用程序解决这个问题。 为了简化,原创 2016-08-25 19:39:56 · 757 阅读 · 0 评论 -
ZOJ 3233(45/600)
Watashi loves M mm very much. One day, M mm gives Watashi a chance to choose a number between low and high, and if the choosen number is lucky, M mm will marry him.M mm has 2 sequences, the first one i原创 2017-07-17 16:08:18 · 379 阅读 · 0 评论 -
Ural 1091(48/600)
University of New Tmutarakan trains the first-class specialists in mental arithmetic. To enter the University you should master arithmetic perfectly. One of the entrance exams at the Divisibility Depar原创 2017-07-18 14:36:12 · 302 阅读 · 0 评论 -
HUST1214(50/600)
A positive integer n is called cubic-free, if it can’t be written in this form n = x*x*x*k, while x is a positive integer larger than 1. Now give you two Integers L and R, you should tell me how many c原创 2017-07-18 19:11:52 · 295 阅读 · 0 评论