OJ Board

Thanks, Shafaet...
I thought last event is the event of death... that's why I couldn't get 7 as the ans Now, I read the problem statement again and got the idea that more than one event can be counted as death... will try to solve it soon.

As some posters said that it is possible to get AC with stl set. I am getting tle... I wonder how they did that...

I am also using a 6-D DP. I believe my code is okay. But, I am getting WA. Some additional IO is highly appreciated.

Thanks.

[EDIT: ]Initialization part had a flaw. AC now

I am getting RE. I am using Java BigInteger class. What can go wrong? I am quite confident that my implementation is correct.

For no. of stations, s = 1 and no. of connections, c = 0; you have to output 0.

I think, the answer is: summation of k * nCk for k = 1 ... n [nCk = n Choose k]
Can someone tell me how to get a closed form?

Thank you sakhassan. It really helps

Is it DP? How do you people solve this?

@Shiplu: Thanks very much.

@shiplu:

Can you elaborate? Thanks in advance.

I have used a simple memoization but getting WA. Can you give me some sample IO?

Thanks in advance.

I want a working code snippet with priority queue of java which takes a double array ... I am interested in insert and retrieval oprerations... I need to know how this class works... and I am not a Java guy. Thanks in advance.

To greve, Its a very useful site you 've there... Thanks.

Joy, you can overwrite some positions in the following code fragment...

Since a new quick submit button has been added, it is possible to submit any problem without going to that problem in the volume. Is it now possible to allow the problem volumes to be downloaded as it was for previous judge?