OJ Board

I am getting WA for this problem :( . Could anyone can help me by some critical input/output?? I also mention my code here; If can, then check it up: #include<cstdio> #include<cmath> #include<cstdlib> #include<cstring> #include<string> #include<iostream> #include<map> using namespace std; #define MA...

I am getting WA. I test my code for all input from forum & it gives correct answer. Can anyone give me some tricky input/output for which my code fail?? Here is my code: //Problem no: 11048 Automatic correction of misspellings #include<cstdio> #include<cmath> #include<cstdlib> #include<cstring> #inc...

I can't understand many of this board tell that prim's algo might give WA for this problem. How is it possible, where Kruskal works but prim's not! It is impossible that, for a graph, Prim's give different result than Kruskal. Both are ok.
I just solve this problem using exactly Prim's Algorithm.

Test this input: 5 12 12 12 12 45 45 45 45 45 12 45 12 45 12 45 12 1 2 3 6 4 7 8 9 12 45 89 78 12 45 89 78 1 1 2 2 3 3 6 6 Correct output should be: INTERSECTING LINES OUTPUT LINE LINE POINT 3.33 6.67 LINE LINE END OF OUTPUT But you program gives the output: INTERSECTING LINES OUTPUT NONE LINE LINE ...

AcmNightivy wrote: it is enough to check- Code: a1/a2==b1/b2 && b1/b2==c1/c2 BUT its not right for all time. So i need to check that-Code: a1/a2==b1/b2 && b1/b2==c1/c2 && a1/a2==c1/c2 Why?Thx`` well, check your code putting a1/a2==b1/b2 && b1/b2==c1/c2 formula for this input- 1 1 0 1 1 2 0 2 1 Corre...

Thanks everyone for helping. Now i get AC. Actually, "eps" has no affect on this problem. But i think, its a good programming habit to use it. The only problem in my code was that, i thought that, for checking the formula- a1/a2 = b1/b2 = c1/c2 it is enough to check- a1/a2==b1/b2 && b1/b2==c1/c2 BUT...

I've changed my code as you say, (updated code has posted in previous post), but i am still getting WA!!
plz check carefully....

Hmm...You catch a good part for which someone might get WA. But after solving this, i am getting WA again. only the improvement is that, before doing this correction, ACM says- Your program has not solved the problem. It ran during 0.002 seconds. & after correction it show- Your program has not solv...

I become tired getting WA from this problem . I test all the SAMPLE I/o from forum, my program show Correct Answer. But whats happen to UVA???
plz help....if can give some sample I/O for which my code show WA

I have done this problem; it show right answer for all testing input. But when i submit it, it show output limit exceed!
why?
Please help me or give me some test input&output

Ohh...I really do a silly mistake. Its only the spelling mistake of "bulukulu" >> "buluculu"!
Okk......thanks everyone for helping.

But in the problem, its said that-

[quote]All the years will not be less than 2000 (to avoid the earlier different rules for leap years). Please don

I have do this problem and test it for all possible output from forum. It work here.
But when, i submit this in ACM, it show wrong answer .
Why???
Can anyone help me?

I haven't prove it,
i say that, it has already proved by nature.
ok???

please everyone, read carefully when u read any post.
or else always missing something....

Your quote: Mr oronno i kow your code is inside of a loop. but there is a missing of some important codes.you forgot to define a macro try to visualize it deeply. No, mr. Newton, i havenot forget anything, but i think you forget to read my post fully. Bcoz, here, i say that, (note: don't compare thi...