## Search found 11 matches

- Sun Oct 16, 2005 9:22 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10056 - What is the Probability ?
- Replies:
**26** - Views:
**9049**

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...

- Sun Oct 16, 2005 6:32 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10056 - What is the Probability ?
- Replies:
**26** - Views:
**9049**

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...

- Sun Oct 16, 2005 12:34 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10056 - What is the Probability ?
- Replies:
**26** - Views:
**9049**

- Sun Oct 09, 2005 3:12 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10435 - Compare Directories
- Replies:
**10** - Views:
**5177**

- Mon Mar 28, 2005 5:31 pm
- Forum: Volume 7 (700-799)
- Topic: 769 - Magic of David Copperfield
- Replies:
**3** - Views:
**1914**

- Wed Mar 09, 2005 10:01 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10824 - Regular Polygon
- Replies:
**20** - Views:
**10213**

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 ...

- Sat Nov 13, 2004 7:26 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10768 - Planarity
- Replies:
**19** - Views:
**4994**

### Re: 10768 Planarity -- what am I doing wrong?

... 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...

- Sat Apr 17, 2004 4:12 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10435 - Compare Directories
- Replies:
**10** - Views:
**5177**

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 &qu...

- Thu Apr 15, 2004 5:44 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10435 - Compare Directories
- Replies:
**10** - Views:
**5177**

- Sun Apr 11, 2004 6:41 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10435 - Compare Directories
- Replies:
**10** - Views:
**5177**

- Mon Mar 29, 2004 4:26 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10435 - Compare Directories
- Replies:
**10** - Views:
**5177**

### 10435 - Compare Directories

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...