## Search found 108 matches

Sun Oct 23, 2011 4:53 am
Forum: Volume 122 (12200-12299)
Topic: 12265 - Selling Land
Replies: 0
Views: 1237

### 12265 - Selling Land

experts, any hints how to solve this problem in O(n2) ???
Wed Aug 31, 2011 4:48 pm
Forum: Volume 118 (11800-11899)
Topic: 11832 - Account Book
Replies: 3
Views: 2615

### 11832 - Account Book

Can somebody Tell why the result for first Case is that ...

we can make 7 by this these ways
-1+2-3+4+5 =7
+1+2+3-4+5 =7
+1-2-3-4-5 =7

Could someone explain the output ...
Sun Dec 05, 2010 2:39 am
Forum: Volume 118 (11800-11899)
Topic: 11859 - Division Game
Replies: 8
Views: 3138

### Re: 11859 - Division Game

count the number of all devisors of all numbers of each row ...
now if he Xor of these numbers is zero print no else yes ...
see the problem in my previous comment ..
Sun Nov 21, 2010 11:20 pm
Forum: Volume 118 (11800-11899)
Topic: 11867 - Politeness
Replies: 2
Views: 3165

### Re: 11867 - Politeness

there is a Nice solution to this problem ...
solve 10290 an easier version of this problem ..
Tue Nov 09, 2010 8:32 pm
Forum: Volume 113 (11300-11399)
Topic: 11301 - Great Wall of China
Replies: 6
Views: 4317

### Re: 11301 - Great wall

Solved it By Dijkstra ...
Mon Nov 08, 2010 3:30 pm
Forum: Volume 118 (11800-11899)
Topic: 11800 - Determine the Shape
Replies: 47
Views: 13244

### Re: 11800 - Determine the Shape

Mon Nov 08, 2010 12:49 pm
Forum: Volume 118 (11800-11899)
Topic: 11893 - Fabulous DAGy
Replies: 10
Views: 3364

### Re: 11893 - Fabulous DAGy

Just try to Remove all possible Edges ... and check if the Graph is DAG ... and if there is a path that Goes trough all vertexes or not
Fri Nov 05, 2010 7:55 pm
Forum: Volume 118 (11800-11899)
Topic: 11868 - Game of Blocks
Replies: 6
Views: 3745

### Re: 11868 - Game of Blocks

i didnt use many optimization ... only used Memorization (Using STL map )... also Calculated the result for i:0...10^6 using incremental method ... it tool 4s To calculate FOR 10^6 but FOR this Test Case 2 750 749 999999999999999 it took minutes to complete ... so i didnt try much other minor optimi...
Fri Nov 05, 2010 3:27 pm
Forum: Volume 118 (11800-11899)
Topic: 11868 - Game of Blocks
Replies: 6
Views: 3745

### Re: 11868 - Game of Blocks

i implemented this approach, but i time out (
could someone help us on this ?
Thu Nov 04, 2010 2:20 pm
Forum: Volume 111 (11100-11199)
Topic: 11101 - Mall Mania
Replies: 25
Views: 11006

### Re: 11101 - Mall Mania

I used multi source bidirectional BFS as it would be very very much faster....
Wed Nov 03, 2010 4:42 pm
Forum: Volume 118 (11800-11899)
Topic: 11891 - Deep in Jungles
Replies: 0
Views: 1928

### 11891 - Deep in Jungles

Is There Any Possible Ideas on this Problem ...
FOR solving O(N*K)???
Wed Nov 03, 2010 3:29 pm
Forum: Volume 118 (11800-11899)
Topic: 11893 - Fabulous DAGy
Replies: 10
Views: 3364

### Re: 11893 - Fabulous DAGy

// This DFS calculate maximum cycle length.
From this line in your code i think your algorithm is wrong
you should not find a Cycle ... you should Remove the Extra Edge and then Find the Lenght of the DAG ..
Tue Nov 02, 2010 11:08 pm
Forum: Volume 118 (11800-11899)
Topic: 11889 - Benefit
Replies: 27
Views: 11352

### Re: 11889 - Benefit

Find the number of each Prime in C ... and then check A%(Pi^ci) ...
think what can you get from the result of A%(Pi^ci) ...
Tue Nov 02, 2010 10:16 pm
Forum: Volume 118 (11800-11899)
Topic: 11889 - Benefit
Replies: 27
Views: 11352

### Re: 11889 - Benefit

no, you need only primes up to SQRT(10^7)...
each number has at most only one prime number Greater than sqrt(n);
Tue Nov 02, 2010 10:05 pm
Forum: Volume 118 (11800-11899)
Topic: 11872 - Where to Run
Replies: 6
Views: 2674