## Search found 25 matches

- Fri Jan 02, 2009 3:15 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11531 - Solve the Broken Maze
- Replies:
**15** - Views:
**7129**

### Re: 11531 - Solve the Broken Maze

Hi LayCurse, I still don't get it. When we talk about the k-th column, there is a case that the route may bend back to (k-1)th column and return back to k-th column. In this case, how do you represent your DP formula? For example, consider the following maze, ???? ???? ???? ???? In this case, the ro...

- Thu Sep 25, 2003 2:44 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10001 - Garden of Eden
- Replies:
**39** - Views:
**16010**

- Thu Sep 25, 2003 5:41 am
- Forum: Volume 100 (10000-10099)
- Topic: 10001 - Garden of Eden
- Replies:
**39** - Views:
**16010**

- Wed Sep 24, 2003 1:11 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10001 - Garden of Eden
- Replies:
**39** - Views:
**16010**

### 10001 Garden of Eden

I have wondered why the forth test case in the sample input is "GARDEN OF EDEN"

Because 110 can become 100, thus state 1100000000000000 can become 1000000000000000.

Can anyone tell me why^^ .. thx

Because 110 can become 100, thus state 1100000000000000 can become 1000000000000000.

Can anyone tell me why^^ .. thx

- Thu Sep 11, 2003 6:10 am
- Forum: Volume 105 (10500-10599)
- Topic: 10501 - Simplified Shisen-Sho
- Replies:
**12** - Views:
**8929**

- Thu Jul 31, 2003 8:47 am
- Forum: Volume 104 (10400-10499)
- Topic: 10428 - The Roots
- Replies:
**13** - Views:
**9523**

For this problem, I use Newton method. The recurrence is as follows: X(n) = X(n-1) - f( X(n) ) / f ' ( X(n) ) Therefore, I take every integer point in the range [-25, 25] to the recurrenece above to get the approximation root. The iteration for one root is 20. However, I think there is a problem, su...

- Sat Jul 26, 2003 4:46 am
- Forum: Volume 101 (10100-10199)
- Topic: 10157 - Expressions
- Replies:
**23** - Views:
**12795**

I have a recurrence for this problem, but it is inefficent, too. Here is my recurrence. d-1 n-1 c[n][d] = Σ c[n-k][d] + Σ ( c[k-1][d-1] * s[n-k][d]) + c[n-1][d-1] k=1 k=d s[n][d] = c[n][d] + s[n][d-1] , where n is the number of fully-paired parenthesis. The basic idea is as follows: 1. if k <= d-1 w...

- Thu Apr 03, 2003 7:15 am
- Forum: Algorithms
- Topic: Geometry problem
- Replies:
**3** - Views:
**3562**

### Geometry problem

When encountering geometry problem, I always give up :cry: Here are two classical problem for you all to help me :D ... thx 1. Given lots of arbitray points in two dimention coordinates and a specified diameter circle. You need to find out at least how many number of circles to cover all these point...

- Wed Feb 12, 2003 9:09 am
- Forum: Volume 104 (10400-10499)
- Topic: 10446 - The Marriage Interview :-)
- Replies:
**17** - Views:
**10072**

- Wed Feb 12, 2003 8:24 am
- Forum: Volume 104 (10400-10499)
- Topic: 10446 - The Marriage Interview :-)
- Replies:
**17** - Views:
**10072**

### 10446 - The Marriage Interview :-)

In C, I used data type "unsigned long long int" but I get WA.

Is it overflow??

Is it overflow??

- Sat Aug 17, 2002 3:13 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10196 - Check The Check
- Replies:
**77** - Views:
**25321**

### I'm wrong too >< ..

Do I need to consider the move of king? ..

As problem describe, there is no condition as

both the two king in check. Therefore, I don't

consider the move of the king ...

But I got WA ... @@? ...

Is there any special condistion which should be notified? .. thanks for your reply^^ ..

As problem describe, there is no condition as

both the two king in check. Therefore, I don't

consider the move of the king ...

But I got WA ... @@? ...

Is there any special condistion which should be notified? .. thanks for your reply^^ ..

- Tue May 21, 2002 7:09 pm
- Forum: Volume 6 (600-699)
- Topic: 615 - Is It A Tree?
- Replies:
**71** - Views:
**25520**

### 615 - Is It A Tree?

My method is described as follows: 1. According the input data, for each element, I defined two integer which are the number of edge pointing to that node ( say it A ) and the number of edge where that node points( say it B). If A = 0, then that node is defined as root. Therefore, if finding root ag...

- Tue Mar 12, 2002 7:05 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10252 - Common Permutation
- Replies:
**150** - Views:
**55722**

- Tue Mar 12, 2002 2:45 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10252 - Common Permutation
- Replies:
**150** - Views:
**55722**

I have the same question ... I sent these two version described above to online judge, but got WA. The following is my method: 1. a table storing each character with the number of appearing in the two string individual. 2. if the character appears one or more times, then I determine how many the sam...

- Wed Mar 06, 2002 3:39 pm
- Forum: Volume 1 (100-199)
- Topic: 133 - The Dole Queue
- Replies:
**42** - Views:
**6642**