結果
| 問題 | No.2655 Increasing Strides |
| ユーザー |
 StanMarsh
|
| 提出日時 | 2024-03-01 21:49:21 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,283 bytes |
| コンパイル時間 | 279 ms |
| コンパイル使用メモリ | 82,288 KB |
| 実行使用メモリ | 90,412 KB |
| 最終ジャッジ日時 | 2024-09-29 13:44:47 |
| 合計ジャッジ時間 | 6,506 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 141 ms
90,184 KB |
| testcase_01 | AC | 144 ms
90,164 KB |
| testcase_02 | AC | 142 ms
90,412 KB |
| testcase_03 | AC | 141 ms
90,060 KB |
| testcase_04 | AC | 142 ms
90,244 KB |
| testcase_05 | AC | 143 ms
90,172 KB |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | AC | 140 ms
90,196 KB |
| testcase_09 | AC | 140 ms
90,332 KB |
| testcase_10 | AC | 140 ms
90,404 KB |
| testcase_11 | WA | - |
| testcase_12 | AC | 141 ms
90,324 KB |
| testcase_13 | AC | 140 ms
90,340 KB |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | AC | 137 ms
90,308 KB |
| testcase_17 | AC | 140 ms
90,172 KB |
| testcase_18 | AC | 138 ms
90,104 KB |
| testcase_19 | AC | 138 ms
90,196 KB |
| testcase_20 | WA | - |
| testcase_21 | AC | 138 ms
90,384 KB |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | AC | 134 ms
89,924 KB |
| testcase_25 | AC | 137 ms
90,168 KB |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | AC | 138 ms
89,988 KB |
| testcase_29 | AC | 133 ms
89,888 KB |
| testcase_30 | AC | 142 ms
89,920 KB |
| testcase_31 | AC | 148 ms
90,388 KB |
| testcase_32 | AC | 139 ms
90,216 KB |
| testcase_33 | AC | 140 ms
90,172 KB |
| testcase_34 | WA | - |
| testcase_35 | WA | - |
ソースコード
from random import getrandbits, randrange
from string import ascii_lowercase, ascii_uppercase
import sys
from math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf, cos, sin
from copy import deepcopy, copy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import (
accumulate,
chain,
product,
combinations,
combinations_with_replacement,
permutations,
)
from bisect import bisect, bisect_left, bisect_right
from functools import lru_cache, reduce
from decimal import Decimal, getcontext
from typing import List, Tuple, Optional
inf = float("inf")
class Inf:
def __init__(self, value):
self.value = value
def __lt__(self, other):
return False
def __le__(self, other):
if isinstance(other, Inf):
return True
return False
def __gt__(self, other):
if isinstance(other, Inf):
return False
return True
def __ge__(self, other):
return True
def __eq__(self, other):
return isinstance(other, Inf) and self.value == other.value
def __repr__(self):
return f"{self.value}"
def __add__(self, other):
return Inf(self.value) if isinstance(other, Inf) else self
def __sub__(self, other):
return Inf(self.value) if isinstance(other, Inf) else self
def __mul__(self, other):
return Inf(self.value) if isinstance(other, Inf) else self
def ceil_div(a, b):
return (a + b - 1) // b
def isqrt(num):
res = int(sqrt(num))
while res * res > num:
res -= 1
while (res + 1) * (res + 1) <= num:
res += 1
return res
def int1(s):
return int(s) - 1
from types import GeneratorType
def bootstrap(f, stack=[]):
def wrapped(*args, **kwargs):
if stack:
return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
else:
stack.pop()
if not stack:
break
to = stack[-1].send(to)
return to
return wrapped
import sys
import os
input = lambda: sys.stdin.readline().rstrip("\r\n")
print = lambda *args, end="\n", sep=" ": sys.stdout.write(
sep.join(map(str, args)) + end
)
def II():
return int(input())
def MII(base=0):
return map(lambda s: int(s) - base, input().split())
def LII(base=0):
return list(MII(base))
def NA():
n = II()
a = LII()
return n, a
def read_graph(n, m, base=0, directed=False, return_edges=False):
g = [[] for _ in range(n)]
edges = []
for _ in range(m):
a, b = MII(base)
if return_edges:
edges.append((a, b))
g[a].append(b)
if not directed:
g[b].append(a)
if return_edges:
return g, edges
return g
def read_graph_with_weight(n, m, base=0, directed=False, return_edges=False):
g = [[] for _ in range(n)]
edges = []
for _ in range(m):
a, b, w = MII()
a, b = a - base, b - base
if return_edges:
edges.append((a, b, w))
g[a].append((b, w))
if not directed:
g[b].append((a, w))
if return_edges:
return g, edges
return g
def read_edges_from_ps():
ps = LII(1)
edges = []
for i, p in enumerate(ps, 1):
edges.append((p, i))
return edges
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = None
def NI():
global tokens
if tokens is None:
tokens = iterate_tokens()
return int(next(tokens))
def LNI(n):
return [NI() for _ in range(n)]
def yes(res):
print("Yes" if res else "No")
def YES(res):
print("YES" if res else "NO")
def pairwise(a):
n = len(a)
for i in range(n - 1):
yield a[i], a[i + 1]
def factorial(n):
return reduce(lambda x, y: x * y, range(1, n + 1))
def cmin(dp, i, x):
if x < dp[i]:
dp[i] = x
def cmax(dp, i, x):
if x > dp[i]:
dp[i] = x
def alp_a_to_i(s):
return ord(s) - ord("a")
def alp_A_to_i(s):
return ord(s) - ord("A")
def alp_i_to_a(i):
return chr(ord("a") + i)
def alp_i_to_A(i):
return chr(ord("A") + i)
d4 = [(1, 0), (0, 1), (-1, 0), (0, -1)]
d8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)]
def ranges(n, m):
return ((i, j) for i in range(n) for j in range(m))
def rangess(a, b, c):
return ((i, j, k) for i in range(a) for j in range(b) for k in range(c))
def valid(i, j, n, m):
return 0 <= i < n and 0 <= j < m
def ninj(i, j, n, m):
return [(i + di, j + dj) for di, dj in d4 if valid(i + di, j + dj, n, m)]
def gen(x, *args):
if len(args) == 1:
return [x] * args[0]
if len(args) == 2:
return [[x] * args[1] for _ in [0] * args[0]]
if len(args) == 3:
return [[[x] * args[2] for _ in [0] * args[1]] for _ in [0] * args[0]]
if len(args) == 4:
return [
[[[x] * args[3] for _ in [0] * args[2]] for _ in [0] * args[1]]
for _ in [0] * args[0]
]
list2d = lambda a, b, v: [[v] * b for _ in range(a)]
list3d = lambda a, b, c, v: [[[v] * c for _ in range(b)] for _ in range(a)]
class Debug:
def __init__(self, debug=False):
self.debug = debug
cur_path = os.path.dirname(os.path.abspath(__file__))
self.local = os.path.exists(cur_path + "/.cph")
def get_ic(self):
if self.debug and self.local:
from icecream import ic
return ic
else:
return lambda *args, **kwargs: ...
ic = Debug(1).get_ic()
def primeFactors(n: int):
res = defaultdict(int)
upper = floor(n**0.5) + 1
for i in range(2, upper):
while n % i == 0:
res[i] += 1
n //= i
if n > 1:
res[n] += 1
return res
n = II()
d = primeFactors(n)
def check():
if len(d) != 2:
return 0
if d[2] <= 1:
return 0
a = sorted(list(d.items()))
return a[1][1] == 1
yes(check())