Flower195的专栏

Description The Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is goin

Exponentiation Time Limit: 500MS   Memory Limit: 10000K Total Submissions: 126831   Accepted: 30948 Description Problems involving the computation of exact values of ve

487-3279 Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 227999   Accepted: 39752 Description Businesses like to have memorable telephone numbers. One way

Hangover Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 94952   Accepted: 45999 Description How far can you make a stack of cards overhang a table? If you

解题思路：本题主要是解决一个平均数的舍入问题，对一个浮点数f, 结果保留n位有效数字，如果进行四舍五入的话，其公式                                          ： f=(f*10^n+0.5)/10^n 然而这里是，进行最近的舍入。所以这里不用这个公式，而是利用％.2f直接进行舍入。 ％.2f 说明的是第三位小数直接进入向最小方向舍入。 可以看看下面的程

DNA Sorting Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 77632   Accepted: 31144 Description One measure of ``unsortedness'' in a sequence is the number

Maya Calendar Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 62191   Accepted: 19188 Description During his last sabbatical, professor M. A. Ya made a sur

原题见： POJ 1008 Edge detection 由于题中说明输入的图像input image可能会有2 to 1,000,000,000 (109) 个像素，所以如果对输出图像output image的每一个像素都用枚举的方法去计算的话肯定会是超时的。所以需要找到一种方法来简化定种计算。自己在纸上也推了好久，没有找到。于是google了一下，发现一个解决的方法。网址是：P