Can anyone tell me how can I start dp problem solving? Which resources and topic will help me to progress successfully?
# | 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 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 162 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
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 |
---|