## Search found 84 matches

Tue Dec 22, 2009 6:52 pm
Forum: Volume 113 (11300-11399)
Topic: 11377 - Airport Setup
Replies: 24
Views: 11929

### Re: 11377 - Airport Setup

why when x == y answer is 0 ???
when we want to flight on same city ( you assume a journey on sky of a city with 4-example a helicopter (i didn't find Airplane word in problem statement ) )
and answer is not always 0 , it has ambiguity !
Sun Sep 06, 2009 8:33 pm
Forum: Volume 104 (10400-10499)
Topic: 10400 - Game Show Math
Replies: 32
Views: 17729

### Re: 10400 - Game Show Math

I got Accepted 12.960 with dfs method ( a 2-d Array to keep track )

Is there any faster solution to solve that ?
Fri Sep 04, 2009 6:32 pm
Forum: Volume 102 (10200-10299)
Topic: 10285 - Longest Run on a Snowboard
Replies: 10
Views: 6620

### Re: 10285 - Longest Run on a Snowboard

i got accepted with backtrack

How can i memoize that ????
memo[j][?]

Sun Aug 30, 2009 2:38 pm
Forum: Volume 112 (11200-11299)
Topic: 11203 - Can you decide it for ME?
Replies: 21
Views: 10919

### Re: 11203 - Can you decide it for ME?

x + y == z
i can`t find this point in the problem

i should guess that ????
Wed May 13, 2009 9:38 pm
Forum: Volume 6 (600-699)
Topic: 640 - Self Numbers
Replies: 47
Views: 18206

### Re: 640 - Self Numbers

"Write a program to output all positive self-numbers less than or equal 10000 in increasing order, one per line."
Mon May 11, 2009 9:07 pm
Forum: Volume 6 (600-699)
Topic: 640 - Self Numbers
Replies: 47
Views: 18206

### Re: 640 - Self Numbers

Code: Select all

``640`s pdf is not same with problem ``
Fri Apr 17, 2009 1:53 pm
Forum: Volume 4 (400-499)
Topic: 436 - Arbitrage (II)
Replies: 17
Views: 5264

### Re: 436 - Arbitrage - Clarify please

i think the inputs aren`t tricky enough
Fri Apr 17, 2009 1:33 pm
Forum: Volume 4 (400-499)
Topic: 436 - Arbitrage (II)
Replies: 17
Views: 5264

### Re: 436 - Arbitrage - Clarify please

why we should check all dist ?
i checked just dist[n][n] > 1 + eps and i got Acc , is it wrong ?
Thu Apr 16, 2009 5:02 pm
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 52607

### Re: 10267 - Graphical Editor

i found another problem in your code i think this function void F(int X, int Y, char C) { char oc; oc = B[Y][X]; L(X,Y,C); if(C==oc){return;} // same colour if(B[Y+1][X]==oc){ F(X,Y+1,C); } if(B[Y][X-1]==oc){ F(X-1,Y,C); } if(B[Y][X+1]==oc){ F(X+1,Y,C); } if(B[Y-1][X]==oc){ F(X,Y-1,C); } } should ch...
Thu Apr 16, 2009 4:57 pm
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 52607

### Re: 10267 - Graphical Editor

Code: Select all

``````void K(int X1,int Y1, int X2, int Y2,char C){
int i;

for(i=X1;i<X2;i++){V(i,Y1,Y2,C);}
}``````
you should swap (x1 and x2) and( y1 and y2) here
Thu Apr 16, 2009 8:06 am
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 52607

### Re: 10267 - Graphical Editor

Again
bcoz if new and old color be same , your fill function check a cell over and over
you can use a map or a 2-D array for marking cells that you visited already
and
maybe x1 is greater than x2 or y1 > y2 , you should swap them
Tue Apr 14, 2009 8:10 am
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 52607

### Re: 10267 - Graphical Editor

bcoz if cnew and old be same , your fill function check a cell over and over
you can use a map or a 2-D array for marking cells that you visited already
and i`m not sure , you can get Acc after meet it
maybe x1 is greater than x2 or y1 > y2 , you should swap them
Sun Apr 12, 2009 8:11 pm
Forum: Volume 8 (800-899)
Topic: 884 - Factorial Factors
Replies: 49
Views: 27101

### Re: 884 - Factorial Factors

you mean Sieve of Eratosthenes ?
Sun Apr 12, 2009 5:20 pm
Forum: Volume 8 (800-899)
Topic: 884 - Factorial Factors
Replies: 49
Views: 27101

### Re: 884 - Factorial Factors

Code: Select all

``````REMOVED
after help of Chirag Chheda ``````
Sun Mar 29, 2009 8:58 am
Forum: Volume 113 (11300-11399)
Topic: 11336 - DRM
Replies: 6
Views: 4069