OJ Board

Seriously, man, I hate these precision problems
Thank you, suneast. Got AC after printing doubles properly.

Can somebody help me with this? Here is some I/O from my WA program: Input 3.141592654 00000000001 1000.000000 999.9999999 -2.00000000 -0.11111111 0.000000000 123456789 984.12331 33.000000 Output Input : 3.141592654 1 : 3.141592920 = 355 / 113 2 : 3.141630901 = 732 / 233 3 : 3.141552511 = 688 / 219 ...

Thank you, Observer. Very good point.
I didn't know children could be so smart at guessing games. AC after fixing that.

C: Yes the statement is long... but this may be the easiest problem in the whole set~ It must be, but I can't get it right. Can you give me the output for: 36 15 49 18 100 10 Mine is: 1? - CLOSER 36? - FARTHER 2? - CLOSER 26? - SAME 13? - CLOSER 19? - FARTHER 3? - CLOSER 30? - FARTHER 4? - CLOSER 2...

There's something weird about this problem. After getting WA I went to the UVA toolkit site and checked several queries to see what my mistake was. This is what I found: Input: q 39283 q 39284 My output: 200580 200584 UVA Toolkit output: 200580 200593 It turns out that reversed prime no. 39283 is 70...

For those stuck in this problem: The input file will contain several lines of inputs. Each line contains non-negative integers R(R<=10000) and N (1<=N<=100) as described before. Input is terminated by end of file. It's quite obvious that N is positive but what about R? Do you handle R=0? Well, I did...

After several tries, I finally found this random test case: 12 A B C D E F G H I J K L 10 9 12 4 5 2 6 3 8 1 7 11 1 7 2 11 4 3 12 10 8 6 9 5 7 10 11 8 6 2 5 1 12 3 4 9 10 4 9 6 12 1 11 8 5 3 2 7 1 4 6 12 2 11 8 10 7 5 3 9 8 4 9 3 11 7 12 2 5 10 1 6 4 1 7 5 9 12 3 6 8 10 11 2 9 6 12 3 1 11 8 2 7 10 5...

Hi all.... My algorithm is: 1) Run DFS(0) if there is a cycle then calculate the total cost of the cycle. if it is negative return What is the problem i got TLE.... I also used this approach at first. But then I came up with this test case: 1 4 6 0 1 10 1 2 20 2 3 30 3 1 50 3 0 15 0 2 -46 Here, the...

Thanks sohel. Very useful tool. I managed to find an error: I wasn't marking all the new eliminated candidates before giving away their ballots, so I could give a ballot to a candidate who was going to be eliminated later in the same iteration :oops: Anyway, I'm still getting WA, don't know why and ...

Hi everybody I've been trying to get this problem AC for a few days now and there is no way. My solution is really simple, as I think the problem is too, but no matter how hard I try I can't find out what I'm doing wrong. What if there's no ballots? I guess all the candidates tie with 0 votes and yo...

My output is the same as LayCurse for (2,0), that is, 13322980 + 18554528
I don't think the i/o is wrong, otherwise it couldn't have been solved by Alberto.

Thanks Jan for the I/O files. They really helped me a lot!
However, I must say that my AC program doesn't produce *exactly* the same output as the sample output file, so it's not necessary to make them match perfectly. You can use them as a guide, though.

I tried this problem a few weeks ago. Same problem.

I'm also stuck with this problem. I have dozens of WA's and my algorithm is just a simple backtracking. Anyone have got AC in the last few months? The success rate for this problem is surprisingly low for such an easy task.

P.S.: I've tried float, double and long double

Hi guys, Don't know if i'm the only one that think like this but, anyway, i must say it! The new system is up for almost a year now and we haven't seen any of the "amazing" features devised for it yet. I was wondering if the OJ site is still under development or if it's frozen for some rea...