can anyone suggest me how to solve http://www.spoj.pl/problems/ADV04B1
can anyone suggest me how to solve http://www.spoj.pl/problems/ADV04B1
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
It helps you to solve.
sry.... got it :) many thanks
Please Post your approach how did you precompute??
Post with examples it will be useful for many!
If you read the wolfram explanation carefully, it notes the following recurrence.
Precalculate the inverse of n modulo 1e6 + 3 for all 1 ≤ n ≤ 1000000.
This can be done in O(n). Then, we can precalculate all D(n) in O(n) as well.