Hi, if the upper range of unsigned __int64 is 2^64-1 then how can I get any number modulo by 2^64? Thanks.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3312 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/25/2026 11:45:45 (g2).
Desktop version, switch to mobile version.
Supported by
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!