- 博客(9)
- 资源 (1)
- 收藏
- 关注
RSS订阅转载 ubuntu 下安装vim 失败
近日在ubuntu－12.04.1下安装vim时遇到如下问题：garfield@ubuntu:~$ sudapt-get install vimstReading package lists... DoneBuilding dependency tree Reading state information... DoneSome packages could n
2014-01-22 13:52:01
1028
原创 POJ 1008 Edge detection
原题见：POJ 1008 Edge detection由于题中说明输入的图像input image可能会有2 to 1,000,000,000 (109) 个像素，所以如果对输出图像output image的每一个像素都用枚举的方法去计算的话肯定会是超时的。所以需要找到一种方法来简化定种计算。自己在纸上也推了好久，没有找到。于是google了一下，发现一个解决的方法。网址是：P
2014-01-16 20:37:31
848
原创 POJ 1008 Maya Calendar
Maya CalendarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 62191 Accepted: 19188DescriptionDuring his last sabbatical, professor M. A. Ya made a sur
2014-01-12 20:11:43
708
原创 POJ 1007 DNA
DNA SortingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 77632 Accepted: 31144DescriptionOne measure of ``unsortedness'' in a sequence is the number
2014-01-12 17:10:28
654
原创 POJ 1004 Financial Management
解题思路：本题主要是解决一个平均数的舍入问题，对一个浮点数f, 结果保留n位有效数字，如果进行四舍五入的话，其公式 ： f=(f*10^n+0.5)/10^n然而这里是，进行最近的舍入。所以这里不用这个公式，而是利用％.2f直接进行舍入。 ％.2f 说明的是第三位小数直接进入向最小方向舍入。可以看看下面的程
2014-01-12 15:50:17
642
原创 POJ 1003 Hangover
HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 94952 Accepted: 45999DescriptionHow far can you make a stack of cards overhang a table? If you
2014-01-12 15:03:51
575
原创 POJ 1002 487-3279
487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 227999 Accepted: 39752DescriptionBusinesses like to have memorable telephone numbers. One way
2014-01-12 13:30:06
706
原创 POJ 1001 Exponentitaion
ExponentiationTime Limit: 500MS Memory Limit: 10000KTotal Submissions: 126831 Accepted: 30948DescriptionProblems involving the computation of exact values of ve
2014-01-12 13:24:36
537
原创 POJ 1012 Timing Limit Exceed问题
DescriptionThe 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
2014-01-09 22:44:13
697
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人