結果

問題 No.2074 Product is Square ?
ユーザー chineristACchineristAC
提出日時 2022-09-14 12:55:41
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,222 bytes
コンパイル時間 280 ms
コンパイル使用メモリ 87,484 KB
実行使用メモリ 81,724 KB
最終ジャッジ日時 2023-08-21 12:47:57
合計ジャッジ時間 38,012 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def isPrimeMR(n):
    if n==1:
        return 0
    d = n - 1
    d = d // (d & -d)
    L = [2, 3, 5, 7, 11, 13, 17]
    if n in L:
        return 1
    for a in L:
        t = d
        y = pow(a, t, n)
        if y == 1: continue
        while y != n - 1:
            y = (y * y) % n
            if y == 1 or t == n - 1: return 0
            t <<= 1
    return 1
def findFactorRho(n):
    from math import gcd
    m = 1 << n.bit_length() // 8
    for c in range(1, 99):
        f = lambda x: (x * x + c) % n
        y, r, q, g = 2, 1, 1, 1
        while g == 1:
            x = y
            for i in range(r):
                y = f(y)
            k = 0
            while k < r and g == 1:
                ys = y
                for i in range(min(m, r - k)):
                    y = f(y)
                    q = q * abs(x - y) % n
                g = gcd(q, n)
                k += m
            r <<= 1
        if g == n:
            g = 1
            while g == 1:
                ys = f(ys)
                g = gcd(abs(x - ys), n)
        if g < n:
            if isPrimeMR(g): return g
            elif isPrimeMR(n // g): return n // g
            return findFactorRho(g)
def primeFactor(n):
    i = 2
    ret = {}
    rhoFlg = 0
    while i*i <= n:
        k = 0
        while n % i == 0:
            n //= i
            k += 1
        if k: ret[i] = k
        i += 1 + i % 2
        if i == 101 and n >= 2 ** 20:
            while n > 1:
                if isPrimeMR(n):
                    ret[n], n = 1, 1
                else:
                    rhoFlg = 1
                    j = findFactorRho(n)
                    k = 0
                    while n % j == 0:
                        n //= j
                        k += 1
                    ret[j] = k

    if n > 1: ret[n] = 1
    if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}
    return ret

def isqrt(a):
    ok = 0
    ng = 10**9+1
    while ng-ok>1:
        mid = (ok+ng)//2
        if mid*mid <= a:
            ok = mid
        else:
            ng = mid
    return ok

def solve(N,_A):
    A = _A.copy()
    for i in range(N):
        for j in range(i+1,N):
            g = gcd(A[i],A[j])
            A[i] //= g
            A[j] //= g
    
    for a in A:
        if int(a**.5)**2 !=a:
            return False
    return True

def big_int(N,A):
    p = 1
    for a in A:
        p *= a
    
    ok = 0
    ng = 10**(18*N) + 1
    while ng-ok>1:
        mid = (ok+ng)//2
        if mid*mid <= p:
            ok = mid
        else:
            ng = mid
    
    return ok*ok == p


for _ in range(int(input())):
    N = int(input())
    A = li()
    for i in range(N):
        for p in range(1,int(10**4.5)+1)[::-1]:
            if A[i]%(p**2) == 0:
                A[i] //= p**2
    dic = {}
    for a in A:
        if a not in dic:
            dic[a] = 0
        dic[a] += 1
    if all(dic[a]&1 == 0 for a in dic):
        print("Yes")
    else:
        print("No")
0