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?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
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?
Name |
---|
Modular arithmetic is a great help here.
Let's say that A = 10k - 1·ak - 1 + 10k - 2·ak - 2 + ... + 100·a0, where ai are digits of A. You have to calculate that expression modulo B. Note that you can easily calculate in linear time: just start with 100 = 1 and then multiply by ten (and apply modulo afterwards) until you have all k values. Now the expression is slightly simpler: you only have small numbers, so you can just calculate it straightforwardly, applying modulo after each operation.
Another approach: A = a0 + 10·(a2 + 10·(... + 10·(ak - 1)...)). You start calculating that expression from inside: ak - 1, then you multiply it by ten and add ak - 2, and so on until a0.