| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Polish Algorithmic Engagements 2011 Round 5A Trails
Recently, I engaged in two interesting problems involving the fabulous self-similar fractal curve: Dragon Curve.
Here are the links to the two problems:
After looking at the properties of the curve closely, I managed to solve the first problem. Some basic recursion shall do the work. However, I haven't got any idea for the second problem, which seems to be harder. Could you smart guys generously give me any hints or ideas?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
TankEngineer | 2015-11-11 16:13:26 | 75 | ||
| en1 |
|
TankEngineer | 2015-11-11 16:12:16 | 727 | Initial revision (published) |
