[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

In sublime text editor, the last open files, layout, columns and all configuration are restored automatically. I have googled it already (many times since beginning of using Codeblocks) but couldn't find any affirmative result.

So, How to avail this feature in Codeblocks? If someone knows something about it please reply...