| # | 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 |
sequence
i get stuck on problem, i try to solve it, i don't come up with any idea: so i need help.
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. thanks
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
didaihocdaihoc | 2017-10-13 14:16:42 | 25 | Tiny change: '. thanks\n' -> '. thanks\n\n' (published) | |
| en4 |
|
didaihocdaihoc | 2017-10-13 14:15:51 | 14 | Tiny change: '. thanks\n' -> '. thanks\n\n' | |
| en3 |
|
didaihocdaihoc | 2017-10-13 14:15:31 | 2 | Tiny change: '. thanks\n' -> '. thanks\n\n' | |
| en2 |
|
didaihocdaihoc | 2017-10-13 14:13:32 | 4 | (saved to drafts) | |
| en1 |
|
didaihocdaihoc | 2017-10-13 14:11:57 | 308 | Initial revision (published) |
