HDU 多校1.3

时间：2017-07-25 13:36:32 阅读：142 评论：0 收藏：0 [点我收藏+]

Colorful Tree

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 0 Accepted Submission(s): 0

Problem Description

There is a tree with

Input

The input contains multiple test cases.

For each test case, the first line contains one positive integers

Output

For each test case, output "Case #" in one line (without quotes), where

Sample Input

3 1 2 1 1 2 2 3 6 1 2 1 3 2 1 1 2 1 3 2 4 2 5 3 6

Sample Output

Case #1: 6 Case #2: 29

原文地址：http://www.cnblogs.com/Roni-i/p/7233425.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

周排行