Lets say I have a Big Integer A and an integer B . I want to calculate A mod B in O(number_of_digits_in(A)) complexity.
How can I do that?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3904 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3494 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | maroonrk | 3350 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 164 |
| 2 | cry | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 159 |
| 5 | awoo | 158 |
| 6 | adamant | 157 |
| 6 | -is-this-fft- | 157 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 9 | Dominater069 | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/20/2024 22:46:44 (l1).
Desktop version, switch to mobile version.
Supported by
