- 博客(6)
- 收藏
- 关注
RSS订阅原创 UVA 11426 GCD - Extreme (II)（神TM GCD大法，欧拉函数）
Given the value of N, you will have to findthe value of G. The definition of G is given below:uva 11426 - GCD - Extreme (II)" title="ACM: uva 11426 - GCD - Extreme (II)" height="53" width="173">
2016-08-29 14:36:42
544
原创 Light oj 1214 Large Division（同余定理，判断是否整除）
DescriptionGiven two integers, a and b, you should check whethera is divisible by b or not. We know that an integera is divisible by an integer b if and only if there exists an integerc such
2016-08-29 14:26:18
1251
原创 POJ 3347（计算几何）
DescriptionIn this problem, you are given a sequence S1, S2, ...,Sn of squares of different sizes. The sides of the squares are integer numbers. We locate the squares on the positivex-y qu
2016-08-08 20:45:57
308
原创 Light OJ 1038(概率DP)
DescriptionRimi learned a new thing about integers, which is - any positive integer greater than1 can be divided by its divisors. So, he is now playing with this property. He selects a numberN
2016-08-08 20:26:35
288
原创 hdu 5762 Teacher Bo（暴力美学）
这个题当时我写的时候一看，要把10^5个点组成的所有情况暴力一遍肯定T了，但又没有更好的方法，于是放弃了这道题但后来才知道，它的坐标范围也就10^5，也就是说曼哈顿距离最大也就是2*10^5，遍历所有点肯定超时，但遍历所有曼哈顿距离时间肯定有多的因为大不了最坏的情况是遍历的点集前2*10^5个全部都是不一样的，但是遍历的下一个点肯定与前面的2*10^5中的某一个情况有重合的，而这个时候就找
2016-08-05 16:47:58
730
原创 CF 235B Let's Play Osu!(概率dp)
DescriptionYou're playing a game called Osu! Here's a simplified version of it. There aren clicks in a game. For each click there are two outcomes: correct or bad. Let us denote correct as "
2016-08-05 16:06:57
704
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人