摘要: 摈弃 Windows 低效率的工作方式,发掘 Linux 身上的 UNIX 气质我已经半年没有使用 Windows 的方式工作了。Linux 高效的完成了我所有的工作。GNU/Linux 不是每个人都想用的。如果你只需要处理一般的事务,打游戏,那么你不需要了解下面这些了。我不是一个狂热的自由软件份子,虽然我很喜欢自由软件。这篇文章也不是用来推行自由软件运动的,虽然我觉得自由软件运动是非常好的。这篇文章也不是用来比较 Linux 和 Windows 内核效率,文件系统,网络服务的。我现在是作为一个用户而不是一个开发者来说话的,我们的讨论是基于操作,应用层面的。是为了告诉大学里还不了解,或者不 理 阅读全文
posted @ 2012-07-08 21:58 ismdeep 阅读(651) 评论(6) 推荐(2) 编辑
摘要: 老外有做过几个cloud9的镜像,但是都有各种各样的问题。 小弟在此做了一个docker镜像,特此分享,希望各位大佬多提宝贵意见。谢谢。 Cloud9 Online IDE Coding anywhere. 下载地址 启动命令,需要使用docker exec进入docker实例内部,然后执行下列命令 阅读全文
posted @ 2017-11-02 09:02 ismdeep 阅读(674) 评论(0) 推荐(0) 编辑
摘要: B题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩! ECJTU_ACM 11级队员2012年暑假训练赛(8) 4:30:00 4:30:00 K - A short problem Time Limit:1000MS M 阅读全文
posted @ 2012-08-13 10:58 ismdeep 阅读(233) 评论(0) 推荐(0) 编辑
摘要: HomeProblemsStatusContestRegisterLoginB题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩!ECJTU_ACM 11级队员2012年暑假训练赛(8)4:30:00OverviewProblemStatusRankDiscussABCDEFGHIJKJ -Word ProblemTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeFZU 2027Descri 阅读全文
posted @ 2012-08-13 10:57 ismdeep 阅读(221) 评论(1) 推荐(0) 编辑
摘要: HomeProblemsStatusContestRegisterLoginB题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩!ECJTU_ACM 11级队员2012年暑假训练赛(8)4:30:00OverviewProblemStatusRankDiscussABCDEFGHIJKI -Lucky DivisionTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 阅读全文
posted @ 2012-08-13 10:56 ismdeep 阅读(291) 评论(0) 推荐(0) 编辑
摘要: HomeProblemsStatusContestRegisterLoginB题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩!ECJTU_ACM 11级队员2012年暑假训练赛(8)4:30:00OverviewProblemStatusRankDiscussABCDEFGHIJKH -Petya and StringsTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForc 阅读全文
posted @ 2012-08-13 10:55 ismdeep 阅读(273) 评论(0) 推荐(0) 编辑
摘要: HomeProblemsStatusContestRegisterLoginB题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩!ECJTU_ACM 11级队员2012年暑假训练赛(8)4:30:00OverviewProblemStatusRankDiscussABCDEFGHIJKG -Nearly Lucky NumberTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeFo 阅读全文
posted @ 2012-08-13 10:54 ismdeep 阅读(660) 评论(0) 推荐(0) 编辑
摘要: HomeProblemsStatusContestRegisterLoginB题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩!ECJTU_ACM 11级队员2012年暑假训练赛(8)4:30:00OverviewProblemStatusRankDiscussABCDEFGHIJKF -A MameTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1010DescriptionT 阅读全文
posted @ 2012-08-13 10:53 ismdeep 阅读(238) 评论(0) 推荐(0) 编辑
摘要: HomeProblemsStatusContestRegisterLoginB题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩!ECJTU_ACM 11级队员2012年暑假训练赛(8)4:30:00OverviewProblemStatusRankDiscussABCDEFGHIJKE -Buy TicketsTime Limit:4000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2828Descrip 阅读全文
posted @ 2012-08-13 10:52 ismdeep 阅读(204) 评论(0) 推荐(0) 编辑
摘要: HomeProblemsStatusContestRegisterLoginB题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩!ECJTU_ACM 11级队员2012年暑假训练赛(8)4:30:00OverviewProblemStatusRankDiscussABCDEFGHIJKC -AsteroidsTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3041Descripti 阅读全文
posted @ 2012-08-13 10:51 ismdeep 阅读(243) 评论(0) 推荐(0) 编辑
摘要: HomeProblemsStatusContestRegisterLoginB题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩!ECJTU_ACM 11级队员2012年暑假训练赛(8)4:30:00OverviewProblemStatusRankDiscussABCDEFGHIJKD -Distinct PrimesTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 5987Descr 阅读全文
posted @ 2012-08-13 10:51 ismdeep 阅读(376) 评论(0) 推荐(0) 编辑
摘要: HomeProblemsStatusContestRegisterLoginB题要套一个数论的模版,注意m=1!! C题可以二分匹配,把行列看作点; 不能开百度,开谷歌搜题解,再次强调!一经发现,取消成绩!ECJTU_ACM 11级队员2012年暑假训练赛(8)4:30:00OverviewProblemStatusRankDiscussABCDEFGHIJKB -Modular InverseTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusPracticeZOJ 3609Descr 阅读全文
posted @ 2012-08-13 10:50 ismdeep 阅读(307) 评论(0) 推荐(0) 编辑
摘要: A -Paths on a GridTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1942DescriptionImagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mastered years ago (this time he's exp 阅读全文
posted @ 2012-08-13 10:48 ismdeep 阅读(213) 评论(0) 推荐(0) 编辑
摘要: === Windows 8 build 7850 KMS Activator and Timebomb Remover v0.9.4 ===[2012/8/11 20:03:39] === Application Initialised ===[2012/8/11 20:03:39] * NT 6.1.7600 Ultimate Edition-------------------[2012/8/11 20:03:40] === REFRESH STATUS ===[2012/8/11 20:03:40] = Timebomb: Disarmed![2012/8/11 20:03:40] .. 阅读全文
posted @ 2012-08-11 20:04 ismdeep 阅读(1088) 评论(0) 推荐(0) 编辑
摘要: Server Time: Sat Aug 11, 2012 2:16 pm Server Time: Sat Aug 11, 2012 2:16 pm Home Volume Contest Training Community Credits Welcome LinweiGang ( logout 阅读全文
posted @ 2012-08-11 14:18 ismdeep 阅读(445) 评论(0) 推荐(0) 编辑
摘要: Server Time:Sat Aug 11, 2012 1:59 pmHomeVolumeContestTrainingCommunityCreditsWelcomeLinweiGang (logout)1020 - A Childhood GamePDF (English)StatisticsForumTime Limit:0.5 second(s)Memory Limit:32 MBAlice and Bob are playing a game with marbles; you may have played this game in childhood. The game is p 阅读全文
posted @ 2012-08-11 14:00 ismdeep 阅读(253) 评论(0) 推荐(0) 编辑
摘要: Server Time:Sat Aug 11, 2012 10:06 amHomeVolumeContestTrainingCommunityCreditsWelcomeLinweiGang (logout)1093 - GhajiniPDF (English)StatisticsForumTime Limit:1 second(s)Memory Limit:32 MBAmir is having a short term memory problem. He can't remember anything for more thandmilliseconds.Amir is play 阅读全文
posted @ 2012-08-11 10:52 ismdeep 阅读(282) 评论(0) 推荐(1) 编辑
摘要: 开源是一种生活方式文/方越走上开源道路清晨六点钟,被儿子闹醒,第一件事是打开邮箱,迎面而来的是数以百计的邮件,我知道新一天的工作开始了。这是一个典型的场景,过去四年多的时间,我一直在家工作,全职参与Apache旗下多个开源项目的开发。以开源社区为核心,以maillinglist、IRC、JIRA、SVN、Git、Maven等为工具,参与全球化协作的开源项目。走上Apache开源道路,要从2006年谈起,当时源于ObjectWeb社区的Celtix和源于Codehaus社区的Xfire合并,成为了Apache旗下的一个新项目CXF。我当时所服务的公司IONA是开源项目Celtix的主要推动者,也 阅读全文
posted @ 2012-08-10 19:38 ismdeep 阅读(292) 评论(0) 推荐(0) 编辑
摘要: 1354 - IP CheckingPDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBAn IP address is a 32 bit address formatted in the following waya.b.c.dwherea, b, c, dare integers each ranging from0 to 255. Now you are given two IP addresses, first one in decimal form and second one in binary f 阅读全文
posted @ 2012-08-10 10:21 ismdeep 阅读(403) 评论(0) 推荐(0) 编辑
摘要: 1183 - Computing Fast AveragePDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:64 MBGiven an array of integers (0indexed), you have to perform two types of queries in the array.1 i j v- change the value of the elements fromithindex tojthindex tov.2 i j- find the average value of the int 阅读全文
posted @ 2012-08-09 17:02 ismdeep 阅读(411) 评论(0) 推荐(0) 编辑
摘要: 1004 - Monkey Banana ProblemPDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBYou are in the world of mathematics to solve the great "Monkey Banana Problem". It states that, a monkey enters into a diamond shaped two dimensional array and can jump in any of the adjacent ce 阅读全文
posted @ 2012-08-09 13:23 ismdeep 阅读(487) 评论(0) 推荐(0) 编辑
摘要: 下载地址:QQ2012 Under Ubuntu 阅读全文
posted @ 2012-08-09 12:48 ismdeep 阅读(174) 评论(0) 推荐(0) 编辑
摘要: 1 // Project name : 测试栈 2 // File name : main.cpp 3 // Author : iCoding 4 // E-mail : honi.linux@gmail.com 5 // Date & Time : Wed Aug 8 19:56:20 2012 6 7 8 #include <iostream> 9 #include <stdio.h>10 #include <string>11 #include <cmath>12 #include <algorithm>13 using 阅读全文
posted @ 2012-08-08 20:03 ismdeep 阅读(561) 评论(0) 推荐(0) 编辑
摘要: 记得很久以前做过这个题目的,那时候记得应该实在福州oj上做过的。1012 - Guilty PrincePDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBOnce there was a king named Akbar. He had a son named Shahjahan. For an unforgivable reason the king wanted him to leave the kingdom. Since he loved his son he decided his son woul 阅读全文
posted @ 2012-08-08 19:54 ismdeep 阅读(671) 评论(0) 推荐(0) 编辑
摘要: Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4087Accepted Submission(s): 2112Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, an 阅读全文
posted @ 2012-08-08 15:12 ismdeep 阅读(260) 评论(0) 推荐(0) 编辑
摘要: Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13056Accepted Submission(s): 5420Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a goo 阅读全文
posted @ 2012-08-08 11:31 ismdeep 阅读(735) 评论(0) 推荐(0) 编辑
摘要: 阅读全文
posted @ 2012-08-07 20:56 ismdeep 阅读(163) 评论(0) 推荐(0) 编辑
摘要: 阅读全文
posted @ 2012-08-07 20:54 ismdeep 阅读(148) 评论(0) 推荐(0) 编辑
摘要: 阅读全文
posted @ 2012-08-07 20:53 ismdeep 阅读(118) 评论(0) 推荐(0) 编辑
摘要: 阅读全文
posted @ 2012-08-07 20:51 ismdeep 阅读(98) 评论(0) 推荐(0) 编辑
摘要: 阅读全文
posted @ 2012-08-07 20:50 ismdeep 阅读(171) 评论(0) 推荐(0) 编辑
摘要: Train Problem ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11117Accepted Submission(s): 4042Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because 阅读全文
posted @ 2012-08-06 13:52 ismdeep 阅读(414) 评论(0) 推荐(0) 编辑
摘要: Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13700Accepted Submission(s): 6250Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of nu 阅读全文
posted @ 2012-08-06 11:03 ismdeep 阅读(339) 评论(0) 推荐(0) 编辑
摘要: K -String TaskTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 118ADescriptionPetya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given strin 阅读全文
posted @ 2012-08-05 23:55 ismdeep 阅读(394) 评论(0) 推荐(0) 编辑
摘要: J -Union SetTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeFZU 1924Description在操作系统中存在着死锁问题。进程在执行过程中,因争夺资源而造成的一种互相等待的现象,若无外力作用,它们都将无法推进下去。此时称系统处于死锁状态或系统产生了死锁,这些永远在互相等待的进程称为死锁进程。由于资源占用是互斥的,当某个进程提出申请资源后,使得有关进程在无外力协助下,永远分配不到必需的资源而无法继续运行,这就产生了死锁。例如,如果线程A占用了资源1并 阅读全文
posted @ 2012-08-05 23:54 ismdeep 阅读(399) 评论(0) 推荐(0) 编辑
摘要: I -SnowTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1088DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 阅读全文
posted @ 2012-08-05 23:53 ismdeep 阅读(291) 评论(0) 推荐(0) 编辑
摘要: H -Bookshelf 2Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3628DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.FJ hasNcows ( 阅读全文
posted @ 2012-08-05 23:52 ismdeep 阅读(431) 评论(0) 推荐(0) 编辑
摘要: G -Prime SumTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 2098Description把一个偶数拆成两个不同素数的和,有几种拆法呢?Input输入包含一些正的偶数,其值不会超过10000,个数不会超过500,若遇0,则结束。Output对应每个偶数,输出其拆成不同素数的个数,每个结果占一行。Sample Input30 26 0Sample Output3 2========================================= 阅读全文
posted @ 2012-08-05 23:51 ismdeep 阅读(255) 评论(0) 推荐(0) 编辑
摘要: F -Sign inTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 2022Descriptionpotato老师虽然很喜欢教书,但是迫于生活压力,不得不想办法在业余时间挣点外快以养家糊口。“做什么比较挣钱呢?筛沙子没力气,看大门又不够帅...”potato老师很是无奈。“张艺谋比你还难看,现在多有钱呀,听说还要导演奥运开幕式呢!你为什么不去娱乐圈发展呢?”lwg在一旁出主意。嗯,也是,为了生存,就委屈点到娱乐圈混混吧,马上就拍一部激光电影《杭电记忆――回 阅读全文
posted @ 2012-08-05 23:50 ismdeep 阅读(350) 评论(0) 推荐(0) 编辑
摘要: E -Little Elephant and SortingTime Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 205BDescriptionThe Little Elephant loves sortings.He has an arrayaconsisting ofnintegers. Let's number the array elements from 1 ton, then thei-th element will be d 阅读全文
posted @ 2012-08-05 23:48 ismdeep 阅读(196) 评论(0) 推荐(0) 编辑
摘要: D -Little Elephant and RozdilTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 205ADescriptionThe Little Elephant loves Ukraine very much. Most of all he loves town Rozdol (ukr. "Rozdil").However, Rozdil is dangerous to settle, so the Lit 阅读全文
posted @ 2012-08-05 23:47 ismdeep 阅读(366) 评论(0) 推荐(0) 编辑