TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
S = input()

if S == 'Sunny':
  print('Coudy')
elif S == 'Coudy':
  print('Rainy')
else:
  print('Sunny')

S = input()

if S == 'Sunny':
  print('Cloudy')
elif S == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Verdicts: Wrong Answer

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    count = 0
    for i in h:
        if i >= k:
            count += 1
    print(count)

    
    
main()

import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

def main():
    s = input()
    if s[0] == "S":
        print("Cloudy")
        return
    elif s[0] == "C":
        print("Rainy")
        return
    print("Sunny")
    

    
    
main()

Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
N,M = map(int,input().split())
A =list(map(int,input().split()))
A.sort(reverse=True)
A_len =len(A)
count =0
for l in range(0,M):
    comp = A[0]/2
    for i in range(0,A_len-1,1):
        if count >= M:
            break
        if A[i+1]<comp:
            break
        while True:
            count +=1
            if A[i]/2 > A[i+1]:
                A[i] = A[i]/2
            else:
                A[i] = A[i]/2
                break
    A.sort(reverse=True)
    if count>=M:
        break
A = [int(i) for i in A]
sumN =sum(A)
print(sumN)


S = input()
if S =="Sunny":
    print("Cloudy")
if S =="Rainy":
    print("Sunny")
if S =="Cloudy": 
    print("Rainy")

Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
inp = input()

arr = ['Sunny','Cloudy','Rainy']

if inp == 'Sunny':
  print arr[1]
elif inp == 'Cloudy':
  print arr[2]
elif inp == 'Rainy':
  print arr[0]

inp = input()
 
arr = ['Sunny','Cloudy','Rainy']
 
if inp == 'Sunny':
  print (arr[1])
elif inp == 'Cloudy':
  print (arr[2])
elif inp == 'Rainy':
  print (arr[0])

Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
s = input()
if s == "Sunny"
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

s = input()
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
s=input()
temp=["Sunny", "Cloudy", "Rainy"]
i = temp.index(s)
print(temp[0] if i==2 else print(temp[i+1]))

s=input()
temp=["Sunny", "Cloudy", "Rainy"]
i = temp.index(s)
print(temp[0] if i==2 else print(temp[i+1]))

s=input()
if s == "Sunny":print("Cloudy")
elif s == "Cloudy":print("Rainy")
else:print("Sunny")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):

from heapq import heappush, heappop, heapify


obj = input().strip().split(' ')
N, M = map(int, obj)

obj = input().strip().split(' ')
val_list = [-1 * item for item in list(map(int, obj))]

heapify(val_list)

for _ in range(M):
    val = (-1) * ((heappop(val_list) * (-1)) // 2)
    heappush(val_list, val)

print(-1 * sum(val_list))


#!/usr/bin/env python
# -*- coding:utf-8 -*-


obj = input().strip().split(' ')
N, K, Q = map(int, obj)

winner_list = []
for _ in range(Q):
    A_i = int(input().strip())
    winner_list.append(A_i)

point_list = [K for _ in range(N)]

for A_i in winner_list:
    point_list = [k if i == A_i else k - 1 for i in range(1, N + 1)]

is_win = [True if point_list[i] > 0 else False for i in range(N) ]

for i in range(N):
    if is_win[i]:
        print('Yes')
    else:
        print('No')


#!/usr/bin/env python
# -*- coding:utf-8 -*-


S = input().strip()

if S == 'Sunny':
    print('Cloudy')

if S == 'Cloudy':
    print('Rainy')

if S == 'Rainy':
    print('Sunny')


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
import heapq

n, m = map(int,input().split())
A = list(map(lambda x: int(x)*(-1), input().split()))

heapq.heapify(A)

for i in range(m):
    a = heap.heappop(A)
    heapq.heappush(A,-1* (-a//2))
print(-sum(a))

s = input()

if s == "Sunny":
  print("Cloudy")
elif s == "Cloudy":
  print("Rainy")
elif s == "Rainy":
  print("Sunny")

Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
N = int(input())
n = N - N//2
print(n / N)

S = list(input())
if S[0] == 'S':
    print('Cloudy')
elif S[0] == 'C':
    print('Rainy')
elif S[0] == 'R':
    print('Sunny')

S = list(input())
if S[0] == 'S':
    print('Cloudy')
elif S[0] == 'C':
    print('Rainy')
elif S[0] == 'R':
    print('Sunny')

Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
S = input()

if s == "Sunny":
  print("Cloudy")
elif s == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

s = input()
 
if s == "Sunny":
  print("Cloudy")
elif s == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
S = input()
if S == "Sunny":
    print("Cloudy")
elif S =="Cloudy":
    print("Rainy"):
else:
    print("Sunny")

S = input()
if S == "Sunny":
    print("Cloudy")
elif S =="Cloudy":
    print("Rainy")
elif S==("Rainy"):
    print("Sunny")

Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
S = input()
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy"
	print("Rainy")
else:
  print("Sunny")

S = input()
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
	print("Rainy")
else:
  print("Sunny")

Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
s=["Sunny","Cloudy","Rainy"]
a=input()
if a=="Sunny":
    print(Cloudy)
elif a=="Cloudy":
    print(Rainy)
else:
    print(Sunny)

a=input()
i=0
while(i<len(a)):
    if(i%2==0):
        if a[i]=="L":
            print("No")
            break
    else:
        if a[i]=="R":
            print("No")
            break
    i=i+1
else:
    if(i==len(a)):
        print("Yes")


s=["Sunny","Cloudy","Rainy"]
a=input()
if a=="Sunny":
    print("Cloudy")
elif a=="Cloudy":
    print("Rainy")
else:
    print("Sunny")


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
l = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']
s = input()
flg = Flase
for i in l:
  if flg == True:
    print(i)
    exit()
  if s == i:
    flg = True


l = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']
s = input()
flg = False
for i in l:
  if flg == True:
    print(i)
    exit()
  if s == i:
    flg = True


Verdicts: Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
S = input(str())
 if S == Sunny:
     print(Cloudy)
 elif S == Cloudy:
     print(Rainy)
 else :
     print(Sunny)

S = input()
 if S == Sunny:
     print(Cloudy)
 elif S == Cloudy:
     print(Rainy)
 else :
     print(Sunny)

S = input(string())
 if S == Sunny:
     print(Cloudy)
 elif S == Cloudy:
     print(Rainy)
 else :
     print(Sunny)

s = input()

if s == 'Sunny':
    print('Cloudy')
elif s == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
S = input()

if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy"):
elif S == "Rainy":
  print("Sunny")

N,K,Q = map(int, input().split())

P = [0] * N


 
for i in range(Q):
	A = int(input())
	P[A-1] += 1


for j in range(0,len(P)):
	if K - Q + P[j] > 0:
		print('Yes')
	else:
		print('No')

S = input()
 
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
elif S == "Rainy":
  print("Sunny")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
N, K, Q = [int(s) for s in input().split()]
A = [0] * N
for i in range(N):
    A[int(input()) - 1] += 1

for a in A:
    print('Yes' if (K - Q + a) > 0 else 'No')

N, K, Q = [int(s) for s in input().split()]
A = [0] * N
for i in range(N):
    A[int(input()) - 1] += 1

for a in A:
    print('Yes' if (K - Q + a) > 0 else 'No')

S = input()
if S[0] == 'S':
    print('Cloudy')
elif S[0] == 'C':
    print('Rainy')
else:
    print('Sunny')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
s=input()
l=['Sunny', 'Cloudy', 'Rainy']
print(l.index(s)-1)

s=input()
l=['Sunny', 'Cloudy', 'Rainy']
print(3-l.index(s))

l=['Sunny','Cloudy','Rainy'];print(l.index(input())-1)

l=['Sunny','Cloudy','Rainy'];print(l[l.index(input())-2])

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
S = ['Sunny', 'Cloudy', 'Rainy']
today = input('S')

if today == 'Sunny':
  num = 1
elif today == 'Cloudy':
  num = 2
elif today == 'Rainy':
  num = 0

print(S[num])

weather_list = ['Sunny', 'Cloudy', 'Rainy']

today = input('S')

if today == 'Sunny':
  num = 1
elif today == 'Cloudy':
  num = 2
elif today == 'Rainy':
  num = 0

print(weather_list[num])

S = ['Sunny', 'Cloudy', 'Rainy']
today = input('S')

if today == 'Sunny':
  num = 0
elif today == 'Cloudy':
  num = 1
elif today == 'Rainy':
  num = 2

print(S[num + 1])

weather_list = ['Sunny', 'Cloudy', 'Rainy']

today = input()

if today == 'Sunny':
  num = 1
elif today == 'Cloudy':
  num = 2
elif today == 'Rainy':
  num = 0

print(weather_list[num])

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...  Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Submission attempts (in order):
x=input()
if x=="sunny":
  print("cloudy")
elif x=="cloudy":
  print("rainy")
else:
  print("sunny")

x=input()
if x=="Sunny":
  print("Cloudy")
elif x=="Cloudy":
  print("Rainy")
else:
  print("Sunny")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
import sys
list=input()
def split(a): 
    return [char for char in a]
list=split(list)
even_count=0
odd_count=0
for i in list:
  if even_count%2==0:
      even_count+=1
      continue
  if list[even_count]=="R":
    print("NO")
    sys.exit()
  even_count+=1
for i in list:
  if odd_count%2==1:
      odd_count+=1
      continue
  if list[odd_count]=="L":
    print("NO")
    sys.exit()
  odd_count+=1
print("YES")



import sys
list=input()
def split(a): 
    return [char for char in a]
list=split(list)
even_count=0
odd_count=0
for i in list:
  if even_count%2==0:
      even_count+=1
      continue
  if list[even_count]=="R":
    print("NO")
    sys.exit()
  even_count+=1
for i in list:
  if odd_count%2==1:
      odd_count+=1
      continue
  if list[odd_count]=="L":
    print("NO")
    sys.exit()
  odd_count+=1
print("YES")



import sys
list=input()
def split(a): 
    return [char for char in a]
list=split(list)
even_count=0
odd_count=0
for i in list:
  if even_count%2==0:
      even_count+=1
      continue
  if list[even_count]=="R":
    print("No")
    sys.exit()
  even_count+=1
for i in list:
  if odd_count%2==1:
      odd_count+=1
      continue
  if list[odd_count]=="L":
    print("No")
    sys.exit()
  odd_count+=1
print("Yes")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
S = list(map(int, input().split()))
Sodd = S.Slice[::2]
Seven = S.Slice[1::2]
if "L" in Sodd:
  print("No")
elif "R" in Seven:
  print("No")
else:
  Print("Yes")

S = list(input())

Sodd = S[::2]
Seven = S[1::2]

if "L" in Sodd:
  print("No")
elif "R" in Seven:
  print("No")
else:
  print("Yes")

Verdicts: Runtime Error

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
S=input()
count=0
for i in range(1,len(S)):
  if i%2==0:
      if S[i-1]=='L':
        count+=1
  else:
      if S[i-1]=='R':
          count+=1
if count==0:
  print("Yes")
else:
  print("No")

S=input()
count=0
for i in range(1,len(S)+1):
  if i%2==0:
      if S[i-1]=='R':
        count+=1
  else:
      if S[i-1]=='L':
          count+=1
if count==0:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
list_1=[w for w in input()]
result='Yes'
even_list=['L','U','D']
odd_list=['R','U','D']
for item in list_1[::2]:
  if item not in even_list:
    result='No'
    print (result)
    exit()
for item in list_1[1::2]:
  if item not in odd_list:
    result='No'
    print (result)
    exit()
print (result)

s=input()
print('No') if 'L' in s[::2] or 'R' in s[1::2] else print('Yes')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
import sys

s = list(input())

for i in range(len(s)):
  if i % 2 == 1:
    if s[i] == "R" or s[i] == "U"or s[i] == "D":
      continue
    else:
      print("No")
      sys.exit()
  else:
    if s[i] == "L" or s[i] == "U"or s[i] == "D":
      continue
    else:
      print("No")
      sys.exit()

print("Yes")

import sys

s = list(input())

for i in range(len(s)):
  if i % 2 == 1:
    if s[i] == "L" or s[i] == "U"or s[i] == "D":
      continue
    else:
      print("No")
      sys.exit()
  else:
    if s[i] == "R" or s[i] == "U"or s[i] == "D":
      continue
    else:
      print("No")
      sys.exit()

print("Yes")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
A=input()
for i in A[::2]:
  if not i in ["L","U","D"]:
    print("No")
    exit()
for i in A[1::2]:
  if not i in ["R","U","D"]:
    print("No")
    exit()
print("Yes")

A=input()
for i in A[::2]:
  if not i in ["R","U","D"]:
    print("No")
    exit()
for i in A[1::2]:
  if not i in ["L","U","D"]:
    print("No")
    exit()
print("Yes")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
RDULULDURURLRDULRLR

RDULULDURURLRDULRLR

S = input()
odd = set(["R","U","D"])
even = set(["L","U","D"])
ok = True
for s in S[::2]:
    if s not in odd:
        ok = False
if len(S) > 1:
    for s in S[1::2]:
        if s not in even:
            ok = False
print("Yes" if ok else "No")


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
play = True
s = input()

for i in range(len(s)):
  if i%2 == 0:
    if s[i] =='L':
      play = False
  else:
    if s[i] == 'R':
      play = False
if play:
  print("YES")
else:
  print("NO")

play = True
s = input()

for i in range(len(s)):
  if i%2 == 0:
    if s[i] =='R' or s[i] == 'U' or s[i] == 'D':
      pass
    else:
      play = False
  else:
    if s[i] == 'L' or s[i] == 'U' or s[i] == 'D':
      pass
    else:
      play = False
if play:
  print("YES")
else:
  print("NO")

play = True
s = input()

for i in range(len(s)):
  if i%2 == 0:
    if s[i] =='L':
      play = False
  else:
    if s[i] == 'R':
      play = False
if play:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
S = input()

ctr = True
for i in range(len(S)):
    print(i)
    print(S[i])
    if i%2 ==0:
        
        if S[i]!='L' and S[i]!='U' and S[i]!='D':
            ctr = False
            print('No')
            # break
    else:
        
        if S[i]!='R' and S[i]!='U' and S[i]!='D':
            ctr = False
            print('No')
            # break

if(ctr):
    print('Yes')

S = input()

ctr = True
for i in range(len(S)-1):
    print(i)
    print(S[i])
    if i%2 ==0:
        
        if S[i]!='R' and S[i]!='U' and S[i]!='D':
            ctr = False
            print('No')
            break
    else:
        
        if S[i]!='L' and S[i]!='U' and S[i]!='D':
            ctr = False
            print('No')
            break

if(ctr):
    print('Yes')

S = input()

ctr = True
for i in range(len(S)):
    print(i)
    print(S[i])
    if i%2 ==0:
        
        if S[i]!='L' and S[i]!='U' and S[i]!='D':
            ctr = False
            print('No')
            break
    else:
        
        if S[i]!='R' and S[i]!='U' and S[i]!='D':
            ctr = False
            print('No')
            break

if(ctr):
    print('Yes')

S = input()

s = True
for i in range(len(S)-1):
    if i%2 ==0:
        if S[i]!='L' and S[i]!='U' and S[i]!='D':
            s = False
            print('No')
            break
    else:
        if S[i]!='R' and S[i]!='U' and S[i]!='D':
            s = False
            print('No')
            break
if(s):
    print('Yes')

S = input()

ctr = True
for i in range(len(S)):
    if i%2 ==0:
        
        if S[i]!='R' and S[i]!='U' and S[i]!='D':
            ctr = False
            print('No')
            break
    else:
        
        if S[i]!='L' and S[i]!='U' and S[i]!='D':
            ctr = False
            print('No')
            break

if(ctr):
    print('Yes')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
S =input()
l =len(S)
letters=[]
for i in range(l):
  letters.append(S[i:i+1])
#print(letters)
indicater =0

if l%2==0:
  for i in range(l//2):
    if (letters[2*i]=="R" or letters[2*i]=="U" or letters[2*i]=="D") and (letters[2*i+1]=="L" or letters[2*i+1]=="U" or letters[2*i+1]=="D"):
      indicater=indicater+0
    else:
      indicater=indicater+1
if l%2==1:
  for i in range((l+1)//2):
    if (letters[2*i]=="R" or letters[2*i]=="U" or letters[2*i]=="D"):
      indicater=indicater+0
    else:
      indicater=indicater+1
  for i in range((l-1)//2):
    if (letters[2*i+1]=="L" or letters[2*i+1]=="U" or letters[2*i+1]=="D"):
      indicater =indicater+0
    else:
      indicater =indicater+1
#print(indicater)
if indicater==0:
  print("YES")
else:
  print("NO")

S =input()
l =len(S)
letters=[]
for i in range(l):
  letters.append(S[i:i+1])
#print(letters)
indicater =0

if l%2==0:
  for i in range(l//2):
    if (letters[2*i]=="R" or letters[2*i]=="U" or letters[2*i]=="D") and (letters[2*i+1]=="L" or letters[2*i+1]=="U" or letters[2*i+1]=="D"):
      indicater=indicater+0
    else:
      indicater=indicater+1
if l%2==1:
  for i in range((l+1)//2):
    if (letters[2*i]=="R" or letters[2*i]=="U" or letters[2*i]=="D"):
      indicater=indicater+0
    else:
      indicater=indicater+1
  for i in range((l-1)//2):
    if (letters[2*i+1]=="L" or letters[2*i+1]=="U" or letters[2*i+1]=="D"):
      indicater =indicater+0
    else:
      indicater =indicater+1
#print(indicater)
if indicater==0:
  print("Yes")
else:
  print("No")
  

Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
import sys
N = input()
b=0

for i in range (len(N)):
    if i%2==0:
        if N[i]!="R" or N[i]!="U" or N[i]!="D":
            b=1
    else:
        if N[i]!="L" or N[i]!="U" or N[i]!="D":
            b=1

if b==0:
    print("Yes")
else:
    print("No")


import sys
N = input()
b=0

for i in range (len(N)):
    if i%2==0:
        if N[i]=="L":
            b=1
    else:
        if N[i]=="R":
            b=1

if b==0:
    print("Yes")
else:
    print("No")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
n = str(input())
d = []
p = []
i = 1
s = 1
l = 1
for k in n:
 if i % 2 == 0:
  if k == "R" or k == "U" or k == "D":
   pass
  else:
   s = 0
 else:
  if k == "L" or k == "U" or k == "D":
   pass
  else:
    l = 0
 i = i + 1
if s and l == "1":
 print("Yes")
else:
 print("No")

n = str(input())
d = []
p = []
i = 1
s = 1
l = 1
for k in n:
 if i % 2 == 0:
  if k == "R" or k == "U" or k == "D":
   pass
  else:
   s = 0
 else:
  if k == "L" or k == "U" or k == "D":
   pass
  else:
    l = 0
 i = i + 1
if s or l == "1":
 print("Yes")
else:
 print("No")

n = str(input())
d = []
p = []
i = 1
s = 1
l = 1
for k in n:
 if i % 2 == 0:
  if k == "L" or k == "U" or k == "D":
   pass
  else:
   s = 0
 else:
  if k == "R" or k == "U" or k == "D":
   pass
  else:
    l = 0
 i = i + 1
if s and l == "1":
 print("Yes")
else:
 print("No")

n = str(input())
d = []
p = []
i = 1
s = 1
l = 1
for k in n:
 if i % 2 == 0:
  if k == "R" or k == "U" or k == "D":
   
  else:
   
   s = 0
 else:
  if k == "L" or k == "U" or k == "D":
   
  else:
    
    l = 0
 i = i + 1
if s or l == "1":
 print("Yes")
else:
 print("No")

n = str(input())
d = []
p = []
i = 1
s = 1
l = 1
for k in n:
 if i % 2 == 0:
  if k == "R" or k == "U" or k == "D":
   pass
  else:
   pass
   s = 0
 else:
  if k == "L" or k == "U" or k == "D":
   pass
  else:
    pass
    l = 0
 i = i + 1
if s or l == "1":
 print("Yes")
else:
 print("No")

n = str(input())
d = []
p = []
i = 1
s = 1
l = 1
for k in n:
 if i % 2 == 0:
  if k == "L" or k == "U" or k == "D":
   pass
  else:
   s = 0
 else:
  if k == "R" or k == "U" or k == "D":
   pass
  else:
    l = 0
 i = i + 1
#print(s,l)
if s and l == 1:
 print("Yes")
else:
 print("No")


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
s = input()
kisuu = ['R', 'U', 'D']
guusuu = ['L', 'U', 'D']
for i in s[::2]:
    if i in kisuu:
        continue
    else:
        print('No')
        quit()
for j in s[2::2]:
    if j in guusuu:
        continue
    else:
        quit()
print('Yes')

s = input()
kisuu = ['R', 'U', 'D']
guusuu = ['L', 'U', 'D']
for i in s[::2]:
    if i in kisuu:
        continue
    else:
        print('No')
        quit()
for j in s[1::2]:
    if j in guusuu:
        continue
    else:
        print('No')
        quit()
print('Yes')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
s = input()

for i in range(len(s))
	if i%2==0 and s(i)=='R':
    print('No')
    exit
    elif i%2==1 and s(i)=='L':
    print('No')
    exit
print('Yes')

s = input()
 
for i in range(len(s)):
	if i%2==0 and s[i]=='R':
		print('No')
		exit()
	elif i%2==1 and s[i]=='L':
		print('No')
		exit()
 
print('Yes')

s = input()
 
for i in range(len(s))
	if i%2==0 and s[i]=='R':
    	print('No')
    	exit()
    elif i%2==1 and s[i]=='L':
    	print('No')
    	exit()
 
print('Yes')

s = input()
 
for i in range(len(s))
	if i%2==0 and s(i)=='R':
    print('No')
    exit()
    elif i%2==1 and s(i)=='L':
    print('No')
    exit()

print('Yes')

from sys import exit
s=input()
n=len(s)
for i in range(0,n,2):
	if s[i]=="L":
		print("No")
		exit()
for i in range(1,n,2):
	if s[i]=="R":
		print("No")
		exit()
print("Yes")

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
S=input()
flag=0
for i in range(0,len(S)):
  if i%2==1 and S[i]=='L':
    flag=1
  if i%2==0 and S[i]=='R':
    flag=1
if flag==0:
  print('Yes')
else:
  print('No')


S=input()
flag=0
for i in range(0,len(S)):
  if i%2==0 and S[i]=='L':
    flag=1
  if i%2==1 and S[i]=='R':
    flag=1
if flag==0:
  print('Yes')
else:
  print('No')


Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
s = input()

even = []
odd = []
for i, elem in enumerate(s):
  if i % 2 == 0:
    odd.append(elem)
  else:
    even.append(elem)

if list(set(even)) in ['D', 'U', 'L'] and list(set(odd)) in ['U', 'R', 'D']:
  print("Yes")
else:
  print("No")

s = input()

even = []
odd = []
for i, elem in enumerate(s):
  if i % 2 == 0:
    odd.append(elem)
  else:
    even.append(elem)

if all(elem in ['D', 'U', 'L'] for elem in list(set(even))) and all(elem in ['U', 'R', 'D'] for elem in list(set(odd))):
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
S = input()
# L = len(S) % 2
youtube = 0
ようつべ = 0
for i in range(len(S)):
  if i % 2 == 0:
    if S[i] == "L" or S[i] == "U" or S[i] == "D":
      youtube += 1
  else:
    ようつべ += 1
# if S[2] % 2 == 0:
if youtube == 1:
  print("Yes")
elif ようつべ == 1:
  print("No")

S = input()
# L = len(S) % 2
for i in range()
  if i % 2 == 0:
    if S[i] == "R" or S[i] == "U" or S[L] == "D":
      print("Yes")
  else:
    print("No")

S = input()
# L = len(S) % 2
youtube = 0

for i in range(len(S)):
  if i % 2 == 0: 
    if S[i] == "L":
      youtube += 1
  else:
    if S[i] == "R":
      youtube += 1
if youtube > 0:
  print("No")
else:
  print("Yes")

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
a=S[::2]
b=S[1::2]
if 'L' not in a:
	pass
	if 'R' not in b:
		print('Yes')
else:
	print('No')

S
a=S[::2]
b=S[1::2]
if 'L' not in a:
	pass
	if 'R' not in b:
		print('Yes')
else:
	print('No')

S=input()
a=S[::2]
b=S[1::2]
if 'L' not in a:
	if 'R' not in b:
		print('Yes')
    else:
		print('No')
else:
	print('No')

S=input()
a=S[::2]
b=S[1::2]
if 'L' not in a:
	if 'R' not in b:
		print('Yes')
    else:
    	print('No')
else:
	print('No')

S=input()
a=S[::2]
b=S[1::2]
if 'L' not in a:
	if 'R' not in b:
		print('Yes')
	elif 'R' in b:
		print('No')
elif 'L' in a:
	print('No')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
line=input()

a=['R','U','D']
b=['L','U','D']
flag=True

for i in range(len(line)):
  if (i+1)%2==1:
    if line[i] not in a:
      fline=input()

a=['R','U','D']
b=['L','U','D']
flag=True

for i in range(len(line)):
  if not flag:
    print(flag)
    break
  if (i+1)%2==1:
    if line[i] not in a:
      flag=False
      print('No')
  else:
    if line[i] not in b:
      flag=False
      print('No')
if flag==True:
  print('Yes') lag==False
      print('No')
      break
  else:
    if line[i] not in b:
      flag==False
      print('No')
      break

if flag:
  print('Yes')         

line=input()

a=['R','U','D']
b=['L','U','D']
flag=True

for i in range(len(line)):
  if not flag:
    break
  if (i+1)%2==1:
    if line[i] not in a:
      flag=False
      print('No')
  else:
    if line[i] not in b:
      flag=False
      print('No')
if flag==True:
  print('Yes')         

Verdicts: Runtime Error

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
"""
abc141-b
"""

S = input()

ans="Yes"

for i in range(int(len(S))):
    if (i % 2 == 0):
        if (S[i] == "L"):
            ans="No"
            break
    else:
        if (S[i] == "R"):
            ans="No"
            break
print(ans

"""
abc141-b
"""

S = input()

ans="Yes"

for i in range(int(len(S))):
    if (i % 2 == 0):
        if (S[i] == "L"):
            ans="No"
            break
    else:
        if (S[i] == "R"):
            ans="No"
            break
print(ans)

Verdicts: Runtime Error

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
s=list(input())
print(s)
odd = [s[i] for i in range(0, len(s), 2)]
even = [s[i] for i in range(1, len(s), 2)]
#print(odd,even)

if "R" in even or "L"in odd:
  print("No")
else:
  print("Yes")


s=list(input())
#print(s)
odd = [s[i] for i in range(0, len(s), 2)]
even = [s[i] for i in range(1, len(s), 2)]
#print(odd,even)

if "R" in even or "L"in odd:
  print("No")
else:
  print("Yes")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
S = input()

#print(len(S))
flag= 0
for i in range(len(S)):
	#print(i,S[i])
	if i % 2 == 0:
		if S[i] != "L" and S[i] != "U" and  S[i] != "D":
			#print(i,S[i])
			flag = 1
	elif i % 2 !=0:
		if S[i] != "R" and S[i] != "U" and  S[i] != "D":
			#print(i,S[i])
			flag = 1

if flag == 0:
	print("Yes")
else:
	print("No")

S = input()

#print(len(S))
flag= 0
for i in range(len(S)):
	#print(i,S[i])
	if i % 2 == 0:
		if S[i] != "L" and S[i] != "U" and  S[i] != "D":
			#print(i,S[i])
			flag = 1
	elif i % 2 !=0:
		if S[i] != "R" and S[i] != "U" and  S[i] != "D":
			#print(i,S[i])
			flag = 1

if flag == 0:
	print("Yes")
else:
	print("No")

S = input()

#print(len(S))
flag= 0
for i in range(len(S)):
	#print(i,S[i])
	if i % 2 == 0:
		if S[i] != "L" and S[i] != "U" and  S[i] != "D":
			#print(i,S[i])
			flag = 1
	elif i % 2 !=0:
		if S[i] != "R" and S[i] != "U" and  S[i] != "D":
			#print(i,S[i])
			flag = 1

if flag == 0:
	print("Yes")
else:
	print("No")

S = input()

#print(len(S))
flag= 0
for i in range(len(S)):
	#print(i,S[i])
	if i % 2 == 0:
		if S[i] == "L" :
			#print(i,S[i])
			flag = 1
	elif i % 2 !=0:
		if S[i] == "R" :
			#print(i,S[i])
			flag = 1

if flag == 0:
	print("Yes")
else:
	print("No")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
import sys
import math
s=list(map(str,input()))
for i in range(math.ceil(len(s)/2)):
    if s[2*i]!='L' and s[2*i]!='U' and s[2*i]!='D':
        print('No')
        sys.exit()
for j in range(len(s)//2):
    if [2*i+1]!='R' and s[2*i+1]!='U' and s[2*i+1]!='D':
        print('No')
        sys.exit()
print('Yes')   

import sys
import math
s=list(map(str,input()))
for i in range(math.ceil(len(s)/2)):
    if s[2*i]!='R':
        print('No')
        sys.exit()
for j in range(len(s)//2):
    if [2*i+1]!='L':
        print('No')
        sys.exit()
print('Yes')   

import sys
s=list(map(str,input()))
for i in range(len(s)):
    if i%2==0 and s[i]=='L':
        print('No')
        sys.exit()
    else:
        if i%2==1 and s[i]=='R':
            print('No')
            sys.exit()
print('Yes')   

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.  S is said to be _easily playable_ if and only if it satisfies both of the following conditions:    * Every character in an odd position (1-st, 3-rd, 5-th, \ldots) is `R`, `U`, or `D`.   * Every character in an even position (2-nd, 4-th, 6-th, \ldots) is `L`, `U`, or `D`.  Your task is to print `Yes` if S is easily playable, and `No` otherwise.

Submission attempts (in order):
s = input()
for i, j in enumerate(s):
    if i % 2 != 0:
        if j == 'L':
            print('No')
            exit()
    else:
        if j == 'R':
            print('No')
            exit()
print('Yes')


s = input()
for i, j in enumerate(s):
    if i % 2 == 0:
        if j == 'L':
            print('No')
            exit()
    else:
        if j == 'R':
            print('No')
            exit()
print('Yes')


Verdicts: Wrong Answer

Accepted