Can anyone tell me how can I start dp problem solving? Which resources and topic will help me to progress successfully?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Can anyone tell me how can I start dp problem solving? Which resources and topic will help me to progress successfully?
using namespace std;
bool prime(long long a) { long long b=0,i; for(i=2; i*i<=a; i++) if(a%i==0) return 0; return 1; }
int main() { long long t,m,n; cin>>t; for(long long i=0; i<t; i++) { cin>>n>>m; for(long long j=n; j<=m; j++) { if(prime(j)==1&&j!=1) cout<<j<<endl; } cout <<endl; } return 0; }
| Name |
|---|


