OJ Board

Well, UCS stands for Uniform Cost Search and is a graph search algorithm just like BFS (Breadth First Search) but with keeping cost in mind. So it's just like BFS but with a difference that it does not expand the shallowest node, but it expands the node with the lowest cost. I don't have any impleme...

Well, I changed my code to this, still WA! long double newComb(long double oldLog, int n, int i) { if(i == 0) return log(1.0); if((n + 1 - i) == 0) return log(1.0); long double log2 = log((long double)(i)); long double log1 = log((long double)(n + 1 - i)); long double newLog = oldLog + log1 - log2; ...

Well, I managed to convert the formula to this format:
result = Sigma exp(log(a) + log(nCi) - (n * pow(2.0))
It works really great for positive numbers, but when it comes to negative numbers, program fails (because of log(a) part).
Any suggestions?

And how could I do that?

Hi, I've read these posts and came with a solution, but I have a minor problem with the 2 ^ n part. Could you please take a look at my code and help me? Thanks in advance. #include <iostream> #include <cmath> using namespace std; double arr[50000]; int n; long double newComb(long double oldCm, int n...

Of course the problem is wrong! It says "Any solution that satisfies these criteria will be accepted" but its really obvious that it doesn't. I think instead of checking the answer with a program, the judge test your answer with a pre-defined answer that has this priority MATCH-INSERT-DELETE!

Thanks alot.
Now I get my WA!!! )

Well, ok.
Here's my code.

Hi guys. Well, I have a problem. In many of my codes when I use the sort function on a 'user defined' data structure (struct) I get a compilation error from judge!! Why is this happening? I wrote many codes with this feature and I cannot write them again. here is a part of the code that I get Compil...

I am getting WA too, and my algorithm is pretty much the same as yours. I debugged my program and it works as expected but I don't know why I am getting WA! I think there is some critical inputs because I am sure this is the right algorithm. If anyone has some critical inputs please post it. If you ...

Thx alot. I tested my program and here's the bug. I used int for my bigmod function, but turns out that it's not enough. I just used long long and everything worked just fine. Now I got AC.

well, first of all thanks for your help. I finally understand the problem. I just don't know how I get WA!!! Because I'm almost sure I've done anything OK. I've checked my output format and its OK too. Here's my Fermat function. Removed after AC! If there is ANYTHING wrong with it please let me know...

I can't understand the problem. Why 17 is Normal? 2^17 mod 17 = 2 3^17 mod 17 = 3 4^17 mod 17 = 4 5^17 mod 17 = 5 6^17 mod 17 = 6 7^17 mod 17 = 7 8^17 mod 17 = 8 9^17 mod 17 = 9 10^17 mod 17 = 10 11^17 mod 17 = 11 12^17 mod 17 = 12 13^17 mod 17 = 13 14^17 mod 17 = 14 15^17 mod 17 = 15 16^17 mod 17 =...

Well, as I said, I tried both ways and all got WA!
Please tell me what is wrong. I checked all possible ways for input and output. All works.

Well, I fixed all of that. Still WA. Here's the new code. One thing I don't know is this: I should print a new line after each number and print another one between cases? (One blank line between cases and a new line after each test) or I should print just a blank line between each test case. for exa...