結果
問題 | No.1592 Tenkei 90 |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 14:05:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 146 ms / 1,000 ms |
コード長 | 1,560 bytes |
コンパイル時間 | 476 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 89,472 KB |
最終ジャッジ日時 | 2024-11-26 19:30:39 |
合計ジャッジ時間 | 4,572 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 145 ms
89,088 KB |
testcase_01 | AC | 143 ms
88,704 KB |
testcase_02 | AC | 142 ms
89,216 KB |
testcase_03 | AC | 142 ms
89,216 KB |
testcase_04 | AC | 142 ms
88,704 KB |
testcase_05 | AC | 142 ms
89,472 KB |
testcase_06 | AC | 140 ms
89,376 KB |
testcase_07 | AC | 144 ms
89,472 KB |
testcase_08 | AC | 141 ms
89,216 KB |
testcase_09 | AC | 142 ms
89,216 KB |
testcase_10 | AC | 142 ms
89,344 KB |
testcase_11 | AC | 142 ms
89,216 KB |
testcase_12 | AC | 143 ms
88,704 KB |
testcase_13 | AC | 145 ms
89,184 KB |
testcase_14 | AC | 143 ms
89,216 KB |
testcase_15 | AC | 141 ms
89,216 KB |
testcase_16 | AC | 143 ms
89,344 KB |
testcase_17 | AC | 140 ms
89,088 KB |
testcase_18 | AC | 146 ms
88,704 KB |
testcase_19 | AC | 144 ms
89,472 KB |
ソースコード
import sys, refrom fractions import Fractionfrom math import ceil, floor, sqrt, pi, factorial, gcdfrom copy import deepcopyfrom collections import Counter, deque, defaultdictfrom heapq import heapify, heappop, heappushfrom itertools import accumulate, product, combinations, combinations_with_replacement, permutationsfrom bisect import bisect, bisect_left, bisect_rightfrom functools import reducefrom decimal import Decimal, getcontext, ROUND_HALF_UPdef 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 ddef rotate(table):n_fild = []for x in zip(*table[::-1]):n_fild.append(x)return n_fildsys.setrecursionlimit(10 ** 7)INF = float('inf')MOD = 10 ** 9 + 7MOD2 = 998244353def main():S = list(input())C = Counter(S)mozi = 'kyoprotenkei90'for i in range(len(mozi)):C[mozi[i]] -= 1if C[mozi[i]] < 0:print('No')exit()print('Yes')if __name__ == '__main__':main()