Can someone explain how to go through this problem http://www.codechef.com/problems/A6. I have found this solution but i can't understand its precomputation part. http://www.codechef.com/viewplaintext/2279326
Can someone explain how to go through this problem http://www.codechef.com/problems/A6. I have found this solution but i can't understand its precomputation part. http://www.codechef.com/viewplaintext/2279326
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Thue-Morse sequence.
Let X be Thue-Morse sequence with length which is a power of 2 and greater than the pattern length. X' be flipped X.
All prefixes must lie in : X, XX', XX'X'X, XX'X'XX'XXX'
Next the problem can be solved using Z Algorithm