GCD Queries

Правка en1, от vidit_123, 2017-09-08 21:38:29

Given an array,how to solve queries (10^5) of type Q:Value,L,R where value is a number and we need to report the count of all the numbers in the range [L,R] of the array such that gcd(Value,A[i])>1 where L<=i<=R.

Теги primes, gcd, queries

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский vidit_123 2017-09-09 15:44:32 67
en1 Английский vidit_123 2017-09-08 21:38:29 223 Initial revision (published)