| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 136 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
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