結果
問題 | No.1367 文字列門松 |
ユーザー | McGregorsh |
提出日時 | 2022-07-16 21:54:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 274 ms / 2,000 ms |
コード長 | 1,645 bytes |
コンパイル時間 | 307 ms |
コンパイル使用メモリ | 86,908 KB |
実行使用メモリ | 93,796 KB |
最終ジャッジ日時 | 2023-09-11 07:49:07 |
合計ジャッジ時間 | 9,215 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 252 ms
93,216 KB |
testcase_01 | AC | 252 ms
93,796 KB |
testcase_02 | AC | 249 ms
93,284 KB |
testcase_03 | AC | 259 ms
93,216 KB |
testcase_04 | AC | 259 ms
93,200 KB |
testcase_05 | AC | 254 ms
93,200 KB |
testcase_06 | AC | 252 ms
93,124 KB |
testcase_07 | AC | 254 ms
93,184 KB |
testcase_08 | AC | 255 ms
93,248 KB |
testcase_09 | AC | 253 ms
93,392 KB |
testcase_10 | AC | 252 ms
93,396 KB |
testcase_11 | AC | 250 ms
93,448 KB |
testcase_12 | AC | 257 ms
93,672 KB |
testcase_13 | AC | 253 ms
93,516 KB |
testcase_14 | AC | 253 ms
93,280 KB |
testcase_15 | AC | 254 ms
93,384 KB |
testcase_16 | AC | 253 ms
93,396 KB |
testcase_17 | AC | 258 ms
93,472 KB |
testcase_18 | AC | 254 ms
93,180 KB |
testcase_19 | AC | 274 ms
93,384 KB |
testcase_20 | AC | 252 ms
93,676 KB |
testcase_21 | AC | 253 ms
93,168 KB |
testcase_22 | AC | 250 ms
93,552 KB |
testcase_23 | AC | 259 ms
93,352 KB |
testcase_24 | AC | 257 ms
93,524 KB |
testcase_25 | AC | 252 ms
93,432 KB |
testcase_26 | AC | 257 ms
93,428 KB |
ソースコード
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(): s = input() nums = set() mozi = 'kadomatsu' for bit in product([0, 1], repeat=9): num = '' for i in range(9): if bit[i] == 1: num += mozi[i] nums.add(num) if s in nums: print('Yes') else: print('No') if __name__ == '__main__': main()