Hello everybody! Got next problem: with given N <= 1 000 000 we need to found all prime divisors of N. Moreover, we aren't required to know their powers — only primes themselves. I guess we can use Eratostenes algorithm, but I can't finish my solution. Who can help?
→ Pay attention
→ Streams
→ 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 | 151 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
so_close | 2017-10-07 14:02:01 | 18 | Tiny change: ' problem: with given N <= 1 00' -> ' problem: for every 1 <= N <= 1 00' | |
| ru3 |
|
so_close | 2017-10-07 14:01:39 | 53 | ||
| en2 |
|
so_close | 2017-10-07 13:56:03 | 225 | ||
| ru2 |
|
so_close | 2017-10-07 13:53:56 | 124 | ||
| en1 |
|
so_close | 2017-10-07 13:49:49 | 309 | Initial revision for English translation | |
| ru1 |
|
so_close | 2017-10-07 13:47:16 | 374 | Первая редакция (опубликовано) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 08:29:46 (k1).
Desktop version, switch to mobile version.
Supported by
