UVa OJ Board

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

Pleas can you kindly edit the message that shows the answer to 1000.

It makes the board wideeeeeeeeeeeeeeeer and it doesnt look right.

I havent seen your code.

But this happen when you use the readline provided in the instruction page. This readline doesnt handle right the last line and when there are more than one line between the data.

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

What happen with the compiler upgrade?

Nobody talks about that in the board anymore. The upgrade is going to take place or just was a idea that can't be implemented.

I has not solved this problem but from the problem statement i cant asure that the cities are numered sequentially 1, 2, ..., n. Maybe some data set could be 1, 2, 6, 12, maybe not. But the problem statement leave the second posibility open so you shuld take care of.

Your problem its that your class name is not called Main. You shuld read the info about java suport.

Hope can help

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

It would be nice to add this feature.

It is really useful.

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

arc16 wrote:I'm getting TLE by using DFS.
Is there any faster method?

I think that this problem can be solved using DP. And i think that DP is a LOT more efficient that DFS.

Hope this can help.

Some test cases to think about it.

I am tired of problem whose data sets does not correspond to the problem description. This is one of them.

Forget this sentence in the problem statement if you want to solve this problem.

No three points are aligned in any polygon.

Hope this can help.

I think that a lot more people would use it here if it would have been properly supported. I am totally agree with you and i am fighting for that. Thats why i dont change the language. I prefer to fight to get my Language of choice properly configured here. Good Luck in your migration ... 8)

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