| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
why moduler multiplicative inverse is not working under modulo 1000000007 by fermats littile theorem ? let n=11 & k=3 ; n/k should be equal to 3. but its giving me 666666675. same thing goes for n=10 & k=4;
problem:
https://paste.ubuntu.com/p/vgTZcHQ8Rv/
my code:
Modular multiplicative inverse of $$$3$$$ under modulo $$$(10^9 + 7)$$$ is $$$333333336$$$ because $$$3 * 333333336 = 1 (mod (10^9 + 7))$$$
$$$11 * 333333336 = 666666675 (mod (10^9 + 7))$$$
It is correct.
ok..can u tell me about my approach correct or wrong?
problem link is given below:
https://paste.ubuntu.com/p/vgTZcHQ8Rv/
You are giving the problem in a very weird format.
I don't see how inverses can be used here. You should evenly divide the stick and use just (fast) modular exponentiation.