08 2013 档案

Vim 学习笔记之cvim hot key
摘要：据说这货很吊的样子，就学习了下，确实很难上手，要记很多命令的说，不过功能确实强大，我准备先把这货弄成C/C++的一个开发环境，所以选择了叫cvim的一个插件，这个插件的好处在于可以用快捷键插入函数，用起来很爽网上的快捷键参考的过时了，所以去官方网站http://www.vim.org/scripts/script.php?script_id=213上下了一个来看看先存在这，自己慢慢记下来V IM -P LUGINc-support.vimV ERSION 6.0H OT KEYSKey mappings for Vim with and without GUI.Plugin: http://v 阅读全文
posted @ 2013-08-20 17:23 围剿大叔 阅读(418) 评论(0) 推荐(0)
The 10th Zhejiang Provincial Collegiate Programming Contest
摘要：A#include #include #include #include #include #includeusing namespace std;int t,n,m,r,s,q,p,c;double score[505];int rList[505],sList[505],jamList[1005];class Competition{public: int rank; string team;};Competition com[505];class People{ public: string team; string name; char sex; ... 阅读全文
posted @ 2013-08-17 14:30 围剿大叔 阅读(411) 评论(0) 推荐(0)
ACM MST Jungle Roads
摘要：Jungle RoadsTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1301DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes r 阅读全文
posted @ 2013-08-16 16:46 围剿大叔 阅读(195) 评论(0) 推荐(0)
ACM MST Connect the Cities
摘要：Connect the CitiesTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 3371DescriptionIn 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The gover 阅读全文
posted @ 2013-08-16 13:17 围剿大叔 阅读(236) 评论(0) 推荐(0)
ACM MST 畅通工程再续
摘要：畅通工程再续Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1875Description相信大家都听说一个“百岛湖”的地方吧，百岛湖的居民生活在不同的小岛中，当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖，发展首先要解决的问题当然是交通问题，政府决定实现百岛湖的全畅通！经过考察小组RPRush对百岛湖的情况充分了解后，决定在符合条件的小岛间建上桥，所谓符合条件，就是2个小岛之间的距离不能小于10米，也不能大于1000米。当然，为了 阅读全文
posted @ 2013-08-16 09:54 围剿大叔 阅读(277) 评论(0) 推荐(0)
ACM DS 畅通工程
摘要：畅通工程Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1863Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序，计算出全省畅通需要的最低成本。Input测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( #include using namesp 阅读全文
posted @ 2013-08-14 17:52 围剿大叔 阅读(238) 评论(0) 推荐(0)
ACM DS 还是畅通工程
摘要：还是畅通工程Time Limit:2000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1233Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( #include #include #define MA 阅读全文
posted @ 2013-08-14 16:27 围剿大叔 阅读(191) 评论(0) 推荐(0)
ACM DS Constructing Roads
摘要：A -Constructing RoadsTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1102DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B a 阅读全文
posted @ 2013-08-13 11:14 围剿大叔 阅读(172) 评论(0) 推荐(0)
CSU OJ终于好了
摘要：心情都愉悦了 阅读全文
posted @ 2013-08-11 09:11 围剿大叔 阅读(259) 评论(0) 推荐(0)
ACM POJ 2955
摘要：A - BracketsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2955DescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence,if s is a regular brackets sequence, then (s) an 阅读全文
posted @ 2013-08-10 13:57 围剿大叔 阅读(182) 评论(0) 推荐(0)
a题
摘要：D. Loggingtime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputThe main server of Gomble company received a log of one top-secret process, the name of which can't be revealed. The log was written in the following format: «[date:time]: message& 阅读全文
posted @ 2013-08-10 09:32 围剿大叔 阅读(196) 评论(2) 推荐(0)
用Blogilo在cnblogs上发表博客
摘要：之前在windows 上是用的wlr貌似听说linux上的blogilo也很强大，刚刚配置的好心酸先地址填这个http://www.cnblogs.com/Blog名/services/metaweblog.aspx注意这个时候千万别按获取要先点高级，然后选择MetaWebBlog API再点获取 确认试试这个第一篇用Blogilo发布的日志吧 阅读全文
posted @ 2013-08-09 23:39 围剿大叔 阅读(155) 评论(0) 推荐(0)
Temporary-Post-Used-For-Style-Detection-Title-745935782
摘要：Temporary-Post-Used-For-Style-Detection-Content-745935782 阅读全文
posted @ 2013-08-09 23:38 围剿大叔 阅读(117) 评论(0) 推荐(0)
Temporary-Post-Used-For-Style-Detection-Title-14513949
摘要：Temporary-Post-Used-For-Style-Detection-Content-14513949 阅读全文
posted @ 2013-08-09 23:34 围剿大叔 阅读(127) 评论(0) 推荐(0)
ACM Data Structure Blue Jeans
摘要：A - Blue Jeans Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description The Genographic Project is a research partnership between IBM and The National Geographic... 阅读全文
posted @ 2013-08-09 11:12 围剿大叔 阅读(386) 评论(0) 推荐(0)
【NOTE】char、char*、char**数组
摘要：开始不知道char**，被安叔训了 转载一个过来：http://blog.sina.com.cn/s/blog_65db99840100lwhs.html 平时都用的是char数组，基本忘记了char*数组和char**数组该怎么用了 char s1[10]; s1[0] s1[1]等都是char s1是char*，等同于&s1[0] char*s2[10]; s2[0] s2[1]... 阅读全文
posted @ 2013-08-09 10:14 围剿大叔 阅读(598) 评论(0) 推荐(0)
ACM POJ 3370 Halloween treats
摘要：Halloween treatsTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call o 阅读全文
posted @ 2013-08-08 11:03 围剿大叔 阅读(263) 评论(0) 推荐(0)
能不能不要手贱了
摘要：总结下自己老是犯的2b错误1.=写成==2.for或者while后加了个；3.变量写错4.以后再补充以此为贱！ 阅读全文
posted @ 2013-08-08 10:01 围剿大叔 阅读(131) 评论(0) 推荐(0)
ACM POJ 2356
摘要：Find a multipleTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionThe input contains N natural (i.e. positive integer) numbers ( N #include const int N = 10001;int a[N],sum[N],visit[N] ;int n;void print(int i,int j){ printf("%d\n&qu 阅读全文
posted @ 2013-08-08 09:59 围剿大叔 阅读(181) 评论(0) 推荐(0)
ACM POJ - 1850- Code
摘要：CodeTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64u[Submit] [Go Back] [Status]DescriptionTransmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system is that one where a number is associat 阅读全文
posted @ 2013-08-07 15:19 围剿大叔 阅读(247) 评论(0) 推荐(0)
ACM HDU 1465
摘要：不容易系列之一Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64u[Submit] [Go Back] [Status]Description大家常常感慨，要做好一件事情真的不容易，确实，失败比成功容易多了！做好“一件”事情尚且不易，若想永远成功而总从不失败，那更是难上加难了，就像花钱总是比挣钱容易的道理一样。话虽这样说，我还是要告诉大家，要想失败到一定程度也是不容易的。比如，我高中的时候，就有一个神奇的女生，在英语考试的时候，竟然把40个单项选择题全部做错了！大家都学过概率论，应该知道出现这种情况的概率， 阅读全文
posted @ 2013-08-07 15:17 围剿大叔 阅读(181) 评论(0) 推荐(0)
ACM Little Rooks 数学问题
摘要：E -Little RooksTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeSGU 222DescriptionInspired by a "Little Bishops" problem, Petya now wants to solve problem for rooks.A rook is a piece used in the game of chess which is played on a board of square grid 阅读全文
posted @ 2013-08-03 16:55 围剿大叔 阅读(232) 评论(0) 推荐(0)
ACM 背包 Piggy-Bank
摘要：B -Piggy-BankTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is 阅读全文
posted @ 2013-08-02 16:31 围剿大叔 阅读(224) 评论(0) 推荐(0)
ACM 背包 饭卡
摘要：A -饭卡Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescription电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡上的余额，问最少可使卡上的余额为多少。Input多组数据。对于每组数据：第一行为正整数n，表示菜的数量。n#i 阅读全文
posted @ 2013-08-02 15:55 围剿大叔 阅读(208) 评论(0) 推荐(0)