UVa OJ Board

I am aware that there can be more than one correct minimum sequence. However, my code is not even trying to find correct sequences. It just outputs the correct k, followed by the sorted input with each bag dimension on a separate line. This is obviously wrong, yet it gets AC...

OJ gave me AC although I sent incorrect code! It seems to only check the correctness of k (the minimum number of pieces), but does not care much for the format of the k sequences. Here's the code that got AC: #include <iostream> using namespace std; int a[10000]; int b[10000]; int last = 9999; int L...

mine failed this case at first:

. . . . . . . .
. . . . . . . .
. . . k . . . .
. . . . . . . .
. B . R . . . .
. . . . . . . .
. . . . . . . .
. K . . . . . .

because i had output for both B and R.
just had to add a couple of break statements and got AC!

i can't think of a possible special case... also if i input 34.64 34.64 34.64 should i get 10.000 or 10? #include <iostream.h> #include <math.h> void main() { long double a, b, c; while(cin>>a>>b>>c) { long double p = (a + b + c)/2; long double temp = p*(p-a)*(p-b)*(p-c); long double s = sqrtl(temp)...

Hello, I am certain that I have solved problem 108 in Java but the online judge keeps saying that I have Wrong Answer. Could this be caused by the fact that at the end of my output I have the standart Java message "Press any key to continue..."? If yes, could you please give me a hint how to avoid t...