I dont know why are you reading the input like you do it.
I believe that its easier to read it like this
int n = Integer.parseInt(ReadLn(255).trim());
Where ReadLn is the method that you find here http://acm.uva.es/problemset/data/p100.java.html
Hope it helps
Search found 56 matches
- Mon Oct 28, 2002 4:29 am
- Forum: Volume 103 (10300-10399)
- Topic: 10303 - How Many Trees?
- Replies: 19
- Views: 3523
- Mon Oct 28, 2002 4:25 am
- Forum: C
- Topic: Unbelievable
- Replies: 1
- Views: 2155
- Mon Oct 21, 2002 2:23 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10332 - The Absent Minded Professor
- Replies: 22
- Views: 7198
Its C++ corner. not to bother for ur JAVA Stupid!!!!!!!!!! :evil: Wow. This is what we need in our world: People that ofend others when they are asking for help. Maybe cothevacothe ask the question in the wrong thread but this is not excuse to be irrespectful to him. Thanxs for ALL your help Jalal ...
- Sat Oct 19, 2002 5:05 am
- Forum: Other words
- Topic: About new incoming features
- Replies: 47
- Views: 28979
- Tue Oct 08, 2002 4:49 am
- Forum: Volume 103 (10300-10399)
- Topic: 10308 - Roads in the North
- Replies: 30
- Views: 10478
- Mon Oct 07, 2002 5:38 am
- Forum: Other words
- Topic: compile error
- Replies: 10
- Views: 3733
- Fri Sep 27, 2002 1:25 am
- Forum: Volume 100 (10000-10099)
- Topic: 10091 - The Valentine's Day
- Replies: 12
- Views: 4061
10091 - The Valentine's Day
Hi everybody. I try to solve this problem and i just get WA's. I think that this is a easy problem. I simulate month by month to get all the probabilities of every node at the end (This is done with each person). Later i get the probability that Bill and Marsha encounter in any node. Is my approach ...
- Wed Sep 25, 2002 3:40 pm
- Forum: Other words
- Topic: Ranklist for people from one country
- Replies: 3
- Views: 1748
- Fri Sep 20, 2002 11:44 am
- Forum: Volume 103 (10300-10399)
- Topic: 10342 - Always Late
- Replies: 25
- Views: 11712
10342 - Always Late
Hi I am trying to solve this problem but i have some problems, so i want to make sure that my understanding of the problem is correct. I just want to ask if there is a minimum path from a to b with cost c and exist another path from a to b with the same cost c. My question is: the path that must be ...
- Thu Sep 19, 2002 5:33 pm
- Forum: Volume 1 (100-199)
- Topic: 116 - Unidirectional TSP
- Replies: 226
- Views: 42538
- Thu Sep 19, 2002 5:14 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10002 - Center of Masses
- Replies: 59
- Views: 27794
Some test cases to think about it.
Code: Select all
Input
4
1 1
1 3
3 1
1 2
Output
1.667 1.667
- Thu Sep 19, 2002 5:06 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10002 - Center of Masses
- Replies: 59
- Views: 27794
- Wed Sep 18, 2002 11:20 pm
- Forum: Java
- Topic: What the fuck...
- Replies: 11
- Views: 7852
- Wed Sep 18, 2002 6:53 pm
- Forum: Java
- Topic: What the fuck...
- Replies: 11
- Views: 7852
About the discussion about the best teams in the world i think that those teams are good in more than one language. The ACM competitions is about solving problems and the language it is just a tool to the final purpose. So if somebody is capable to do it with one tool it is just a matter of learn to...