提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
114895	2023-10-24 10:49:11	U_S	C	python	18/18	AC	39

# import sys
# sys.setrecursionlimit(10**7)
# input = sys.stdin.readline
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
def lm1(LIST): return list(map(lambda x:x-1, LIST))
def mps(A):return [tuple(map(int, input().split())) for _ in range(A)]
def stoi(LIST):return list(map(int,LIST))
def itos(LIST):return list(map(str,LIST))
def atoi(LIST): return [ord(i)-ord("a") for i in LIST]
def Atoi(LIST): return [ord(i)-ord("A") for i in LIST]
def bitA(X,A):return X & 1<<A == 1<<A
import math
import bisect
import heapq
import time
from copy import copy as cc
from copy import deepcopy as dc
from itertools import accumulate, product
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = (1<<63)-1
mod = 998244353

s = input()
n = len(s)
for i in range(n-1):
    if s[i] == s[i+1]:
        print("Yes")
        exit()
print("No")

sample1.txt AC 17
sample2.txt AC 20
sample3.txt AC 31
case1.txt AC 38
case2.txt AC 27
case3.txt AC 30
case4.txt AC 30
case5.txt AC 30
case6.txt AC 25
case7.txt AC 25
case8.txt AC 19
case9.txt AC 23
case10.txt AC 26
case11.txt AC 39
case12.txt AC 32
case13.txt AC 31
case14.txt AC 39
case15.txt AC 33
39 AC