| # | 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 |
Finding the Number of integers in a range which are divisible by some array's at least one element
[It's a help seeking post.]
We have an array a of size n(n<=10^5) and a number k(k<=10^10). How can we find the number of integers between 1 to k (including 1 and k) which are divisible by at least one element of a
Example:
10 49 20 30 40 [the array a]
50 [the number k]
Answer
6
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
nayeem2021 | 2021-04-03 15:51:12 | 2 | Tiny change: 'swer**\n\n5\n\n\n' -> 'swer**\n\n6\n\n\n' | |
| en3 |
|
nayeem2021 | 2021-04-03 08:54:50 | 4 | ||
| en2 |
|
nayeem2021 | 2021-04-03 08:51:13 | 6 | Tiny change: 'array a]\n50 [the ' -> 'array a]\n\n50 [the ' | |
| en1 |
|
nayeem2021 | 2021-04-03 08:50:01 | 429 | Initial revision (published) |
