結果

問題 No.1250 汝は倍数なりや?
ユーザー direwolf7direwolf7
提出日時 2020-10-09 22:54:53
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,564 bytes
コンパイル時間 669 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 130,816 KB
最終ジャッジ日時 2024-07-20 13:29:35
合計ジャッジ時間 6,329 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 76 ms
79,872 KB
testcase_01 AC 77 ms
74,368 KB
testcase_02 AC 77 ms
74,240 KB
testcase_03 AC 77 ms
74,368 KB
testcase_04 AC 76 ms
74,368 KB
testcase_05 AC 77 ms
74,624 KB
testcase_06 AC 70 ms
74,496 KB
testcase_07 AC 70 ms
74,496 KB
testcase_08 AC 75 ms
74,624 KB
testcase_09 AC 71 ms
74,496 KB
testcase_10 AC 71 ms
74,496 KB
testcase_11 WA -
testcase_12 AC 69 ms
74,368 KB
testcase_13 AC 72 ms
75,136 KB
testcase_14 AC 70 ms
75,136 KB
testcase_15 WA -
testcase_16 AC 73 ms
75,264 KB
testcase_17 AC 70 ms
74,240 KB
testcase_18 AC 72 ms
74,496 KB
testcase_19 AC 73 ms
74,624 KB
testcase_20 AC 73 ms
74,752 KB
testcase_21 WA -
testcase_22 AC 79 ms
74,624 KB
testcase_23 AC 91 ms
77,824 KB
testcase_24 AC 88 ms
77,184 KB
testcase_25 AC 93 ms
78,336 KB
testcase_26 AC 83 ms
76,288 KB
testcase_27 AC 93 ms
78,080 KB
testcase_28 WA -
testcase_29 AC 76 ms
76,672 KB
testcase_30 AC 84 ms
79,616 KB
testcase_31 AC 77 ms
76,672 KB
testcase_32 AC 85 ms
78,080 KB
testcase_33 TLE -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
testcase_46 -- -
testcase_47 -- -
testcase_48 -- -
testcase_49 -- -
testcase_50 -- -
testcase_51 -- -
権限があれば一括ダウンロードができます

ソースコード

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 ** 6)

    n, h = get_int_input_arr()

    arr = get_int_input_arr()

    h_freq = get_prime_fac(prime_nums, h)

    res_freq = defaultdict(lambda: 0)

    for i in range(len(arr)):
        r_f = get_prime_fac(prime_nums, arr[i])
        for p in r_f:
            res_freq[p] += r_f[p]
    
    res = True
    for i in h_freq:
        if res_freq[i] < h_freq[i]:
            res = False
            break
    if res:
        cout<<"YES"<<endl
    else:
        cout<<"NO"<<endl






def main():
    solve()


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