結果
問題 | No.2322 MMA文字列 |
ユーザー | McGregorsh |
提出日時 | 2023-05-28 21:46:42 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 259 ms / 2,000 ms |
コード長 | 1,566 bytes |
コンパイル時間 | 279 ms |
コンパイル使用メモリ | 86,784 KB |
実行使用メモリ | 92,540 KB |
最終ジャッジ日時 | 2023-08-27 16:41:50 |
合計ジャッジ時間 | 7,307 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 255 ms
92,540 KB |
testcase_01 | AC | 251 ms
92,332 KB |
testcase_02 | AC | 253 ms
92,236 KB |
testcase_03 | AC | 251 ms
92,492 KB |
testcase_04 | AC | 250 ms
92,508 KB |
testcase_05 | AC | 253 ms
92,356 KB |
testcase_06 | AC | 253 ms
92,356 KB |
testcase_07 | AC | 251 ms
92,400 KB |
testcase_08 | AC | 251 ms
92,216 KB |
testcase_09 | AC | 251 ms
92,328 KB |
testcase_10 | AC | 250 ms
92,368 KB |
testcase_11 | AC | 257 ms
92,324 KB |
testcase_12 | AC | 254 ms
92,292 KB |
testcase_13 | AC | 256 ms
92,364 KB |
testcase_14 | AC | 253 ms
92,444 KB |
testcase_15 | AC | 254 ms
92,212 KB |
testcase_16 | AC | 258 ms
92,376 KB |
testcase_17 | AC | 256 ms
92,260 KB |
testcase_18 | AC | 256 ms
92,320 KB |
testcase_19 | AC | 253 ms
92,348 KB |
testcase_20 | AC | 259 ms
92,224 KB |
testcase_21 | AC | 255 ms
92,416 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, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' #input = sys.stdin.readline def main(): S = list(input()) if S[0] == S[1] and len(set(S)) == 2: print('Yes') else: print('No') if __name__ == '__main__': main()