Hi, if the upper range of unsigned __int64 is 2^64-1 then how can I get any number modulo by 2^64? Thanks.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Hi, if the upper range of unsigned __int64 is 2^64-1 then how can I get any number modulo by 2^64? Thanks.
Name |
---|
What do you mean saying "how can I get any number modulo by 2^64?"? what's "any" number? Give an example, please.
suppose, (2^63+2^63)%2^64= ? How can I get this answer?
If you use unsigned long long, numbers are automatically by modulo 264, and you dont need do anything.
Thanks dalex and notime.sea. I get it
Modulo 2^64? It's easy. Just use unsigned long long and... nothing more!