結果

問題 No.1250 汝は倍数なりや?
ユーザー direwolf7direwolf7
提出日時 2020-10-09 23:04:27
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,582 bytes
コンパイル時間 377 ms
コンパイル使用メモリ 87,072 KB
実行使用メモリ 239,084 KB
最終ジャッジ日時 2023-09-27 19:24:20
合計ジャッジ時間 27,536 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 427 ms
202,080 KB
testcase_01 AC 442 ms
201,976 KB
testcase_02 AC 432 ms
202,072 KB
testcase_03 AC 426 ms
202,068 KB
testcase_04 AC 427 ms
202,040 KB
testcase_05 AC 424 ms
202,100 KB
testcase_06 AC 423 ms
202,088 KB
testcase_07 AC 435 ms
202,156 KB
testcase_08 AC 433 ms
202,064 KB
testcase_09 AC 433 ms
202,036 KB
testcase_10 AC 438 ms
202,136 KB
testcase_11 WA -
testcase_12 AC 447 ms
202,136 KB
testcase_13 AC 442 ms
202,076 KB
testcase_14 AC 450 ms
202,164 KB
testcase_15 WA -
testcase_16 AC 432 ms
202,072 KB
testcase_17 AC 446 ms
202,156 KB
testcase_18 AC 441 ms
202,196 KB
testcase_19 AC 443 ms
202,132 KB
testcase_20 AC 453 ms
202,220 KB
testcase_21 WA -
testcase_22 AC 436 ms
202,040 KB
testcase_23 AC 424 ms
202,324 KB
testcase_24 AC 442 ms
202,336 KB
testcase_25 AC 435 ms
202,364 KB
testcase_26 AC 428 ms
202,328 KB
testcase_27 AC 434 ms
202,400 KB
testcase_28 WA -
testcase_29 AC 435 ms
202,472 KB
testcase_30 AC 430 ms
202,108 KB
testcase_31 AC 419 ms
202,076 KB
testcase_32 AC 429 ms
202,304 KB
testcase_33 AC 492 ms
239,084 KB
testcase_34 AC 465 ms
219,468 KB
testcase_35 AC 483 ms
231,684 KB
testcase_36 AC 501 ms
234,588 KB
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 465 ms
219,448 KB
testcase_40 AC 478 ms
219,504 KB
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 505 ms
234,672 KB
testcase_44 AC 465 ms
214,092 KB
testcase_45 AC 500 ms
235,240 KB
testcase_46 WA -
testcase_47 AC 474 ms
221,892 KB
testcase_48 AC 435 ms
202,108 KB
testcase_49 AC 429 ms
202,076 KB
testcase_50 AC 440 ms
202,168 KB
testcase_51 AC 431 ms
202,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import os, sys
from io import IOBase, BytesIO
py2 = round(0.5)
if py2:
    from future_builtins import ascii, filter, hex, map, oct, zip
    range = xrange
BUFSIZE = 8192
class FastIO(BytesIO):
    newlines = 0
 
    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.writable = 'x' in file.mode or 'w' in file.mode
        self.write = super(FastIO, self).write if self.writable else None
 
    def _fill(self):
        s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
        self.seek((self.tell(), self.seek(0,2), super(FastIO, self).write(s))[0])
        return s
 
    def read(self):
        while self._fill(): pass
        return super(FastIO,self).read()
 
    def readline(self):
        while self.newlines == 0:
            s = self._fill(); self.newlines = s.count(b'\n') + (not s)
        self.newlines -= 1
        return super(FastIO, self).readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.getvalue())
            self.truncate(0), self.seek(0)
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        if py2:
            self.write = self.buffer.write
            self.read = self.buffer.read
            self.readline = self.buffer.readline
        else:
            self.write = lambda s:self.buffer.write(s.encode('ascii'))
            self.read = lambda:self.buffer.read().decode('ascii')
            self.readline = lambda:self.buffer.readline().decode('ascii')
 
 
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
 
# Cout implemented in Python
import sys
class ostream:
    def __lshift__(self,a):
        sys.stdout.write(str(a))
        return self
cout = ostream()
endl = '\n'

def get_input(a=str):
    return a(input())

def get_int_input():
    return get_input(int)

def get_input_arr(a):
    return list(map(a, input().split()))

def get_int_input_arr():
    return get_input_arr(int)


def sieve(n):
    primes = [-1] * (n)
    primes[0] = -1
    primes[1] = -1
    
    i = 2
    sqrt_n = int(n ** 0.5 + 1)
    prime_nums = []
    while i <= sqrt_n:
        if primes[i] == -1:
            primes[i] = 1
            prime_nums.append(i)
            for j in range(i * i, n, i):
                primes[j] = 2
        i += 1
    for i in range(sqrt_n, n):
        if primes[i] == -1:
            primes[i] = 1
            prime_nums.append(i)
    return prime_nums

def get_prime_fac(primes, num):
    freq = {}
    for prime in primes:
        if prime <= num and num > 1:
            r = 0
            while num % prime == 0 and num > 1:
                r += 1
                num = num // prime
            if r > 0:
                freq[prime] = r
        else:
            break
    return freq

from collections import defaultdict

def solve():
    prime_nums = sieve(10 ** 7)

    n, h = get_int_input_arr()

    arr = get_int_input_arr()

    h_freq = get_prime_fac(prime_nums, h)

    for i in range(len(arr)):
        for p_h in h_freq:
            while h_freq[p_h] > 0 and arr[i] > 1 and arr[i] % p_h == 0:
                arr[i] = arr[i] // p_h
                h_freq[p_h] -= 1
    
    res = True
    for i in h_freq:
        if h_freq[i] > 0:
            res = False
            break
    if res:
        cout<<"YES"<<endl
    else:
        cout<<"NO"<<endl






def main():
    solve()


if __name__ == "__main__":
    main()
0