結果
問題 | No.1048 Zero (Advanced) |
ユーザー | McGregorsh |
提出日時 | 2022-07-08 09:10:45 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,315 bytes |
コンパイル時間 | 1,880 ms |
コンパイル使用メモリ | 86,136 KB |
実行使用メモリ | 92,824 KB |
最終ジャッジ日時 | 2023-08-27 01:59:48 |
合計ジャッジ時間 | 5,626 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 228 ms
92,308 KB |
testcase_01 | AC | 219 ms
92,180 KB |
testcase_02 | AC | 217 ms
92,148 KB |
testcase_03 | AC | 215 ms
92,372 KB |
testcase_04 | AC | 207 ms
92,324 KB |
testcase_05 | AC | 209 ms
92,312 KB |
testcase_06 | AC | 211 ms
92,328 KB |
testcase_07 | AC | 212 ms
92,144 KB |
testcase_08 | AC | 212 ms
92,304 KB |
testcase_09 | AC | 212 ms
92,824 KB |
testcase_10 | WA | - |
testcase_11 | AC | 215 ms
92,376 KB |
testcase_12 | WA | - |
testcase_13 | AC | 214 ms
92,456 KB |
testcase_14 | WA | - |
testcase_15 | AC | 224 ms
92,304 KB |
testcase_16 | WA | - |
testcase_17 | AC | 223 ms
92,412 KB |
testcase_18 | WA | - |
ソースコード
###約数列挙### 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 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(): l, r, m, k = i_map() k_nums = make_divisors(k) if k == 0: print('Yes') exit() amari_l = l % m amari_r = r % m if amari_l > amari_r: print('Yes') else: for i in range(len(k_nums)): point = k_nums[i] - 1 score = amari_r * point nokori = m - score if amari_l <= nokori <= amari_r: print('Yes') exit() print('No') if __name__ == '__main__': main()