OJ Board

Guys, I need help. My ideal code is getting WA :D. For test case: 300.00 0.00 It gives: 300.00 23123301210317 But AC answer (got from uDebug): 300.00 181490736388615 I checked 181490736388615 < 2^64-1 Here it is: Deleted (Because of AC) Updated: Fixed error, all problem was in convertion from float ...

Good day! I think this problem is solvable with careful bruteforce. We have 3 equations, but there is also another restriction, it is x < y < z. That is why, test 1 3 1 3 must be answered: No solution. From the third equation we can make conclusion that, range of variables' values is [-100, 100]. If...

jddantes, here you can find analysis of this problem http://uvaanalysis.blogspot.ru/p/the-bug.html
There are also tips for WA cases.

For this test case Solution's out is:

Help, I'm getting WA. My solution's strategy is this: group edges with same weights. After that, add heaviest edges. Count sizes of newly formed connected components. Do the same for all edge groups from heaviest to lightest. For test cases in the statement I got the same output, but my solution is ...

I can't even suggest any solution . Any ideas?

jishnu1 , I don't know what test case will break your solution, I can give you my code of solution, and you might generate outputs from it and compare them with your solution outs. #include <iostream> using namespace std; int M, N; int a[ 101 ][ 101 ]; int s[ 101 ][ 101 ]; void count_s() { int i, j...

Rafiq123, explain your code. And take it into code area with tags.
Try to use sets not map

Correct your output code to printf("%d\n", maxSubRectz);
and you have errors in your code.

Hi. I think that firstly when you submit your solution to judge, it tests your solution. And if you got AC then judge will measure runtime to give you rank. So, if you want get top ranks, you should write AC and fast code. I want to say that program runtime is not important. When you are in competit...

felix.halim@gmail.com?

I had been thinking a long about posting this topic in this group. The question: How to get uHunt code to sign in to uHunt chatroom? When you press "sign in", you get a message about how to get uHunt code. I sent email to uhunt@felix-halim.net, with subject "generate-code" at abo...

problem is not in problem. I need help to count complexity of algorithms

Hi! Yesterday I have been solving 10110 problem and had wrote this algorithm, the math model of the problem is very simple, solution is: if the number of dividers of number is even then we have to print "no", if odd we have to print "yes": Here is solution of problem, how did I s...

I corrected this but still getting WA. :D #include <stdio.h> #include <ctype.h> #define MAXX 252 #define MAXY 252 #define CREATE_IMAGE 'I' #define CLEAR_IMAGE 'C' #define DRAW_PIXEL 'L' #define DRAW_VLINE 'V' #define DRAW_HLINE 'H' #define DRAW_FREC 'K' #define FILL 'F' #define SAVE_IMAGE 'S' #defin...