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 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 22:17:04 (i2).
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.