We Can

Given an undirected weighted graph G , you should find one of spanning trees specified as follows. The graph G is an ordered pair (V, E) , where V is a set of vertices {v1, v2,..., vn} and E is

Desert King Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 19501   Accepted: 5446 Description David the Great has just become the king of a desert country

Problem I Teen Girl Squad  Input: Standard Input Output: Standard Output   -- 3 spring rolls please. -- MSG'D!! -- Oh! My stomach lining! Strong Bad You are part of a grou

The 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-seaso

In response to a request by the SWERC 2010 problem-setting team, a sensor network has just been installed in the headquarters. The organizing committee has put in the problem-setters the disproporti

Problem C: Arctic NetworkThe Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establ

Heavy Cargo  Big Johnsson Trucks Inc. is a company specialized in manufacturing big trucks. Their latest model, the Godzilla V12, is so big that the amount of cargo you can transport with it is nev

Problem F: Heavy Cycle Edges Given an undirected graph with edge weights, a minimum spanning tree is a subset of edges of minimum total weight such that any two nodes are connected by some path con

Problem A ACM contest and Blackout   In order to prepare the “The First National ACM School Contest”(in 20??) the major of the city decided to provide all the schools with a reliable source of powe

Genghis Khan( )(1162-1227), also known by his birth name Temujin( ) and temple name Taizu( ), was the founder of the Mongol Empire and the greatest conqueror in Chinese history. After uniting many