OJ Board

My expericence is that the output speed is the single hugest disadvantage. Most other difficulties can be overcome, easily or not quite easily. There have been 10+ problems so far that I couldn't solve in Java because of the output speed. In most cases, the results are ready in less than 2 seconds, ...

Most likely you got an exception in this part. You can use "try catch" to verify this.

Your method works! Thanks!

It sounds like inner classes can be used in Java submission, but I always got compile error whenever I used them(and the code compiled perfectly on my local machine).

Has anyone successfully submitted Java code with inner classes? If so, could you please give a outline on how you did that? Thanks.

The variable count will always be 0, can you see why?

Most likely there is also a double precision issue. Try adding an EPS to the int cast.

Looks like these two bugs together get you passed the test cases above.

Just FYI. While the problem states that For each table, a line will give an integer t, between 3 and 50, indicating the number of legs on the table. t subsequent lines will give, in order around the table's circumference, the lengths of the legs in millimeters. it doesn't mean that each line only ha...

Just wanna point out that the input of this problem contains blank lines. This is DISGUSTING considering the problem statement. Now you know why if you are so sure about your program but still keep getting WA.

Good to know that it finally works for you. Actually I was doing it the other way around. I used int everywhere. It is always safer to work with integers. Now you mentioned it, I managed to get your original version passed with one modification(and the '=' of course). [cpp] for (x=0; x<num; x++) { d...

The algorithm itself is fine. I just got AC with it. The problem must be in the I/O part. I am not quite familiar with c++ so I am not sure here. You do need to put a '0' there for less than 1 dollar. Try long long data type.

Actually I mean {0.01, 0.03, 0.03}, i.e. a case in which round = true and all element above average = total + 1. If your current version looks like this, it should be fine. I tried this(not exactly the same) and passed. Please post the new version if there are still problems. [cpp] for (x=0; x<vecF....

I think {1, 3, 3} will break your program. Looks like you put negative amount in the pile sometimes. Other than that it looks fine.

Basically, given the total cost and the 'within one cent' rule, you know what the final cost distribution should be. To minimize the exchange, try to choose the cost closer to the actual cost. However, this is not always possible, so choose high if start high, choose low if start low....

About problem #10170, I tried both binary search and direct attack as shown below. However, the binary search method got WA, while direct attack passed. I generated > 20 million random test cases(using the limitation in the problem) and always got the same result. Any idea what might be wrong? Anybo...