xjhz

摘要： A. Counterexample time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Counterexample time 阅读全文

摘要： E. Little Girl and Problem on Trees time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A li 阅读全文

摘要： D. Alyona and a tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Alyona has a tree w 阅读全文

摘要： M斐波那契数列 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Problem Description M斐波那契数列F[n]是一种整数数列，它的定义如下：F[0] = aF[1] = 阅读全文

摘要： D. GukiZ and Binary Operations time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output D. GukiZ a 阅读全文

摘要： C. GukiZ hates Boxes time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. GukiZ hates Boxe 阅读全文

摘要： A. Snacktower time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A. Snacktower time limit p 阅读全文

摘要： The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description There are a group of 阅读全文

摘要： 50 years, 50 colors Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description On Octorber 21st, HDU 50-year 阅读全文

摘要： 找出一个最大的集合使得该集合的任意两个人木有关系。 根据最大独立集 =顶点数 - 最大匹配数 hdu 1068 二分图的最小顶点覆盖数=最大匹配数 hdu 1150 DAG图（无回路有向图）的最小路径覆盖 hdu1151 阅读全文