Problem statement: http://mirror.codeforces.com/contest/1155/problem/B My code: http://mirror.codeforces.com/contest/1155/submission/53187901 I am getting the wrong answer for test case 90. But the input is very big. Unable to test it. Could someone provide a small test case for which my code gets the Wrong answer? I tried for a couple of hours but failed. Thanks.

Hi, I am facing confusion about this 142D - Help Shrek and Donkey 2 From the editorial I understood that the answer will be "First" for the following input. But I could not make the First person win manually. Could anyone please tell the steps to win for the "First" person or I have wrong understanding. Here is the input:

2 6 1
G--R--
G----R

In some contest, there is some string related problem. Many authors use hashing algorithm to make the solution faster. When string length is so small that hash value does not overflow, then I have no question. But when string length is too big to hash value is over flow, then how solution gives guarantee that there is no hash value of two different string is unique.

Can anyone clarify it please?

Thanks.

The problem link http://www.codeforces.com/contest/73/problem/B

Consider this sample input:

3

teama 1

teamb 20

teamc 10

3

17 29 35

teama

In the custom test I ran sohelH’s code for the above input which was Accepted in the contest. It gives 3 3 as output.

But when I ran some others( hos.lyric code) Accepted code for the above input. It gives 2 3 as output.

Why Div2 coders are registering in Div1. But It said it is Only Div 1.

In the problem statement it is said that length of roads will be maximum 1000.