Search found 149 matches

by nymo
Thu Jun 30, 2011 2:39 pm
Forum: Volume 9 (900-999)
Topic: 988 - Many Paths, One Destination
Replies: 9
Views: 7204

Re: 988 - Many paths, one destination

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.
by nymo
Mon Jun 20, 2011 4:05 pm
Forum: Volume 108 (10800-10899)
Topic: 10887 - Concatenation of Languages
Replies: 49
Views: 18423

Re: 10887 - Concatenation of Languages TLE

As some posters said that it is possible to get AC with stl set. I am getting tle... I wonder how they did that...
by nymo
Sun Jun 05, 2011 2:21 pm
Forum: Volume 106 (10600-10699)
Topic: 10604 - Chemical Reaction
Replies: 24
Views: 14779

Re: 10604 - Chemical Reaction

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 :)
by nymo
Sat Apr 16, 2011 5:54 pm
Forum: Volume 114 (11400-11499)
Topic: 11448 - Who said crisis?
Replies: 13
Views: 5119

Re: 11448 - Who Said Crisis?

I am getting RE. I am using Java BigInteger class. What can go wrong? I am quite confident that my implementation is correct.
by nymo
Thu Feb 24, 2011 5:40 pm
Forum: Volume 117 (11700-11799)
Topic: 11710 - Expensive subway
Replies: 14
Views: 5585

Re: 11710 - Expensive subway

For no. of stations, s = 1 and no. of connections, c = 0; you have to output 0.
by nymo
Wed Feb 09, 2011 5:23 pm
Forum: Volume 116 (11600-11699)
Topic: 11609 - Teams
Replies: 11
Views: 5204

Re: 11609 - Teams

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?
by nymo
Sat Feb 13, 2010 3:56 pm
Forum: FAQ
Topic: How to see my friend's Statistics?
Replies: 5
Views: 7970

Re: How to see my friend's Statistics?

Thank you sakhassan. It really helps :)
by nymo
Sun Jan 24, 2010 9:26 pm
Forum: Volume 117 (11700-11799)
Topic: 11766 - Racing Car Computer
Replies: 2
Views: 1767

11766 - Racing Car Computer

Is it DP? How do you people solve this?
by nymo
Sun Jan 24, 2010 9:16 pm
Forum: Volume 117 (11700-11799)
Topic: 11762 - Race to 1
Replies: 10
Views: 4132

Re: 11770-(Race to 1)WA

@Shiplu: Thanks very much.
by nymo
Sun Jan 24, 2010 8:24 pm
Forum: Volume 117 (11700-11799)
Topic: 11762 - Race to 1
Replies: 10
Views: 4132

Re: 11770-(Race to 1)WA

@shiplu:

Can you elaborate? Thanks in advance.
by nymo
Sun Dec 06, 2009 6:54 am
Forum: Volume 6 (600-699)
Topic: 607 - Scheduling Lectures
Replies: 3
Views: 3724

Re: 607 - Scheduling Lectures

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

Thanks in advance.
by nymo
Fri Aug 01, 2008 11:33 pm
Forum: Java
Topic: java.util.PriorityQueue...
Replies: 1
Views: 3328

java.util.PriorityQueue...

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.
by nymo
Fri Jul 04, 2008 7:08 pm
Forum: Algorithms
Topic: becoming a maestro of DP
Replies: 7
Views: 4432

Re: becoming a maestro of DP

To greve, Its a very useful site you 've there... Thanks.
by nymo
Fri Jul 04, 2008 6:38 am
Forum: Volume 114 (11400-11499)
Topic: 11450 - Wedding shopping
Replies: 14
Views: 6262

Re: 11450 - Wedding shopping

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

Code: Select all

for(j=0; j<=sum-m; j++)
               if(a[j]==i)
                  a[j+m]=i+1;
by nymo
Sun Jun 29, 2008 11:05 am
Forum: Bugs and suggestions
Topic: Download link for problem volumes.
Replies: 1
Views: 1429

Download link for problem volumes.

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?

Go to advanced search