problem:
given at most 400 values of C. for each C,find an integer X (X<=10^18) such that 2^x mod (10^9 + 7) = c
i know that a value x must exist (X<10^9 + 7).but finding X is a problem for me. is there an efficient way to find x?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | Petr | 145 |
9 | pajenegod | 145 |
problem:
given at most 400 values of C. for each C,find an integer X (X<=10^18) such that 2^x mod (10^9 + 7) = c
i know that a value x must exist (X<10^9 + 7).but finding X is a problem for me. is there an efficient way to find x?
Name |
---|
U can solve using shank baby step gaint step algorithm
To elaborate on teja349's answer, the idea is that there are at most m = 109 + 6 different values that 2x can take on, and if there is a solution to 2x = c, then you can write where and (modulo off-by-one errors).
All you have to do is compute all possible 2x values where and throw them in a hashtable, and then for each value of a, check if there is some element in the hashtable having value .