結果

問題 No.1723 [Cherry 3rd Tune *] Dead on
ユーザー McGregorshMcGregorsh
提出日時 2022-07-25 23:03:49
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 255 ms / 2,000 ms
コード長 4,299 bytes
コンパイル時間 300 ms
コンパイル使用メモリ 87,376 KB
実行使用メモリ 93,484 KB
最終ジャッジ日時 2023-09-22 09:46:46
合計ジャッジ時間 14,942 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 241 ms
92,816 KB
testcase_01 AC 241 ms
92,988 KB
testcase_02 AC 242 ms
92,180 KB
testcase_03 AC 238 ms
92,560 KB
testcase_04 AC 252 ms
92,564 KB
testcase_05 AC 240 ms
93,200 KB
testcase_06 AC 236 ms
93,484 KB
testcase_07 AC 236 ms
92,540 KB
testcase_08 AC 240 ms
92,584 KB
testcase_09 AC 241 ms
93,164 KB
testcase_10 AC 243 ms
92,672 KB
testcase_11 AC 243 ms
92,756 KB
testcase_12 AC 240 ms
93,400 KB
testcase_13 AC 241 ms
93,348 KB
testcase_14 AC 240 ms
93,304 KB
testcase_15 AC 255 ms
92,700 KB
testcase_16 AC 248 ms
92,724 KB
testcase_17 AC 254 ms
92,500 KB
testcase_18 AC 248 ms
92,676 KB
testcase_19 AC 244 ms
93,160 KB
testcase_20 AC 242 ms
92,824 KB
testcase_21 AC 242 ms
93,412 KB
testcase_22 AC 243 ms
92,780 KB
testcase_23 AC 240 ms
92,700 KB
testcase_24 AC 241 ms
92,560 KB
testcase_25 AC 249 ms
92,964 KB
testcase_26 AC 247 ms
92,688 KB
testcase_27 AC 242 ms
92,580 KB
testcase_28 AC 245 ms
92,720 KB
testcase_29 AC 243 ms
92,632 KB
testcase_30 AC 255 ms
92,744 KB
testcase_31 AC 243 ms
93,464 KB
testcase_32 AC 241 ms
92,444 KB
testcase_33 AC 241 ms
92,276 KB
testcase_34 AC 234 ms
92,308 KB
testcase_35 AC 233 ms
92,256 KB
testcase_36 AC 250 ms
93,196 KB
testcase_37 AC 238 ms
92,388 KB
testcase_38 AC 240 ms
92,816 KB
testcase_39 AC 238 ms
92,976 KB
testcase_40 AC 238 ms
92,440 KB
testcase_41 AC 236 ms
93,144 KB
testcase_42 AC 233 ms
92,352 KB
testcase_43 AC 241 ms
92,396 KB
testcase_44 AC 237 ms
92,412 KB
testcase_45 AC 239 ms
92,164 KB
testcase_46 AC 235 ms
92,868 KB
testcase_47 AC 238 ms
92,372 KB
testcase_48 AC 236 ms
92,328 KB
testcase_49 AC 235 ms
92,372 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

###素因数分解###

def prime_factorize(n: int) -> list:
   return_list = []
   while n % 2 == 0:
   	  return_list.append(2)
   	  n //= 2
   f = 3
   while f * f <= n:
   	  if n % f == 0:
   	  	  return_list.append(f)
   	  	  n //= f
   	  else:
   	  	  f += 2
   if n != 1:
   	  return_list.append(n)
   return return_list


###ある数が素数かどうかの判定###

def is_prime(n):
    if n < 2:
        return False
    i = 2
    while i * i <= n:
        if n % i == 0:
            return False
        i += 1
    return True
    

###N以下の素数列挙###

import math 
def sieve_of_eratosthenes(n):
	  prime = [True for i in range(n+1)]
	  prime[0] = False
	  prime[1] = False
	  
	  sqrt_n = math.ceil(math.sqrt(n))
	  for i in range(2, sqrt_n+1):
	  	  if prime[i]:
	  	  	  for j in range(2*i, n+1, i):
	  	  	  	  prime[j] = False
	  return prime


###N以上K以下の素数列挙###

import math

def segment_sieve(a, b):
	  sqrt_b = math.ceil(math.sqrt(b))
	  prime_small = [True for i in range(sqrt_b)]
	  prime = [True for i in range(b-a+1)]
	  
	  for i in range(2, sqrt_b):
	  	  if prime_small[i]:
	  	  	  for j in range(2*i, sqrt_b, i):
	  	  	  	  prime_small[j] = False
	  	  	  for j in range((a+i-1)//i*i, b+1, i):
	  	  	  	  #print('j: ', j)
	  	  	  	  prime[j-a] = False
	  return prime


###n進数から10進数変換###

def base_10(num_n,n):
	  num_10 = 0
	  for s in str(num_n):
	  	  num_10 *= n
	  	  num_10 += int(s)
	  return num_10


###10進数からn進数変換###

def base_n(num_10,n):
	  str_n = ''
	  while num_10:
	  	  if num_10%n>=10:
	  	  	  return -1
	  	  str_n += str(num_10%n)
	  	  num_10 //= n
	  return int(str_n[::-1])


###複数の数の最大公約数、最小公倍数###

from functools import reduce

# 最大公約数
def gcd_list(num_list: list) -> int:
	  return reduce(gcd, num_list)

# 最小公倍数
def lcm_base(x: int, y: int) -> int:
	  return (x * y) // gcd(x, y)
def lcm_list(num_list: list):
	  return reduce(lcm_base, num_list, 1)


###約数列挙###

def make_divisors(n):
	  lower_divisors, upper_divisors = [], []
	  i = 1
	  while i * i <= n:
	  	  if n % i == 0:
	  	  	  lower_divisors.append(i)
	  	  	  if i != n // i:
	  	  	  	  upper_divisors.append(n//i)
	  	  i += 1
	  return lower_divisors + upper_divisors[::-1]


###順列###

def nPr(n, r):
	  npr = 1
	  for i in range(n, n-r, -1):
	  	  npr *= i
	  return npr


###組合せ###

def nCr(n, r):
	  factr = 1
	  r = min(r, n - r)
	  for i in range(r, 1, -1):
	  	  factr *= i
	  return nPr(n, r)/factr



import sys, re
from fractions import Fraction
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


###関数コピーしたか？###
def main():
   
   x, a, y, b = i_map()
   
   num_a = prime_factorize(x)
   num_b = prime_factorize(y)
   
   count_a = Counter(num_a)
   count_b = Counter(num_b)
   
   juge = True
   for key, value in count_b.items():
   	  score = value * b
   	  if count_a[key] * a < score:
   	  	  juge = False
   	  	  break
   
   if juge:
   	  print('Yes')
   else:
   	  print('No')
   
if __name__ == '__main__':
    main()
0