Link: https://toph.co/p/breaking-math
The task is simple. Given n, k you gotta print
where ω(j) is the number of distinct prime factors of j.
Constraints: 1 ≤ k ≤ 10, 1 ≤ n ≤ 1011.
TL is fuckin' big, 15 seconds. Wut do?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/11/2026 02:39:44 (g2).
Desktop version, switch to mobile version.
Supported by
Really interesting problem. Min_25, please give hint! Not to forget another math masters, Endagorion, rng_58, zimpha, yutaka1999, Golovanov399 (sorry if I forgot anyone ^^). Mamedov
who the fuck are you xD
ok, you cool.
Check the editorial of problem F
Thanks for the hint!
Thanks man.