oasis's blog

By oasis, 6 years ago, In English

The problem number is 148A-"Insomnia Cure", i can not understand the problem...

 
 
 
 
  • Vote: I like it
  • -8
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it +5 Vote: I do not like it

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.

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

But why do we have to count like that , can you clearly explain how did you figure out why such an approach is required to be followed

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

why i divide by k,l,m,n??I could not understand.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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