結果
問題 | No.1048 Zero (Advanced) |
ユーザー | Mille0x1C |
提出日時 | 2020-05-08 22:37:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 292 ms / 2,000 ms |
コード長 | 2,017 bytes |
コンパイル時間 | 282 ms |
コンパイル使用メモリ | 87,244 KB |
実行使用メモリ | 95,256 KB |
最終ジャッジ日時 | 2023-09-17 03:13:08 |
合計ジャッジ時間 | 6,773 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 292 ms
95,172 KB |
testcase_01 | AC | 291 ms
95,132 KB |
testcase_02 | AC | 287 ms
94,960 KB |
testcase_03 | AC | 289 ms
94,880 KB |
testcase_04 | AC | 290 ms
94,960 KB |
testcase_05 | AC | 288 ms
94,940 KB |
testcase_06 | AC | 284 ms
94,816 KB |
testcase_07 | AC | 282 ms
94,884 KB |
testcase_08 | AC | 277 ms
94,820 KB |
testcase_09 | AC | 278 ms
95,128 KB |
testcase_10 | AC | 274 ms
95,140 KB |
testcase_11 | AC | 280 ms
94,864 KB |
testcase_12 | AC | 279 ms
95,132 KB |
testcase_13 | AC | 278 ms
94,976 KB |
testcase_14 | AC | 278 ms
95,256 KB |
testcase_15 | AC | 275 ms
94,884 KB |
testcase_16 | AC | 284 ms
94,720 KB |
testcase_17 | AC | 280 ms
95,008 KB |
testcase_18 | AC | 277 ms
95,008 KB |
ソースコード
from __future__ import print_function import sys sys.setrecursionlimit(500000) import re import array import copy import functools import operator import math import string import fractions from fractions import Fraction import collections import itertools import bisect import random import time import heapq from heapq import heappush from heapq import heappop from heapq import heappushpop from heapq import heapify from heapq import heapreplace from queue import PriorityQueue as pq from queue import Queue from itertools import accumulate from collections import deque from collections import Counter from operator import mul from functools import reduce input = sys.stdin.readline def eprint(*args, **kwargs): print(*args, file=sys.stderr, **kwargs) return # from fractions import gcd # from math import gcd # def lcm(n, m): # return int(n * m / gcd(n, m)) # def coprimize(p, q): # common = gcd(p, q) # return (p // common, q // common) # def find_gcd(list_l): # x = reduce(gcd, list_l) # return x def combinations_count(n, r): r = min(r, n - r) numer = reduce(mul, range(n, n - r, -1), 1) denom = reduce(mul, range(1, r + 1), 1) return numer // denom def main(): # l,r,m,k = map(int,input().strip().split()) # if l==r and l*k%m == 0: print("Yes") return elif l==r and l*k%m != 0: print("No") return # eprint('l*k, r*k ',end=':\n') eprint(l*k, r*k) # l1 = (l-1)*k // m r1 = r*k // m # if l*k%m ==0 or r*k%m == 0: print("Yes") return # if r1 - l1>0: print("Yes") else: print("No") return # eprint('l, l+m,r ',end=':\n') # eprint(l, l+m,r) # if l1+m<=r1 or l1+m-l<=r1: # print("Yes") # else: # print("No") # l2=l1%m # r2=r1%m # if l2: # pass # if 0<l<r<m: # print("No") # else: # print("Yes") if __name__ == '__main__': main()