TnT/Multi_CodeNet4Repair huggingface dataset:
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):
def tapdance(s):
    for i in range(len(s)):
        if i % 2 == 0:
            if s[i] = 'L':
                return 'No'
        else:
            if s[i] = 'R':
                return 'No'
    return 'Yes'
s = input()
print(tapdance(s))


def tapdance(s):
    for i in range(len(s)):
        if i % 2 == 0:
            if s[i] != 'L':
                return 'No'
        else:
            if s[i] != 'R':
                return 'No'
    return 'Yes'
s = input()
print(tapdance(s))


def tapdance(s):
    for i in range(len(s)):
        if i % 2 == 0:
            if s[i] == 'L':
                return 'No'
        else:
            if s[i] == 'R':
                return 'No'
    return 'Yes'
s = input()
print(tapdance(s))


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()
a = 0
for i in renge(len(S)):
  if i%2==1 :
    S[i] != "L"
    a += 1
  else:
    S[i] != "R"
    a += 1
if a == len(S):
  print("Yes")
else:
  print("No")

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

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

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

Verdicts: Runtime Error

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()
a = 0
n = len(s)

for i in range (n):
    if i % 2 == 0:
        if s[i] != "R":
            a=a+1
    if i % 2 == 1:
        if s[i] != "L":
            a=a+1
if a == len(s):
    print('Yes')
else:
    print('NO')

import numpy as np

s = input()
int a = 0

for i in range len(s):
    if i % 2 == 0:
        if a[i] != "R":
            a++
    if i % 2 == 1:
        if a[i] != "L":
            a++
    if a == len(s):
        print('Yes')
    else:
        print('NO')
  
  

s = input()
a = 0
n = len(s)

for i in range (n):
    if i % 2 == 1:
        if s[i] != "R":
            a=a+1
    if i % 2 == 0:
        if s[i] != "L":
            a=a+1
if a == len(s):
    print('Yes')
else:
    print('No')
  

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):
# coding: utf-8

str = input()
table = list(str)
print(table)

# coding: utf-8

str = input()
table = list(str)
count = 0
for i in range(len(table)):
    if i % 2 == 0:
      if table[i] == 'R' or table[i] == 'U' or table[i] == 'D':
         count += 1
    elif i % 2 == 1:
      if table[i] == 'L' or table[i] == 'U' or table[i] == 'D':
         count += 1

if count == len(str):
    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())
c = []
for i in range(len(N)):
    if i % 2 == 0:
        if i == 'L' or i == 'U' or i == 'D':
            c.append(i)

    else:
        if i =='R' or i == 'U' or i == 'D':
            c.append(i)



if len(c) == len(N):
    print('Yes')
else:
    print('No')

N = str(input())
c = []
for i in range(0,len(N)-1):
    if i % 2 == 0:
        if N[i] == 'R' or N[i] == 'U' or N[i] == 'D':
            c.append(N[i])
    else:
        if N[i] =='L' or N[i] == 'U' or N[i] == 'D':
            c.append(N[i])



if len(c) == len(N):
    print('Yes')
else:
    print('No')

N = str(input())
c = []
for i in range(0,len(N)):
    if i % 2 == 0:
        if i == 'R' or i == 'U' or i == 'D':
            c.append(i)

    else:
        if i =='L' or i == 'U' or i == 'D':
            c.append(i)



if len(c) == len(N):
    print('Yes')
else:
    print('No')

N = str(input())
a = ['R','U','D']
b = ['L','U','D']
c = 0
for i in range(0, len(N)):
    if i % 2 == 0:
        if N[i] in a:
            c += 1

    else:
        if N[i] in b:
            c += 1


if c == len(N):
    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):
S = input()

for i in range(len(S)):
  if i % 2 == 0:
    if S[i] in {'L','U','D'}:
      continue
    else:
      print('No')
      exit()
  else:
    if S[i] in {'R','U','D'}:
      continue
    else:
      print('No')
      exit()

print('Yes')

S = input()

for i in range(len(S)):
  if i % 2 == 0:
    if S[i] in {'R','U','D'}:
      continue
    else:
      print('No')
      exit()
  else:
    if S[i] in {'L','U','D'}:
      continue
    else:
      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):
S = list(input())
check = 0
for i in range(len(S)):
  if i % 2 == 0:
    if (S[i] == 'R' or S[i] == 'U' or S[i] == 'D') and len(S) >= 1 and len(S) <= 100:
        check += 1
  elif i % 2 == 1:
    if (S[i] == 'L' or S[i] == 'U' or S[i] == 'D') and len(S) >= 1 and len(S) <= 100:
        check += 1

if check == len(S):
    print('yes')
else:
    print('no')

S = list(input())
check = 0
for i in range(len(S)):
  if i % 2 == 0:
    if (S[i] == 'R' or S[i] == 'U' or S[i] == 'D') and len(S) >= 1 and len(S) <= 100:
        check += 1
  elif i % 2 == 1:
    if (S[i] == 'L' or S[i] == 'U' or S[i] == 'D') and len(S) >= 1 and len(S) <= 100:
        check += 1

if check == len(S):
    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):
def inpl():
    return list(map(int, input().split()))


S = input()

p = re.compile(r'([^L][^R])*[^L]?$')

if p.match(S):
    print('Yes')
else:
    print('No')

import re


def inpl():
    return list(map(int, input().split()))


S = input()

p = re.compile(r'^([^L][^R])*[^L]?$')

if p.match(S):
    print('Yes')
else:
    print('No')

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())

l=[]
for i in s[1::2]:
  l.append(i)

new_l=[]
for i in s[::2]:
  new_l.append(i)

num='No'
for a,b in zip(new_l,l):
  print(a,b)
  if a == 'U' or a == 'R' or a == 'D':
    if b == 'U' or b == 'L' or b == 'D':
      num='Yes'
  else:
    num='No'
print(num)
  
  
  

s=list(input())

l=[]
for i in s[1::2]:
  l.append(i)

new_l=[]
for i in s[::2]:
  new_l.append(i)
ans=0
if 'L' in new_l:
  ans='No'
else:
  ans='Yes'
num=0
if 'R' in l:
  num='No'
else:
  num='Yes'

if ans == 'Yes' and num == 'Yes':
  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):
text = input()

flg = 0
for i in range(len(text)):
	if i%2 == 0:
		if text[i:i+1] != 'R' and text[i:i+1] and 'U' and text[i:i+1] != 'D':
			flg = 1
	else:
		if  text[i:i+1] != 'U' and text[i:i+1] and 'U' and text[i:i+1] != 'D':
			flg = 1
if flg == 1:
	print('No')
else:
	pring('Yes')

text = input()

flg = 0
for i in range(len(text)):
	if i%2 == 0:
		if text[i:i+1] != 'R' and text[i:i+1] and 'U' and text[i:i+1] != 'D':
			flg = 1
	else:
		if  text[i:i+1] != 'L' and text[i:i+1] and 'U' and text[i:i+1] != 'D':
			flg = 1
if flg == 1:
	print('No')
else:
	print('Yes')

text = input()
 
flg = 0
for i in range(len(text)):
	if i%2 == 0:
		if text[i:i+1] != 'R' and text[i:i+1] != 'U' and text[i:i+1] != 'D':
			flg = 1
	else:
		if  text[i:i+1] != 'L' and text[i:i+1] != 'U' and text[i:i+1] != 'D':
			flg = 1
if flg == 1:
	print('No')
else:
	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 in range(int(S)):
  if S[2i]!='L' and S[2i+1]!='R':
    print('Yes')
  else:
    print('No')

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

S=input()

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

S=input()
ans='Yes'

for i in range(0,int(len(S))):
  if i%2==0:
    if S[i]=='L':
        ans='No'
        break
  elif i%2==1:
    if S[i]=='R':
        ans='No'
        break
print(ans)

Verdicts: Runtime Error

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();print('Yes' if ('L' in S[::2]) == 1 or ('R' in S[1::2] == 1) else 'No')

S=input();print('Yes' if ('L' not in S[::2])  and ('R' not in S[1::2]) else '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()
flg=0
for i in range(len(S)):
    if i/2==0:
        if S[i]=="L":
            flg=1
            break
    else:
        if S[i]=="R":
            flg=1
            break

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

S=input()
flg=0
for i in range(len(S)):
    if i%2==0:
        if S[i]=="L":
            flg=1
            break
    else:
        if S[i]=="R":
            flg=1
            break

if flg==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):
even = ('L','U','D')
odd = ('R','U','D')

step = (even,odd)
s = input()
for i in range(len(s)):
  c = s[i]
  if c in step[i%2]:
    continue
  else:
    print('No')
    break
else:
  print('Yes')

even = ('L','U','D')
odd = ('R','U','D')

step = (even,odd)
s = input()
for i in range(len(s)):
  c = s[i]
  if c in step[1- i%2]:
    continue
  else:
    print('No')
    break
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()
ans = 'Yes'
for i in range(len(s)):
  if i%2 == 0:
    if s[i] == 'R':
      ans = 'No'
      break
  else:
    if s[i] == 'L':
      ans = 'No'
      break
print(ans)

s = input()
ans = 'Yes'
for i in range(len(s)):
  if i%2 == 0:
    if s[i] == 'L':
      ans = 'No'
      break
  else:
    if s[i] == 'R':
      ans = 'No'
      break
print(ans)

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()

def oj():
  for i in S[0::2]:
    if i == "L":
      return "n"
    break
  else:
    return "y"
  
def ej():
  for i in S[1::2]:
    if i == "R":
      return "n"
    break
  else:
    return "y"

def j(o,e):
  if o == "y" and e == "y":
    print("Yes")
  else:
    print("No")

j(oj(),ej())

S = input()


def oj():
  o = "y"
  
  for i in S[0::2]:
    if i == "L":
      o = "n"
  return o
  

def ej():
  e = "y"
  
  for i in S[1::2]:
    if i == "R":
      e = "n"
  return e
  

def j(o,e):
  if o == "y" and e == "y":
    print("Yes")
  else:
    print("No")

j(oj(),ej())

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 in range(len(s)):
    if i%2:
        odd.append(s[i])
    else:
        even.append(s[i])
e = list(set(odd))
o = list(set(even))
print('o: ',o,'e: ',e)
if('L' in o or 'R' in e):
    print('No')
else:
    print('Yes')

s = input()
even, odd = [], []
for i in range(len(s)):
    if i%2:
        odd.append(s[i])
    else:
        even.append(s[i])
e = list(set(odd))
o = list(set(even))
if('L' in o or 'R' in e):
    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 = list(input())
f = True
print(s)
for index, i in enumerate(s):
    if(index % 2 == 0):
        if(i == 'L'):
            f = False
            break
    if(index % 2 == 1):
        if(i == 'R'):
            f = False
            break
if(f):
    print('Yes')
else:
    print('No')


s = list(input())
f = True
for index, i in enumerate(s):
    if(index % 2 == 0):
        if(i == 'L'):
            f = False
            break
    if(index % 2 == 1):
        if(i == 'R'):
            f = False
            break
if(f):
    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()

od = ["R","U","D"]
ev = ["L","U","D"]

b = False
for i in range(len(s)):
  if i%2==0 and (s[i] not in ev):
      b = True
      break
  elif i%2==1 and (s[i] not in od):
      b = True
      break

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

s = input()

od = ["R","U","D"]
ev = ["L","U","D"]

b = False
for i in range(len(s)):
  if i%2==1 and (s[i] not in ev):
      b = True
      break
  elif i%2==0 and (s[i] not in od):
      b = True
      break

if b:
  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):
a=input()
print(a[0::2],a[1::2])
if set(a[0::2])<=set(['R','U','D']) and set(a[1::2])<=set(['L','U','D']):
  print('Yes')
else:
  print('No')

a=input()
if a[1::2] in ['R','U','D'] and a[2::2] in ['L','U','D']:
  print('Yes')
else:
  print('No')

a=input()

if set(a[0::2])<=set(['R','U','D']) and set(a[1::2])<=set(['L','U','D']):
  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()
x=0
for i in range(0,len(s),2):
  if s[i]="L":
    x+=1
    
for j in range(1,len(s),2):
  if s[j]="R":
    x+=1

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


s=list(map(input().split()))
x=0
for i in range(0,len(s),2):
  if s[i]="L":
    x+=1
    
for j in range(1,len(s),2):
  if s[j]="R":
    x+=1

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

s=input()
x=0
for i in range(0,len(s),2):
  if s[i]=="L":
    x+=1
    
for j in range(1,len(s),2):
  if s[j]=="R":
    x+=1

if x==0:
  print("Yes")
else:
  print("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):
S = input()
count = 0
for i in range(len(S)):
  if i%2 != 0 and S[i] != 'L':
    count = count+1
  elif i%2 == 0 and S[i] != 'R':
    count = count+1
if count == len(S):
  print('Yes')
else:
  print('No')

S = input()
count = 0
frag = 0
for i in range(len(S)):
  if i%2 != 0 and S[i] != 'R':
    count = count+1
  elif i%2 == 0 and S[i] != 'L':
    count = count+1
  else:
    frag = 1
if frag == 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):
c=input()
test='Yes'
for i in range (len(c)) :
    if( i % 2) ==0 :
        if not (c[i] in 'ULD') :
            test = 'No'
            break
    else :
        if not (c[i] in 'URD') :
            test = 'No'
            break
print( test)
       

c=input()
test='Yes'
for i in range (len(c)) :
    if( i % 2) ==0 :
        if not (c[i] in 'URD') :
            test = 'No'
            break
    else :
        if not (c[i] in 'ULD') :
            test = 'No'
            break
print( test)
       

        
            
    



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()
a = list(s)
#print(len(s))
bad_count = 0

for i in range(len(s)):
 
 
  print(i)
  if(i % 2 == 1):		# EVEN
    if a[i] == "R":
      bad_count += 1
      print("ODD",bad_count)
  else:
    if a[i] == "L":	# ODD
      bad_count += 1
      print("EVEN",bad_count)

print(bad_count)

if bad_count == 0:    
  print("YES")
else:
  print("NO")

s = input()
a = list(s)
#print(len(s))
bad_count = 0

for i in range(len(s)):
 
 
 #  print(i)
  if(i % 2 == 1):		# EVEN
    if a[i] == "R":
      bad_count += 1
  #    print("ODD",bad_count)
  else:
    if a[i] == "L":	# ODD
      bad_count += 1
  #    print("EVEN",bad_count)

#print(bad_count)

if bad_count == 0:    
  print("YES")
else:
  print("NO")

s = input()
a = list(s)
#print(len(s))
bad_count = 0

for i in range(len(s)):
 
 
 # print(i)
  if(i % 2 == 1):		# EVEN
    if a[i] == "R":
      bad_count += 1
    #  print("ODD",bad_count)
  else:
    if a[i] == "L":	# ODD
      bad_count += 1
    #  print("EVEN",bad_count)

#print(bad_count)

if bad_count == 0:    
  print("YES")
else:
  print("NO")
  

s = input()
a = list(s)
#print(len(s))
bad_count = 0

for i in range(len(s)):
 
 
 # print(i)
  if(i % 2 == 1):		# EVEN
    if a[i] == "R":
      bad_count += 1
    #  print("ODD",bad_count)
  else:
    if a[i] == "L":	# ODD
      bad_count += 1
    #  print("EVEN",bad_count)

#print(bad_count)

if bad_count == 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):
s = list(input())
for i in range(1,len(s)+1):
    if i%2 == 0:
        if s[i-1] == "L":
            print("No")
            exit()
    else:
        if s[i-1] == "R":
            print("No")
            exit()
print("Yes")

s = list(input())
for i in range(1,len(s)+1):
    if i%2 == 0:
        if s[i-1] == "R":
            print("No")
            exit()
    else:
        if s[i-1] == "L":
            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):
S=input()
list_A=[]
for letter in S:
    list_A.append(letter)
list_B=list_A[0::2]
list_C=list_A[1::2]
b=0
c=0
for letter2 in list_B:
    if letter2=='R'or letter2=='U'or letter2=='D':
        b+=1
for letter3 in list_C:
    if letter3=='L'or letter2=='U'or letter2=='D':
        c+=1
if b==len(list_B)and c==len(list_C):
        print('Yes')
else:
    print('No')

S=input()
list_A=[]
for letter in S:
    list_A.append(letter)
list_B=list_A[0::2]
list_C=list_A[1::2]
b=0
c=0
for letter2 in list_B:
    if letter2=='R'or letter2=='U'or letter2=='D':
        b+=1
for letter3 in list_C:
    if letter3=='L'or letter2=='U'or letter2=='D':
        c+=1
if b==len(list_B)and c==len(list_C):
        print('Yes')
else:
    print('No')

S=input()
list_A=[]
for letter in S:
    list_A.append(letter)
list_B=list_A[0::2]
list_C=list_A[1::2]
b=0
c=0
for letter2 in list_B:
    if letter2=='R'or letter2=='U'or letter2=='D':
        b+=1
for letter3 in list_C:
    if letter3=='L'or letter3=='U'or letter3=='D':
        c+=1
if b==len(list_B)and c==len(list_C):
        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):
import copy
s=list(input())
a=copy.deepcopy(s)
b=copy.deepcopy(s)
a=a[0:-1:2]
b=b[1:-1:2]
resulta="L" in a
resultb="R" in b
if resulta == "False" and resultb == "False":
  print("Yes")
else:
  print("No")

import copy
s=list(input())
a=copy.deepcopy(s)
b=copy.deepcopy(s)
a=a[0::2]
b=b[1::2]
resulta="L" in a
resultb="R" in b
if resulta == False and resultb == False:
  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()
count = 0

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

s = input()
count = 0

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

s = input()
count = 0

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

s = input()
count = 0

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

Verdicts: Runtime Error

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()
O=[]
E=[]
for i in len(S):
  if i%2==0:
    E.append(S[i])
  else:
    O.append(S[i])
if L in O or R in E:
  print("No")
else:
  print("Yes")
  

S=input()
E=S[::2]
O=S[1::2]
if "R" in E or "L" in O:
  print("No")
else:
  print("Yes")

S=input()
E=S[::2]
O=S[1::2]
if  'R'  in E or 'L' in O:
  print("No")
else:
  print("Yes")

S=list(input())
E=[]
O=[]
for i in range(len(S)):
  if i%2==0:
    E.append(S[i])
  else:
    O.append(S[i])
if "R "in E or "L" in O:
  print("No")
else:
  print("Yes")

S=input()
S.split()
for i in range(0,len(S)):
  if i%2==0:
    if S[i]=='L':
      print("No")
  if i%2!=0:
    if S[i]=='R':
      print("No")
  else:
    print("Yes")
      

S=list(input())
E=[]
O=[]
for i in range(len(S)):
  if i%2==0:
    E.append(S[i])
  else:
    O.append(S[i])
if R in E or L in O:
  print("No")
else:
  print("Yes")

S=list(input())
E=[]
O=[]
for i in range(len(S)):
  if i%2==0:
    E.append(S[i])
  else:
    O.append(S[i])
if R in E or L in O:
  print("No")
else:
  print("Yes")
S=list(input())
E=[]
O=[]
for i in range(len(S)):
  if i%2==0:
    E.append(S[i])
  else:
    O.append(S[i])
if "R" in E or "L" in O:
  print("No")
else:
  print("Yes")
提出情報

S=input()
if all(c in 'RUD' for c in S[::2]) and all(c in 'LUD' for c in S[1::2]):
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

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()
n = 1
a = True
for c in s:
    if n % 2 == 0:
        if c == "L" or c == "U" or c == "D":
            continue
        else:
            a = False
            break
    else:
        if c == "R" or c == "U" or c == "D":
            continue
        else:
            a = False
            break
if a:
    print("Yes")
else:
    print("No")

s = input()
n = 1
a = True
for c in s:
    if n % 2 == 0:
        if c == "L" or c == "U" or c == "D":
            n += 1
            continue
        else:
            a = False
            break
    else:
        if c == "R" or c == "U" or c == "D":
            n += 1
            continue
        else:
            a = False
            break
if a:
    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):
g = ['R', 'U', 'D']
k = ['L', 'U', 'D']
a = input()
b = 0
for i in range(len(a)):
    if (i+1) % 2 == 0:
        if a[i] in g:
            pass
        else:
            print('No')
            b = 1
            break
    else:
        if a[i] in k:
            pass
        else:
            print('No')
            b = 1
            break
if b == 0:
    print('Yes')

g = ['L', 'U', 'D']
k = ['R', 'U', 'D']
a = input()
b = 0
for i in range(len(a)):
    if (i+1) % 2 == 0:
        if a[i] in g:
            pass
        else:
            print('No')
            b = 1
            break
    else:
        if a[i] in k:
            pass
        else:
            print('No')
            b = 1
            break
if b == 0:
    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 = list(str(input()))
print(S)
for i in range(len(S)) :
  if i % 2 == 1 and S[i] == "R" :
    print("No")
    break
  elif i % 2 == 0 and S[i] == "L" :
    print("No")
    break
else :
  print("Yes")

S = list(str(input()))
for i in range(len(S)) :
  if i % 2 == 1 and S[i] == "R" :
    print("No")
    break
  elif i % 2 == 0 and S[i] == "L" :
    print("No")
    break
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):
def main():
    S = input()
    ans = 'Yes'
    for i in range(len(S)):
        print(i, S[i])
        if ((i+1)%2==1 and S[i]=='L') or ((i+1)%2==0 and S[i]=='R'):
            ans = 'No'
            break
    print(ans)

if __name__ == '__main__':
    main()

def main():
    S = input()
    ans = 'Yes'
    for i in range(len(S)):
        if ((i+1)%2==1 and S[i]=='L') or ((i+1)%2==0 and S[i]=='R'):
            ans = 'No'
            break
    print(ans)

if __name__ == '__main__':
    main()

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 = list(str(input()))
for i in range(1, len(s)+1):
  if (i%2 and s[i]=='L') or (i%2==0 and s[i]=='R'):
    print('No')
 	exit()
print('Yes')

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

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


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

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

Verdicts: Runtime Error

Runtime Error

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):
a = "Yes"
for i,s in enumerate(S):
    if i % 2 == 0:
        if s in ["R", "U", "D"]:
            pass
        else:
            a = "No"
            break
    else:
        if s in ["L", "U", "D"]:
            pass
        else:
            a = "No"
            break
            
print(a)
      

S  = list(input())

a = "Yes"
for i,s in enumerate(S):
    if i % 2 == 0:
        if s in ["R", "U", "D"]:
            pass
        else:
            a = "No"
            break
    else:
        if s in ["L", "U", "D"]:
            pass
        else:
            a = "No"
            break
            
print(a)
      

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())

K="Yes"

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

S=list(input())
q=len(S)//2+1
i=0
K="Yes"
for i in range (0,q):
    if S[2*i]=="L":
        K="No"
        break
    elif S[2*i+1]=="R":
        K="No"
        break
    else:
        continue
print(K)
        
        


S=list(input())
K="Yes"
for i in range (0,len(S)):
	if i%2==0:
		if S[i]=="L" :
			K="No"
			break
		else:
			continue
	else :
		if S[i]=="R" :
			K="No"
			break
		else:
			continue
print(K)

Verdicts: Runtime Error

Runtime Error

Accepted