### oasis's blog

By oasis, 8 years ago, The problem number is 148A-"Insomnia Cure", i can not understand the problem... Comments (7)
| Write comment?
 » In simpler words you will be given k, l, m, n and d as inputs. now you need to count the numbers starting from 1 and ending at d, which are divisible by atleast one of k,l,m,n; Explanation of sample input 1 : here d=12, so you need to count numbers from 1,2,3,.....,12 which are divisible by atleast one of (1,2,3,4). You can observe that count = 12.
•  » » Thank you,achaitanyasai! It was very helpful.
•  » » » My pleasure :)
 » Every k-th dragon got punched in the face with a frying pan..it means from 1-d if a number is divisible by k then it suffered moral or physical damage.....same thing in l , m , n th....if a number from 1-d is divisible by any of 4 number then that dragon will suffer moral or physical damage..... so just you have to find the count how many number are divisible by k/l/m/n from 1 to d...and that's the answer
•  » » Very clear explanation, thank you❤
•  » » how can you say every k-th dragon got punched in the face with a frying pan..it means from 1-d if a number is divisible by k then it suffered moral or physical damage.....??
 » The statement of this problem is abnormally unclear.