摘要：
D -SaviorTime Limit:4000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 60DDescriptionMisha decided to help Pasha and Akim be friends again. He had a cunning plan — to destroy all the laughy mushrooms. He knows that the laughy mushrooms can easily burst when th 阅读全文
摘要：
吉哥系列故事——临时工计划Time Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 24Accepted Submission(s) : 5Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description 俗话说一分钱难倒英雄汉，高中几年下来，吉哥已经深深明白了这个道理，因此，新年开始存储一年的个人资金已经成了习惯，不过自从大学之后他不好意思再向大人要压岁钱了，只能把唯一的希望放到自己. 阅读全文
摘要：
E -PentagonTime Limit:10000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 51EDescriptionAccording to the last order issued by the president of Berland every city of the country must have its own Ministry Defense building (their own Pentagon). A megapolis Berbo 阅读全文
摘要：
C -Three Base StationsTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 51CDescriptionThe New Vasjuki village is stretched along the motorway and that's why every house on it is characterized by its shift relative to some fixed point — thexicoo 阅读全文
摘要：
B -bHTML Tables AnalisysTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 51BDescriptionIn this problem is used an extremely simplified version of HTML table markup. Please use the statement as a formal document and read it carefully.A string is a 阅读全文
摘要：
Closed FencesA closed fence in the plane is a set of non-crossing, connected line segments with N corners (3 #include
#include
#include
using namespace std;
const double ex=1e-10;
const int mm=2100;
class _point
{ public:double x,y; _point(double xx,double yy){x=xx;y=yy;} _point(){}
};
class ... 阅读全文
摘要：
E -Square Equation RootsTime Limit:5000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 50EDescriptionA schoolboy Petya studies square equations. The equations that are included in the school curriculum, usually look simple:x2 + 2bx + c = 0whereb,care natural nu 阅读全文
摘要：
http://acm.hdu.edu.cn/diy/contest_show.php?cid=186391001 畅通工程这题简单，只要把有连边的点合并。最后查看一下有几个不同的集合，集合数减1就是要建路的个数。1002 小希的迷宫本题实际上就是让你判断所给的边组成的是不是一棵树，本题是无向树，无向树是任意两点有且仅有一条通路，也就是没回路且联通。因此，每读入一条边，先判断该两点是否已经通了，在同一个集合，是就说明不是一棵树，不是就合并这两个集合。同时看这两个顶点是否出现过，如果没出现则需要记录一下。等这些工作完成后，在遍历一下出现过的顶点如果全在一个集合就说明是树，否则就不是。1003Far 阅读全文
摘要：
D -NotepadTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 17DDescriptionNick is attracted by everything unconventional. He doesn't like decimal number system any more, and he decided to study other number systems. A number system with basebcau 阅读全文
摘要：
Find them, Catch themTime Limit:1000MSMemory Limit:10000KTotal Submissions:23593Accepted:7066DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify whi 阅读全文