OJ Board

I can't see any error, the only difference is that I use long double, but I think this should not be a problem #include <iostream> #include <iomanip> using namespace std; long double pawah( long double b, int e ) { long double r = 1.0; for( int i = 0; i < e; i++ ) r *= b; return r; } int main() { co...

First, if the probability is zero, then the answer is zero also. If not, for the player k to get success, the first k-1 should fail ( probability (1-p)^(k-1) ) and k should get success ( probability p ) or the n players have to fail ( probability (1-p)^n ) and then another time k-1 fails and a succe...

Just got AC, but my program gives slightly different output:

0.0100
0.0100
0.0010
0.0000
0.1667
0.0290

I did not implement the LCS thing in this problem, I just ignored the sentence "You must use longest common subsequences of the file names in the two directory content to get common file names.". I don't know why the problemsetter put it in the problem description.

What about these ones? I get WA

n=2:
5 1
7 2 3

n=3:
7 1
9 2 4
11 3 5 7
13 6 8

n=4:
9 1
11 2 5
13 3 6 9
15 4 7 10 13
17 8 11 14
19 12 15

Hi! I am trying to solve this problem but only obtain WA. I sorted the points by their angle and searched the candidates to form the polygon using lower_bound(). I think this should be correct but I always get WA. I generated an input with points of the form (cos(2*PI/2000.0), sin(2*PI/2000.0)) and ...

... An example on where's the difference: Let N=9. Make a K_5 on vertices 1,2,3,4,5. Delete the edge 4-5. Add edges 4-6, 5-6. Make a K_4 on vertices 6,7,8,9. This graph cannot be reduced and thus it is NOT homeomorphic to any graph containing K_5 or K_{3,3}. But it's subgraph (induced by vertices 1...

Also I want to say that my AC prog gives different output to this case, so if someone is trying to do this problem don't try to get same output to this case (cases in the judge have the common FileObjects in the same order) ==== Begin of Comparison ==== Transaction #1 : Date 10728j2002 Comparing "/C...

I finally got Accepted P.E. :P I was comparing all the common subdirs and after reporting file size mismatch (I thougth they wanted this by this way as the problem says: "If both have a common directory descend in that directory, with `tab'+1 and start comparing." so I searched for common dirs befor...

my output is: ==== Begin of Comparison ==== Transaction #1 : Date 10728j2002 Comparing "/CDrive/ACMHelper" with "/tmp/Helper". Comparing "/CDrive/ACMHelper/booo" with "/tmp/Helper/booo". No difference. No difference. Transaction #2 : Date 10asdhj2002 Comparing "/CDrive/ACMHelper" with "/tmp/Helper"....

I tried to do this problem that only 5 people have done so far and I am getting WA over and over. I made it in C++ and in Java, and both pass the public test but get WA. Could someone please give me any hint on where may I be making a mistake or some other input/output test to check? I think I can b...