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
Before contest
Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2)
15:18:36
Register now »
Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2)
15:18:36
Register now »
*has extra registration
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 157 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 148 |
| 5 | SecondThread | 148 |
| 7 | Petr | 147 |
| 7 | atcoder_official | 147 |
| 9 | TheScrasse | 145 |
| 9 | nor | 145 |
→ 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: Jul/18/2024 02:16:24 (j3).
Desktop version, switch to mobile version.
Supported by
