Can any one solve this
C++ code N^(f(X)) mod M
f(X) is defined as product of primes upto X
1<=N,M<=10^9
1<=X<=10^6
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 163 |
| 2 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | awoo | 158 |
| 6 | atcoder_official | 157 |
| 7 | nor | 155 |
| 7 | adamant | 155 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 148 |
→ Find user
→ Recent actions
Can someone explain how hacking in codefores work? how does hacking effect ratings? how many hacks one can do.?
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/19/2024 04:57:58 (h1).
Desktop version, switch to mobile version.
Supported by
