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
Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
35:29:38
Register now »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
35:29:38
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/22/2024 06:05:23 (j2).
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.