提出 #29106432

---

ソースコード 拡げる

# Sieve of Eratosthenes
class SOE:
  def __init__(self,m):
    self.sieve=[-1]*(m+1)
    self.prime=[]
    for i in range(2,m+1):
      if self.sieve[i]==-1:
        self.prime.append(i)
        self.sieve[i]=i
        j=2*i
        while j<=m:
          self.sieve[j]=i
          j+=i
  
  def primes(self):
    # get primes
    return self.prime
  
  def fact(self,n):
    # prime factorization
    d=[]
    while n!=1:
      k=self.sieve[n]
      d.append(k)
      n//=k
    return d
  
  def div(self,n):
    # get divisors
    c=[1]
    while n!=1:
      p=self.sieve[n]
      cnt=1
      n//=p
      while self.sieve[n]==p:
        cnt+=1
        n//=p
      s=c.copy()
      for i in s:
        for j in range(1,cnt+1):
          c.append(i*(p**j))
    return c

soe=SOE(10**6)
n,q=map(int,input().split())
a=list(map(int,input().split()))
c=[1]*(n+1)
mod=10**9+33

hash=1
from collections import defaultdict
cnt=defaultdict(int)
for i in range(n):
  for j in soe.fact(a[i]):
    hash*=j
    hash%=mod
    cnt[j]+=1
    if cnt[j]==3:
      hash*=pow(j,3*(mod-2),mod)
      hash%=mod
      cnt[j]=0
  c[i+1]=hash

for i in range(q):
  l,r=map(int,input().split())
  if c[l-1]==c[r]:
    print('Yes')
  else:
    print('No')

提出情報

ジャッジ結果