Walter and His Customers
All submissions for this problem are available.Walter is the best in making crystals and due to which his crystal’s popularity grew. It grew so much that it was not enough for everyone. So Jesse gave a unique number to all the customers and thought that whose number is divisible by 2 and by 3 are eligible to buy their product. But if the unique number is divisible by 5, then that customer is not eligible to buy his product. Walter and Jesse appoint Madhav to sell the product. When the customer comes to buy the product, they show their unique number and then Madhav accordingly decides whether to sell him or not. A customer can come any number of time. Print the total number of different customers who are eligible. ###Input: - First line will contain $N$, number of customers. - Next line will contain $N$ number of integers. ###Output: Output total number of different(unique) customers who are eligible. ###Constraints - $1 \leq N \leq 10^5$ - $2 \leq A[i] \leq 10^9$ ###Sample Input: 5 2 3 6 30 10 ###Sample Output: 1 ###Sample Input: 8 12 7 42 30 5 9 6 3 ###Sample Output: 3 ###EXPLANATION: In the first sample there is only one number $$ which is divisible by 3 and 2 but not 5, hence the answer in one. In the second sample there are 3 customer numbers $[12,42,6]$ that are eligible.
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, SQL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, R, COB, FS|
Fetching successful submissions