Another_alt_account3's blog

By Another_alt_account3, history, 10 days ago, In English

Well everyone have solved this problem (number of subarray devisible by K) but how can we do this if we modify it let's suppose now we have to find number of subarrays whose sum is devisible by k in range [L,R] for let's say 1e5 queries? Is it possible to find in 1s time limit?

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

»
10 days ago, # |
  Vote: I like it 0 Vote: I do not like it

No. Of array elements?

»
10 days ago, # |
Rev. 3   Vote: I like it 0 Vote: I do not like it

I think it can be done, if k is small.