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;
my code:
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3740 |
3 | Radewoosh | 3652 |
4 | Benq | 3626 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3587 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3485 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | atcoder_official | 155 |
5 | nor | 154 |
6 | cry | 153 |
7 | -is-this-fft- | 152 |
8 | maroonrk | 151 |
9 | SecondThread | 148 |
10 | Petr | 146 |
Moduler Multiplicative inverse is not working under modulo 1e9+7!!!
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;
my code:
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 |
![]() |
Dream_Coder10 | 2021-04-18 17:13:48 | 54 | ||
en1 |
![]() |
Dream_Coder10 | 2021-04-18 17:09:19 | 333 | Initial revision (published) |
Name |
---|