[Home|Training|Problems|Contests|C Language] | [Login|Register] |

Problems Status Rank |
Problem 1285
Oh my dear trees
Time Limit: 3000ms
Memory Limit: 65536kb Description
Given a weighted graph
This problem requires you to find a spanning tree Input
The input contains multiple test cases. Each test case begins with a line containing two integers The input ends with It is guaranteed that the spanning tree always exists. Output
For each test case, output the minimum variance after “ Sample Input
4 5 1 2 1 2 3 2 3 4 2 4 1 1 2 4 3 4 6 1 2 1 2 3 2 3 4 3 4 1 1 2 4 3 1 3 3 0 0 Sample Output
Case 1: 0.22 Case 2: 0.00 |

University of Science and Technology of China

Online Judge for ACM/ICPC

Processed in 1.5ms with 1 query(s).

Online Judge for ACM/ICPC

Processed in 1.5ms with 1 query(s).