Host1Free VPS 申请成功

老早就在网上看到了 Host1Free VPS 的消息,想去申请,结果用家里的电脑申请提示 Only registrations from unique IPs allowed。然后挂 Go^_^Agent,提交成功,结果被 Reject 了。反反复复尝试,结果废掉 Gmail+Hotmail*2+QQ*2。。。后来把消息告诉 imbushuo,他直接在学校机房申请,结果成功了。功了。了。。后来发现是动态 IP 的问题,也就是申请的用户使用的不能是动态 IP,否则就挂。这回是在我爸单位申请的,成功了。128M 内存,10G 硬盘,只能拿来玩玩,估计装 wordpress 都可能吃不消。IP:94.249.250....

信息奥赛班的神人一个

每次老师叫我们去讲题目的时候,初一的人总会高呼郭同学的名字。我一直不知道他们为什么干这个,也许郭同学特别好吧。但是今天,我在学军 OJ 讨论区上看到了这么一段话:标题:神人!1 楼:yujialuo2011「guoyuqi11」(蓝天注:郭同学)3 分钟十一道题,平均十六秒一题,神人那!大家向他多多请教!如何才能练出如此神功!2012-07-18 16:27:112 楼:Wuao11比卡门还神2012-07-18 16:28:483 楼:cyf236119 zhaoyq2011 P1341 Accepted 2012-07-18 16:07:1636118 guoyuqi11 P1547 Accepted 2012-07-18 15:55:5636117 guoyuqi11 P1336 Accepted 2012-07-18 15:55:3736116 guoyuqi11 P1317 Accepted 2012-07-18 15:55:2636115 guoyuqi11 P1320 Accepted 2012-07-18 15:55:1036114 guoyuqi11 P1308 Accepted 2012-07-18 15:54:4336113 guoyuqi11 P1014 Accepted 2012-07-18 15:54:1836112 guoyuqi11 P1357 Accepted 2012-07-18 15:53:...

各种 OIer 的快排(Pascal 语言)

OIer 1:procedure qsort(l,r:longint);var i,j,m,t:longint;begin i:=l; j:=r; m:=a[(l+r) div 2]; repeat while a[i]m do dec(j); if ij; if l <j then qsort(l,j); if i <r then qsort(i,r);end;OIer 2:Procedure QuickSort(Left, Right : Longint);Var LeftPointer, RightPointer, Medium, Temp : Longint;Begin LeftPointer := Left; RightPointer := Right; Medium := a[(Left + Right) Shr 1]; Repeat While a[LeftPointer] Medium Do Dec(RightPointer); If LeftPointer j; If Left < RightPointer Then QuickSort(Left,RightPointer); If LeftPointer < Right Then QuickSort(LeftPointer,Right);End; {End Procedure}OIer 3:procedure kuaipai(z,y:longint);var i,j,m,t:longint;begin i:=z;j:=y;m:=a[(z+y) div 2];repeat while a[i]m do dec(j);if ij;if z <j then kuaipai(z,j)...