GCD Queries

Revision en2, by vidit_123, 2017-09-09 15:44:32

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. Given ARRAY SIZE :- 10^5 Each number 1<= A[i] <=10^5 TL = 1 Sec

Tags primes, gcd, queries

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English vidit_123 2017-09-09 15:44:32 67
en1 English vidit_123 2017-09-08 21:38:29 223 Initial revision (published)