| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
i get stuck on problem, i try to solve it,but i don't come up with any idea:
statement :
input : a given sequence n and number k
task : count all sequence that thier product is less than or equa k.
ex :
input : 9 10
11 1 2 1 1 5 10 2 3
ouput : 10
hope your help. thank you!
If you wonder why you're getting downvoted, it is because you haven't mentioned the limits of N and K, and you haven't explained what is a sequence (subsequence or subarray-a contiguous subsequence). If you want to count the subarrays, then you can do it with the 2-pointer technique. If not, in N*K with a standard dp. You should also mention whether the numbers can be negative or 0