Search found 5 matches
- Mon Aug 15, 2005 11:08 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10169 - Urn-ball Probabilities !
- Replies: 9
- Views: 4082
is the the judge's output fixed ? The problem seems very easy. I checked all my solutions with Mathematica and they are exactly the same. I can not understand how it comes WA. I assumed that the input '0' is not legal. If it is this my mistake, what should be the output? Thx in advance for any reply.
- Sat Jun 25, 2005 11:19 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10800 - Not That Kind of Graph
- Replies: 48
- Views: 23297
- Sat Jun 25, 2005 3:24 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10800 - Not That Kind of Graph
- Replies: 48
- Views: 23297
Thanks for the help Raj. Still it seems that my code reacts normally. I would apreciate if someone could take a look at my code: #include <iostream> #include <fstream> using namespace std ; int main(){ size_t l , ln ; char instr[55]={' '} , graph[55][110] = {' '} , line[55]={' '}; int cases , nr=1 ,...
- Fri Jun 24, 2005 11:22 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10800 - Not That Kind of Graph
- Replies: 48
- Views: 23297
- Tue Jun 07, 2005 2:46 pm
- Forum: Volume 1 (100-199)
- Topic: 116 - Unidirectional TSP
- Replies: 226
- Views: 42585
I am getting also WA in probllem 116 . I didn't understand if the lexicographic order should be acording to the values or acording to the string (10 is before 2<=x<=9 ? ) If someone can have a look to the following code : (I assume that the order is acording to the value) #include <iostream> #includ...