https://mirror.codeforces.com/problemset/problem/749/A i did understood the question that we need to find the sum of primes that is equal to n and count of those primes but am not able to get the logic how to do it can anyone help me .. with the logic part
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | nor | 157 |
| 4 | atcoder_official | 156 |
| 4 | cry | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 154 |
| 8 | adamant | 153 |
| 9 | Um_nik | 151 |
| 10 | djm03178 | 146 |
→ Find user
→ Recent actions
History
Revisions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Aug/31/2024 21:17:59 (k2).
Desktop version, switch to mobile version.
Supported by
