нужно вычислить a^b mod c. a, b, c до 10^18 2^63-1(если это вдруг принципиально). Как избежать переполнения или без длинки никак?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Find user
→ Recent actions
Comments (2)
Write comment?
cerealguy
|
15 years ago,
hide
#
|
+12
http://codeforces.me/blog/entry/1729
→
Reply
|
-
luckyi15 years ago, hide # ^ |
0
спасибо!не подумал гуглить по codeforces =(→ Reply
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/14/2026 11:49:18 (g2).
Desktop version, switch to mobile version.
Supported by
