上一页 1 ··· 32 33 34 35 36 37 38 39 40 ··· 53 下一页
摘要: Cube StackingTime Limit:2000MSMemory Limit:30000KTotal Submissions:15705Accepted:5331Case Time Limit:1000MSDescriptionFarmer John and Betsy are playing a game with N (1 #include using namespace std; const int mm=100010; class node { public:int r,u,dis; }g[mm]; int m; void dataset() { for(int i=... 阅读全文
posted @ 2013-02-24 17:10 剑不飞 阅读(200) 评论(0) 推荐(0) 编辑
摘要: Idiomatic Phrases GameTime Limit: 2 Seconds Memory Limit: 65536 KB Tom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. This game will give Tom two idioms. He should build a list of idioms and the list starts and ends with th 阅读全文
posted @ 2013-02-16 18:09 剑不飞 阅读(172) 评论(0) 推荐(0) 编辑
摘要: Domino EffectTime Limit:1000MSMemory Limit:65536KTotal Submissions:6322Accepted:1609DescriptionDid you know that you can use domino bones for other things besides playing Dominoes? Take a number of dominoes and build a row by standing them on end with only a small distance in between. If you do it r 阅读全文
posted @ 2013-02-16 17:11 剑不飞 阅读(151) 评论(0) 推荐(0) 编辑
摘要: The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:16068Accepted:5566DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, s 阅读全文
posted @ 2013-02-16 15:51 剑不飞 阅读(181) 评论(0) 推荐(0) 编辑
摘要: E - TV GameCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionThere is a new TV game on BerTV. In this game two players get a number A consisting of 2n digits. Before each turn players determine who will make the next 阅读全文
posted @ 2013-02-15 22:09 剑不飞 阅读(213) 评论(0) 推荐(0) 编辑
摘要: NetworkTime Limit:1000MSMemory Limit:30000KTotal Submissions:11041Accepted:4200Special JudgeDescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since eac 阅读全文
posted @ 2013-02-14 16:33 剑不飞 阅读(229) 评论(0) 推荐(0) 编辑
摘要: NetworkTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each worker of the company must have acc 阅读全文
posted @ 2013-02-14 16:15 剑不飞 阅读(134) 评论(0) 推荐(0) 编辑
摘要: SwordfishTime Limit: 2 Seconds Memory Limit: 65536 KB There exists a world within our worldA world beneath what we call cyberspace.A world protected by firewalls,passwords and the most advancedsecurity systems.In this world we hideour deepest secrets,our most incriminating information,and of course, 阅读全文
posted @ 2013-02-14 15:27 剑不飞 阅读(148) 评论(0) 推荐(0) 编辑
摘要: D - King's Problem?Crawling in process...Crawling failedTime Limit:3000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice CodeForces 30D DescriptionEvery true king during his life must conquer the world, hold the Codeforces world finals, win pink panda in the shooting 阅读全文
posted @ 2013-02-13 23:10 剑不飞 阅读(219) 评论(0) 推荐(0) 编辑
摘要: Sorting It All OutTime Limit: 2 Seconds Memory Limit: 65536 KB An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, D implies that A #include #include #incl. 阅读全文
posted @ 2013-02-12 15:06 剑不飞 阅读(162) 评论(0) 推荐(0) 编辑
上一页 1 ··· 32 33 34 35 36 37 38 39 40 ··· 53 下一页