莫比乌斯反演
One believe
欢迎来到Onebelieve的博客
展开
-
SPOJ VLATTICE - Visible Lattice Points(莫比乌斯反演)
传送门1 传送门2 description Consider a NNN lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0,0) ? A point X is visible from point ...原创 2019-12-23 16:58:43 · 125 阅读 · 0 评论 -
POJ 3090 Visible Lattice Points(莫比乌斯反演)
传送门 Description A 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 origin if the line from (0, 0) to (x, y) does...原创 2019-12-23 16:10:41 · 122 阅读 · 0 评论 -
bzoj 1101: [POI2007]Zap(莫比乌斯反演)
传送门 Description FGD正在破解一段密码,他需要回答很多类似的问题:对于给定的整数a,b和d,有多少正整数对x,y,满足x<=a,y<=b,并且gcd(x,y)=d。作为FGD的同学,FGD希望得到你的帮助。 Input 第一行包含一个正整数n,表示一共有n组询问。(1<=n<= 50000)接下来n行,每行表示一个询问,每行三个正整数,分别为a,b,d。(1...原创 2019-12-20 21:20:35 · 182 阅读 · 0 评论