Doubt in a range query problem

Правка en1, от Another_alt_account3, 2021-09-15 06:19:57

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?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Another_alt_account3 2021-09-15 06:19:57 310 Initial revision (published)