摘要：
还是畅通工程 Problem Description 某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Inp 阅读全文
摘要：
畅通工程 Problem Description 某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？ Input 测试输入 阅读全文
摘要：
Eddy's picture Problem Description Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pict 阅读全文
摘要：
Constructing Roads Problem Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villa 阅读全文
摘要：
Buy the Ticket Problem Description The \\\\\\\"Harry Potter and the Goblet of Fire\\\\\\\" will be on show in the next few days. As a crazy fan of Har 阅读全文
摘要：
C. Arpa's loud Owf and Mehrdad's evil plan time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outpu 阅读全文
摘要：
B. Arpa’s obvious problem and Mehrdad’s terrible solution time limit per test 1 second memory limit per test 256 megabytes input standard input output 阅读全文
摘要：
Last non-zero Digit in N! Problem Description The expression N!, read as "N factorial," denotes the product of the first N positive integers, where N 阅读全文
摘要：
Disharmony Trees Problem Description One day Sophia finds a very big square. There are n trees in the square. They are all so tall. Sophia is very int 阅读全文
摘要：
Interviewe Problem Description YaoYao has a company and he wants to employ m people recently. Since his company is so famous, there are n people comin 阅读全文