摘要： 题目：DescriptionPanda has received an assignment of painting a line of blocks. Since Panda is such an intelligent boy, he starts to think of a math problem of painting. Suppose there are N blocks in a l... 阅读全文

摘要： [代码] 阅读全文

摘要： [代码] 阅读全文

摘要： zjut1204[代码] 阅读全文

摘要： 相关题目：pku1637，zju1992欧拉回路相关资料：判断一个图中是否存在欧拉回路（每条边恰好只走一次，并能回到出发点的路径），在以下三种情况中有三种不同的算法： 一、无向图每个顶点的度数都是偶数，则存在欧拉回路。二、有向图（所有边都是单向的）每个节顶点的入度都等于出度，则存在欧拉回路。三.混合图欧拉回路　　混合图欧拉回路用的是网络流。　　把该图的无向边随便定向，计算每个点的入度和出度。如果有... 阅读全文

摘要： [代码]题目地址：http://acm.pku.edu.cn/JudgeOnline/problem?id=1273 阅读全文

摘要： [代码]题目链接：http://acm.pku.edu.cn/JudgeOnline/problem?id=2449 阅读全文

摘要： 题目描述 We get lost again , we can not find our friends...But luckly , we have mobile phone.They are moving by group,and we know our friend in the same group can connect with each other in directly or in... 阅读全文

摘要： 题目描述When I boring , I'm crazy...So I design a BT game just for fun...It's easy...输入描述 First line is a interger T <=20 ;T case follow ,each case begin with the interger N(N<=100000) , as the max ... 阅读全文

摘要： 题目描述 To think of a beautiful problem description is so hard for me that let's just drop them off. :)Now we have the path from one point to another(directly), and the weight we cost.Tell me the min wei... 阅读全文