摘要：
题意：有n个点，q个套餐，求连接所有的点的最小花费。 题解：用二进制枚举每个套餐，然后跑Kruskal（）。。。。。这种写法应该会超时的，可能数据太水了。。。。 阅读全文
摘要：
题意：寻找满足条件的最小生成树，条件是生成树中最长边与最短边的差越小越好。 题解：将边进行排序后，枚举第一条边，然后不断更新答案就行了。 阅读全文
摘要：
The cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situatio 阅读全文
摘要：
Nicholas Y. Alford was a cat lover. He had a garden in a village and kept many cats in his garden. The cats were so cute that people in the village al 阅读全文
摘要：
Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has alre 阅读全文
摘要：
Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs you 阅读全文
摘要：
Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his sol 阅读全文
摘要：
Mubashwir returned home from the contest and got angry after seeing his room dusty. Who likes to see a dusty room after a brain storming programming c 阅读全文
摘要：
n common cubic dice are thrown. What is the probability that the sum of all thrown dice is at least x? Input Input starts with an integer T (≤ 200), d 阅读全文
摘要：
Finally you found the city of Gold. As you are fond of gold, you start collecting them. But there are so much gold that you are getting tired collecti 阅读全文