OJ Board

My AC program's output is the same...

I just test all a+b when a!=b why a!=b ?? test all a+b when a and b are in different lines (but this is not very fast solution) for this input data: 2 4 4 1 8 0 output should be: Case 1: Closest sum to 8 is 8. while yours is: Case 1: Closest sum to 8 is 0 because in this case you never execute the ...

Consider this input: 7 13 19 29 86 73 11 53 4 87 92 43 120 0 your program gives: Case 1: Closest sum to 87 is 84. Closest sum to 92 is 97. Closest sum to 43 is 40. Closest sum to 120 is 126. and my AC program gives something else: Case 1: Closest sum to 87 is 86. Closest sum to 92 is 92. Closest sum...

Hi, these are my sample input/output: input: 0 -10 0 -5 0 -1 0 1 0 5 0 10 1 0 1 -1 1 1 1 -2 1 2 2 -4 2 -3 2 -2 2 -1 2 0 2 1 2 2 2 3 2 4 3 -8 3 -7 3 -6 3 -5 3 -4 3 -3 3 -2 3 -1 3 0 3 1 3 2 3 3 3 4 3 5 3 6 3 7 3 8 12 -18 13 15 18 29 25 -25 80 17 80 1 80 2 100 2 100 3 100 11 100 -1 100 1 0 0 my output:...

So I'am wrong.
I submitted my program (using C function log()) with many different floating point correction and without any correction and it always got WA. Then I only changed log() to log10() and it recived Accepted (without any special correction). Strange...

Hi, I used sum of logarithms to find how many digits the factorial has and used the formula: log_a(b) = log_c(b) / log_c(a) where log_x(y) is the logarithm of y relative to the base x you can use any c > 0, c != 1 to find a logarithm of b to the "strange" base a. program which uses natural logarithm...

argh! stupid bug in the code which given coordinates of three non-colinear points finds the center of the circle passing through them...

thanks for help

Nick, your answer is wrong for 14: 4 6 8 10 12 14 2 13 1 3 5 7 9 11 I am convinced that there is some general pattern for the case n = 6K+2 or 6K+3 , seeing the very low runtimes. I can't see it yet. All the answers that are not of the form 6k+2 or 6k+3 can be very simple with property of rotational...

Yes it is wrong for 14 and 15!
But it does not change the fact that there still is a very simple pattern
I have it accepted now thanks for help...

there is a very simple pattern input: 3 4 5 6 7 8 9 10 11 12 13 14 15 output: Impossible 2 4 1 3 2 4 1 3 5 2 4 6 1 3 5 2 4 6 1 3 5 7 4 6 8 2 7 1 3 5 4 6 8 2 7 1 3 5 9 2 4 6 8 10 1 3 5 7 9 2 4 6 8 10 1 3 5 7 9 11 2 4 6 8 10 12 1 3 5 7 9 11 2 4 6 8 10 12 1 3 5 7 9 11 13 4 6 8 10 12 14 2 13 1 3 5 7 9 1...

Can anyone who got accepted confirm this input/output? input: 1 2 2 0.0 2 5 1 -3 4 4.2720018 2 5 1 -3 4 4.2720019 3 -2 -1 -3 -1 -3 -4 1.5811 3 -2 -1 -3 -1 -3 -4 1.5812 4 0 0 1 2 2 4 3 6 3.354101 4 0 0 1 2 2 4 3 6 3.354102 10 37 -84 -93 -93 33 -19 -36 89 -39 -61 -51 -48 -45 30 32 30 -70 -97 -47 9 120...

above output is incorrect, and this is correct:

correct output:

1 16 2 3 4 9 10 11 17 12 13 6 14 5 7 15 8

1 2 6 7 8 3 4 5

Round trip does not exist.

10 2 1 3 4 5 7 11 12 8 6 9 13 18 14 15 16 21 17 20 22 23 19 24 27 30 32 28 29 31 33 35 25 26 37 34 36

Hi, is something wrong with my program's output for this input? input: 2 4 3 2 4 4 2 1 1 1 4 2 2 3 5 3 4 6 2 5 7 2 5 8 4 6 9 5 5 15 1 1 16 3 3 14 6 6 17 7 4 13 6 7 10 7 6 11 6 7 12 0 0 2 1 3 2 2 2 2 2 6 2 2 7 2 2 8 1 1 4 1 2 1 1 1 5 0 0 2 1 3 2 2 2 2 2 6 2 1 7 2 2 8 1 1 4 1 2 1 1 1 5 0 0 1 2 16 2 1 ...