11 2014 档案

摘要:一同学发来的题目:A. G将军有一支训练有素的军队,这个军队除开G将军外,每名士兵都有一个直接上级(可能是其他士兵,也可能是G将军)。现在G将军将接受一个特别的任务,需要派遣一部分士兵(至少一个)组成一个敢死队,为了增加敢死队队员的独立性,要求如果一名士兵在敢死队中,他的直接上级不能在敢死队中。 ... 阅读全文
posted @ 2014-11-30 20:54 哈特13 阅读(634) 评论(0) 推荐(2)
摘要:三鲜之所在转载自:http://blog.csdn.net/liuzhushiqiang/article/details/8659685最后一天,漫天飘起了雪花,假装欢送我离去。这次WF之战不太顺利,早期的C题大概花了1秒钟构思,然而由于输出格式多了一个空格直到两个半小时才逃脱Wrong Answe... 阅读全文
posted @ 2014-11-27 11:36 哈特13 阅读(269) 评论(0) 推荐(0)
摘要:Prince and PrincessInput:Standard InputOutput:Standard OutputTime Limit:3 SecondsIn ann x nchessboard, Prince and Princess plays a game. The squares i... 阅读全文
posted @ 2014-11-27 00:22 哈特13 阅读(222) 评论(0) 推荐(0)
摘要:M斐波那契数列Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1609Accepted Submission(s): 460Problem Desc... 阅读全文
posted @ 2014-11-26 16:31 哈特13 阅读(266) 评论(0) 推荐(0)
摘要:Problem 1752 A^B mod CAccept: 750Submit: 3205Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionGiven A,B,C, You should quickly calculate ... 阅读全文
posted @ 2014-11-26 15:28 哈特13 阅读(189) 评论(0) 推荐(0)
摘要:FibonacciDescriptionIn the Fibonacci integer sequence,F0= 0,F1= 1, andFn=Fn− 1+Fn− 2forn≥ 2. For example, the first ten terms of the Fibonacci sequenc... 阅读全文
posted @ 2014-11-26 15:17 哈特13 阅读(170) 评论(0) 推荐(0)
摘要:Computer TransformationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6084Accepted Submission(s):... 阅读全文
posted @ 2014-11-25 17:04 哈特13 阅读(384) 评论(0) 推荐(0)
摘要:LCISTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4437Accepted Submission(s): 2006Problem Descri... 阅读全文
posted @ 2014-11-24 23:33 哈特13 阅读(184) 评论(0) 推荐(0)
摘要:敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46775Accepted Submission(s): 19828Problem Desc... 阅读全文
posted @ 2014-11-24 23:01 哈特13 阅读(218) 评论(0) 推荐(0)
摘要:平方和总时间限制:3000ms内存限制:65536kB描述给出n(1#include#includeusing namespace std;#define N 500005#define ll long longll add[N>1; add[rt>1; build(l,m,rt... 阅读全文
posted @ 2014-11-24 22:58 哈特13 阅读(255) 评论(0) 推荐(0)
摘要:回文字符串时间限制:3000ms | 内存限制:65535KB难度:4描述所谓回文字符串,就是一个字符串,从左到右读和从右到左读是完全一样的,比如"aba"。当然,我们给你的问题不会再简单到判断一个字符串是不是回文字符串。现在要求你,给你一个字符串,可在任意位置添加字符,最少再添加几个字符,可以使这... 阅读全文
posted @ 2014-11-24 21:29 哈特13 阅读(148) 评论(0) 推荐(0)
摘要:统计难题Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 19054Accepted Submission(s): 8418Problem Desc... 阅读全文
posted @ 2014-11-24 17:25 哈特13 阅读(168) 评论(0) 推荐(0)
摘要:Housewife WindDescriptionAfter their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. People in XX Village l... 阅读全文
posted @ 2014-11-24 14:17 哈特13 阅读(239) 评论(0) 推荐(0)
摘要:TreeDescriptionYou are given a tree withNnodes. The tree’s nodes are numbered 1 throughNand its edges are numbered 1 throughN− 1. Each edge is associa... 阅读全文
posted @ 2014-11-24 13:22 哈特13 阅读(156) 评论(0) 推荐(0)
摘要:B-numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2668 Accepted Submission(s): 1467Problem... 阅读全文
posted @ 2014-11-22 17:15 哈特13 阅读(210) 评论(0) 推荐(0)
摘要:The Unique MSTDescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a conn... 阅读全文
posted @ 2014-11-20 12:26 哈特13 阅读(196) 评论(0) 推荐(0)
摘要:开心的mdd时间限制:1000ms | 内存限制:65535KB难度:3描述himdd有一天闲着无聊,随手拿了一本书,随手翻到一页,上面描述了一个神奇的问题,貌似是一个和矩阵有关的东西。给出三个矩阵和其行列A1(10*100),A2(100*5),A3(5*50)。现在himdd要算出计算矩阵所要的... 阅读全文
posted @ 2014-11-20 00:24 哈特13 阅读(182) 评论(0) 推荐(0)
摘要:Maximum Tape Utilization Ratio(0594)Time limit(ms): 1000Memory limit(kb): 65535Submission: 467Accepted: 67Description设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序... 阅读全文
posted @ 2014-11-19 21:59 哈特13 阅读(1606) 评论(0) 推荐(0)
摘要:售货员的难题(0411)Time limit(ms): 5000Memory limit(kb): 65535Submission: 1744Accepted: 200Description某乡有n个村庄(1#include #include using namespace std;#define ... 阅读全文
posted @ 2014-11-18 23:19 哈特13 阅读(854) 评论(0) 推荐(0)
摘要:白书P61 - 点集配对问题状压DP#include #include #include using namespace std;#define INF 0x3f3f3f3fstruct Point{ double x,y,z;}p[20+2];int n;double dp[(1<<20)+... 阅读全文
posted @ 2014-11-18 14:35 哈特13 阅读(321) 评论(0) 推荐(0)
摘要:白书P60 - 硬币问题完全背包、DP#include #include #include using namespace std;#define INF 0x3f3f3f3f#define N 1010int n,s;int w[N]; //w表示n种硬币的面值int dp... 阅读全文
posted @ 2014-11-18 14:31 哈特13 阅读(205) 评论(0) 推荐(0)
摘要:Most PowerfulTime Limit: 2 Seconds Memory Limit: 65536 KBRecently, researchers on Mars have discovered N powerful atoms. All of them are different. Th... 阅读全文
posted @ 2014-11-18 00:43 哈特13 阅读(153) 评论(0) 推荐(0)
摘要:TravellingTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4166Accepted Submission(s): 1339Problem ... 阅读全文
posted @ 2014-11-18 00:11 哈特13 阅读(165) 评论(0) 推荐(0)
摘要:acmer必看的26个对acm态度转载自:http://www.cppblog.com/Darren/archive/2009/08/03/92099.htmlAttemptKeep on attempting!尝试,尝试,再尝试!BraveryNever lose heart, be sure y... 阅读全文
posted @ 2014-11-16 22:41 哈特13 阅读(173) 评论(0) 推荐(0)
摘要:推箱子Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5343Accepted Submission(s): 1503Problem Descrip... 阅读全文
posted @ 2014-11-16 22:02 哈特13 阅读(191) 评论(0) 推荐(0)
摘要:Hie with the PieTime Limit:2000MSMemory Limit:65536KTotal Submissions:4712Accepted:2502DescriptionThe Pizazz Pizzeria prides itself in delivering pizz... 阅读全文
posted @ 2014-11-16 12:26 哈特13 阅读(201) 评论(0) 推荐(0)
摘要:Corn FieldsTime Limit:2000MSMemory Limit:65536KTotal Submissions:8326Accepted:4434DescriptionFarmer John has purchased a lush new rectangular pasture ... 阅读全文
posted @ 2014-11-15 12:00 哈特13 阅读(135) 评论(0) 推荐(0)
摘要:炮兵阵地Time Limit:2000MSMemory Limit:65536KTotal Submissions:19922Accepted:7709Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表... 阅读全文
posted @ 2014-11-15 11:58 哈特13 阅读(326) 评论(0) 推荐(0)
摘要:Rebuilding RoadsTime Limit:1000MSMemory Limit:30000KTotal Submissions:9249Accepted:4198DescriptionThe cows have reconstructed Farmer John's farm, with... 阅读全文
posted @ 2014-11-13 17:56 哈特13 阅读(141) 评论(0) 推荐(0)
摘要:The more, The BetterTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5506Accepted Submission(s): 32... 阅读全文
posted @ 2014-11-13 09:37 哈特13 阅读(125) 评论(0) 推荐(0)
摘要:Starship TroopersTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11476Accepted Submission(s): 316... 阅读全文
posted @ 2014-11-13 08:15 哈特13 阅读(161) 评论(0) 推荐(0)
摘要:TELETime Limit:1000MSMemory Limit:65536KTotal Submissions:3787Accepted:2007DescriptionA TV-network plans to broadcast an important football match. The... 阅读全文
posted @ 2014-11-13 00:40 哈特13 阅读(175) 评论(0) 推荐(0)
摘要:ComputerTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4073Accepted Submission(s): 2039Problem De... 阅读全文
posted @ 2014-11-11 20:17 哈特13 阅读(143) 评论(0) 推荐(0)
摘要:Anniversary partyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6078Accepted Submission(s): 2752P... 阅读全文
posted @ 2014-11-11 18:57 哈特13 阅读(136) 评论(0) 推荐(0)
摘要:Relief grainTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 1559Accepted Submission(s): 383Prob... 阅读全文
posted @ 2014-11-11 14:53 哈特13 阅读(221) 评论(0) 推荐(0)
摘要:受不了、弄了好久、各种百度、最后、搞定、总结一个简单搭建方法、= =1、先看这里:http://jingyan.baidu.com/article/37bce2be10e1c21002f3a20b.html 正如里面所说(1)先安装JDK,配置java环境,我用的是jdk1.8.0(2)下载套装版... 阅读全文
posted @ 2014-11-11 11:33 哈特13 阅读(128) 评论(0) 推荐(0)
摘要:TreeTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2038Accepted Submission(s): 391Problem Descri... 阅读全文
posted @ 2014-11-10 16:30 哈特13 阅读(147) 评论(0) 推荐(0)
摘要:375. Query on a treeYou are given a tree (an acyclic undirected connected graph) withNnodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfr... 阅读全文
posted @ 2014-11-09 22:40 哈特13 阅读(174) 评论(0) 推荐(0)
摘要:Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3544Accepted Submission(s): 995Pro... 阅读全文
posted @ 2014-11-09 00:59 哈特13 阅读(263) 评论(0) 推荐(0)
摘要:倒金字塔(0585)Time limit(ms): 3000Memory limit(kb): 65535Submission: 208Accepted: 48DescriptionSWUST国的一支科学考察队到达了举世闻名的古埃及金字塔。关于金字塔的建造一直是一个未解之谜, 有着“西方史学之父”之... 阅读全文
posted @ 2014-11-04 22:35 哈特13 阅读(446) 评论(0) 推荐(0)
摘要:魔板Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1917Accepted Submission(s): 393Problem Descript... 阅读全文
posted @ 2014-11-03 18:13 哈特13 阅读(211) 评论(0) 推荐(0)
摘要:InvestmentTime Limit:10000MSMemory Limit:32768KB64bit IO Format:%lld & %lluDescriptionJohn never knew he had a grand-uncle, until he received the nota... 阅读全文
posted @ 2014-11-02 12:53 哈特13 阅读(311) 评论(0) 推荐(0)
摘要:24 Point game时间限制:3000ms | 内存限制:65535KB难度:5描述There is a game which is called 24 Point game.In this game , you will be given some numbers. Your task is... 阅读全文
posted @ 2014-11-01 17:33 哈特13 阅读(256) 评论(0) 推荐(0)
摘要:三个水杯时间限制:1000ms | 内存限制:65535KB难度:4描述给出三个水杯,大小不一,并且只有最大的水杯的水是装满的,其余两个为空杯子。三个水杯之间相互倒水,并且水杯没有标识,只能根据给出的水杯体积来计算。现在要求你写出一个程序,使其输出使初始状态到达目标状态的最少次数。输入第一行一个整数... 阅读全文
posted @ 2014-11-01 14:53 哈特13 阅读(346) 评论(0) 推荐(0)