結果
問題 | No.1367 文字列門松 |
ユーザー | McGregorsh |
提出日時 | 2022-07-16 21:54:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 160 ms / 2,000 ms |
コード長 | 1,645 bytes |
コンパイル時間 | 162 ms |
コンパイル使用メモリ | 82,340 KB |
実行使用メモリ | 90,368 KB |
最終ジャッジ日時 | 2024-06-28 22:17:26 |
合計ジャッジ時間 | 5,430 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 159 ms
89,856 KB |
testcase_01 | AC | 148 ms
90,092 KB |
testcase_02 | AC | 143 ms
90,216 KB |
testcase_03 | AC | 153 ms
89,984 KB |
testcase_04 | AC | 142 ms
90,028 KB |
testcase_05 | AC | 155 ms
90,112 KB |
testcase_06 | AC | 153 ms
89,728 KB |
testcase_07 | AC | 156 ms
89,600 KB |
testcase_08 | AC | 148 ms
90,084 KB |
testcase_09 | AC | 157 ms
89,856 KB |
testcase_10 | AC | 148 ms
90,244 KB |
testcase_11 | AC | 156 ms
90,240 KB |
testcase_12 | AC | 160 ms
90,240 KB |
testcase_13 | AC | 153 ms
90,240 KB |
testcase_14 | AC | 159 ms
90,240 KB |
testcase_15 | AC | 155 ms
89,984 KB |
testcase_16 | AC | 156 ms
89,856 KB |
testcase_17 | AC | 151 ms
90,368 KB |
testcase_18 | AC | 157 ms
89,728 KB |
testcase_19 | AC | 152 ms
90,112 KB |
testcase_20 | AC | 155 ms
89,856 KB |
testcase_21 | AC | 151 ms
89,856 KB |
testcase_22 | AC | 152 ms
89,856 KB |
testcase_23 | AC | 152 ms
90,368 KB |
testcase_24 | AC | 152 ms
89,856 KB |
testcase_25 | AC | 156 ms
89,600 KB |
testcase_26 | AC | 155 ms
90,112 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()