https://codeforces.com/problemset/problem/72/A
hello everyone im a newbie and im having a doubt in this question im coding in c++ pls i need hlp in this thnq
https://codeforces.com/problemset/problem/72/A
hello everyone im a newbie and im having a doubt in this question im coding in c++ pls i need hlp in this thnq
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 8 | SecondThread | 146 |
| 10 | pajenegod | 145 |
Let's do dp: dp[x] — Is x a good number. So, how we can count dp[x]: Let's scan over prime numbers <= x: a — current prime number. If dp[x — a] is true => dp[x] is true. Then we retrieve the answer.