摘要：
SPOJ Problem Set (classical)1825. Free tour IIProblem code: FTOUR2After the success of 2nd anniversary (take a look at problemFTOURfor more details), this 3rd year, Travel Agent SPOJ goes on with another discount tour.The tour will be held onICPCisland, a miraculous one on the Pacific Ocean. We list 阅读全文
2012年7月8日
2012年7月7日
摘要：
POJ1741 TreeTime Limit:1000MSMemory Limit:30000KTotal Submissions:6232Accepted:1770DescriptionGive a tree with n vertices,each edge has a length(positive integer less than 1001).Define dist(u,v)=The min distance between node u and v.Give an integer k,for every pair (u,v) of vertices is called valid 阅读全文
2012年7月6日
摘要：
POJ3237 TreeTime Limit:5000MSMemory Limit:131072KTotal Submissions:2158Accepted:574DescriptionYou are given a tree withNnodes. The tree’s nodes are numbered 1 throughNand its edges are numbered 1 throughN− 1. Each edge is associated with a weight. Then you are to execute a series of instructions on 阅读全文
2012年7月5日
摘要：
Country FTime Limit:2 Seconds Memory Limit:32768 KBAs you know, in aTreethere is exactly one path between two nodes. AForestconsists of one or more Trees. Country F hasNcities, some cities are connected by roads, and these cites form a Forest withat least two trees.The king of country F is a man wit 阅读全文
2012年5月24日
摘要：
SGU 298. King Berl VITime limit per test: 1.5 second(s)Memory limit: 65536 kilobytesinput: standardoutput: standardKing Berl VI hasNdaughters and no sons. During his long life he gave a number of promises to his daughters. All the promises have the following wording: "daughterXi, I promise to g 阅读全文
2012年5月15日
摘要：
POJ1635 Subway tree systemsTime Limit:1000MSMemory Limit:10000KTotal Submissions:5470Accepted:2248DescriptionSome major cities have subway systems in the form of a tree, i.e. between any pair of stations, there is one and only one way of going by subway. Moreover, most of these cities have a unique 阅读全文
2012年5月13日
摘要：
金华省赛总结金华省赛过去完整一个星期，想一个星期前的现在，我们还在金华，为只得了银牌而不爽。不过，也就这水平了。这是我acm生涯中第一次出去比赛，学到的挺多。AxorB，我们这次的队名，貌似我还是挺喜欢这个队名的，以后如果可以的话，继续用这个队名吧。这次的队友是mickey和ch_g。也许是因为队友间的配合不默契，也没见过大世面，金华省赛，个人感觉合作得有点问题。比赛一开始，A题开始被板刷，光神看的题，因为光神是来带我和mickey，他给mickey说了题意叫他去写，果然是道水题，mickey迅速拍完，直接wa，然后就是噩梦的开始。当时我从后往前看题，mickey一直在那里搞A题，感觉是道水题 阅读全文
2012年5月11日
摘要：
POJ1639 Picnic PlanningTime Limit:5000MSMemory Limit:10000KTotal Submissions:7381Accepted:2567DescriptionThe Contortion Brothers are a famous set of circus clowns, known worldwide for their incredible ability to cram an unlimited number of themselves into even the smallest vehicle. During the off-se 阅读全文
2012年5月10日
摘要：
1016: [JSOI2008]最小生成树计数Time Limit:1 SecMemory Limit:162 MBSubmit:1027Solved:384Description现在给出了一个简单无向加权图。你不满足于求出这个图的最小生成树，而希望知道这个图中有多少个不同的最小生成树。（如果两颗最小生成树中至少有一条边不同，则这两个最小生成树就是不同的）。由于不同的最小生成树可能很多，所以你只需要输出方案数对31011的模就可以了。Input第一行包含两个数，n和m，其中1<=n<=100; 1<=m<=1000; 表示该无向图的节点数和边数。每个节点用1~n的整数编 阅读全文
摘要：
POJ4046 SightseeingDescriptionCC and MM arrive at a beautiful city for sightseeing. They have found a map ofthe city on the internet to help them find some places to have meals. They like buffetrestaurants (self-service restaurants) and there are n such restaurants and m roads. Allrestaurants are nu 阅读全文