OJ Board

I have got many wa on this problem. I have test that there is node which height in zero in the input ,but it says it gives the height of each non leaf node

how to deal with these test cases,btw I think this is invalid test case.

problem description said: "It is guaranteed that the result will be a finite number, and its integer part will not exceed 10 digits" but in the fifth examples 15822384813181.61872382001683484036 obviosly exceding 10 digits there are 14 digits in integer part " what is correct range of...

seems test cases are wrong,I have check this test from udebug: 1 100 100 3 68 35 1 59 63 3 6 46 3 96 43 1 37 92 1 3 54 3 19 96 3 27 72 1 70 13 3 100 36 1 4 12 3 34 74 3 42 12 3 69 48 3 63 58 1 60 24 1 30 79 1 89 7 3 30 71 3 7 2 1 49 30 3 85 55 1 41 67 3 32 9 1 40 27 3 83 30 3 34 16 1 78 7 3 87 22 3 ...

can you send me data case of this problem?(441766573@qq.com)
this problem is not so hard(0 AC)

Hi,admins, is data case of this problem correct? My code has been accepted in codeforces gym(345 testcases) but WA 0ms, seems it is not normal wa...(hope admin not throwout test data because offical test data has already became a lot of loopholes)

I have constraint on the upperbound of lcm of answer's denominator (1300*b),so I'm not sure if my code is real correct,here are some test data: 111 94 227 0 Case 1: 94/227=1/3+1/15+1/71+1/80585 94 227 1 3 Case 2: 94/227=1/4+1/9+1/19+1/4313+1/8172 94 227 2 3 4 Case 3: 94/227=1/5+1/6+1/30+1/71+1/80585...

the data set in the description "For example, if we can't use 2~6, the best solution is:2/3=1/7+1/8+1/9+1/12+1/14+1/18+1/24+1/28" is wrong,the correct answer is 2/3=1/7+1/9+1/10+1/12+1/14+1/15+1/18+1/28,I have checked this answer is correct... by the way,I don't think 15s for 100 test case...

Hope admin can add all offical tests,I got this problem accepted on codeforces gym, the test cases are stronger,but I don't think
6s for each test case is good,because O(n*m) brute force algorithm can run to test case 28....(32 cases in total) I want to test some other solution if it is strong enough

thank you and admins..

I think test cases for this problem is too weak,I write a weak solution,and got accepted ,but when I randomly test some official
test cases, my solution is wrong.... Hope admin can get test cases stronger

now I'm sure there are some unexpected characters in the input file including some spaces and other characters. I hope admin can corrected the test cases..

I think there is something wrong with data set, my code will run about 10s for all test cases in my own computer,but when I submit it wa in 20ms.....

Does the graph guarantee to be a cactus (every edge belongs to exactly one polygon).
if it is not,it will be too hard to deal with. even it is hard to write a checker to judge if it is...