http://codeforces.com/problemset/problem/414/B
Can anyone help me in understand the problem.Just need explaination.Thanks in advance
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
http://codeforces.com/problemset/problem/414/B
Can anyone help me in understand the problem.Just need explaination.Thanks in advance
Name |
---|
A sequence is called good if all the numbers are divided by its previous number(excluding the first number ofcourse). So a sequence like — 1,4,12,36 is called good but 1,4,8,14 is not good.
Now you will be given n (the maximum number you can use in the sequence) and k (length of sequence). You have to tell how many sequences can be made out of these restrictions.
Let dp[k][cur] be the number of good sequences with k numbers that ends with cur. So —
Recurrence : From a number cur we can move to all the divisors of cur. Say the divisors of cur are — x1, x2, x3, ... xn. Then our recurrence will look like —
Base case : It's easy to tell that base case is for n = 1. (Figure out what you have to do then)
Now you only need to find a good way to store all the divisors of the numbers from 1 to 2000.
You can see my code if you get stuck : 27958781
Thanks brother.