problem_id
stringlengths 6
6
| user_id
stringlengths 10
10
| time_limit
float64 1k
8k
| memory_limit
float64 262k
1.05M
| problem_description
stringlengths 48
1.55k
| codes
stringlengths 35
98.9k
| status
stringlengths 28
1.7k
| submission_ids
stringlengths 28
1.41k
| memories
stringlengths 13
808
| cpu_times
stringlengths 11
610
| code_sizes
stringlengths 7
505
|
|---|---|---|---|---|---|---|---|---|---|---|
p03293 | u562119930 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["import numpy\n\ns = list(input())\nt = input()\n\nif set(s) != set(t):\n print('No')\n\ntmp = s[:]\nfor i in range(len(tmp)):\n tmp = numpy.roll(tmp, 1)\n if ''.join(tmp) == t:\n print('YES')\n break", "import numpy\n\ns = list(input())\nt = input()\n\ntmp = s[:]\nfor i in range(len(tmp)):\n tmp = numpy.roll(tmp, 1)\n if ''.join(tmp) == t:\n print('Yes')\n exit()\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s782919547', 's215647055'] | [20720.0, 21112.0] | [1010.0, 893.0] | [209, 184] |
p03293 | u565204025 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['# -*- coding: utf-8 -*-\n\ns = list(input())\nt = list(input())\n\nans = False\n\nfor i in range(len(s)):\n print(s)\n if s == t:\n ans = True\n break\n temp = s[0]\n for j in range(1,len(s)):\n s[j-1] = s[j]\n s[-1] = temp\n\nif ans:\n print("Yes")\nelse:\n print("No")\n', '\n# -*- coding: utf-8 -*-\n\ns = list(input())\nt = list(input())\n\nans = False\n\nfor i in range(len(s)):\n if s == t:\n ans = True\n break\n temp = s[0]\n for j in range(1,len(s)):\n s[j-1] = s[j]\n s[-1] = temp\n\nif ans:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s623926596', 's872934850'] | [3060.0, 3060.0] | [20.0, 18.0] | [293, 281] |
p03293 | u569041543 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\n\nfor i in range(len(S)):\n if S == T:\n print('Yes')\n break\n else:\n S = S[-1] + S[0:-1]\n print(S)\nelse:\n print('No')", "S = input()\nT = input()\n\nfor i in range(len(S)):\n if S == T:\n print('Yes')\n break\n else:\n S[:] = T[-1] + T[1:]\nelse:\n print('No')", "S = input()\nT = input()\n\nfor i in range(len(S)):\n if S == T:\n print('Yes')\n break\n else:\n S = S[-1] + S[0:-1]\nelse:\n print('No')"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s184097356', 's901709146', 's122514521'] | [3060.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [171, 159, 158] |
p03293 | u569970656 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = input()\nt = input()\nt2 = t[-1] + t[:-1]\nwhile t2 != t:\n if s == t2:\n print("yes")\n exit()\n t2 = t2[-1] + t2[:-1]\nprint("no")', 'import copy\ns = input()\nt = input()\nt2 = t[-1] + t[1:]\nwhile t2 != t:\n if s = t2:\n print("yes")\n return 0\n t2 = t[-1] + t[1:]\nprint("no")', 's = input()\nt = input()\nt2 = t[-1] + t[1:]\nwhile t2 != t:\n if s == t2:\n print("yes")\n return 0\n t2 = t[-1] + t[1:]\nprint("no")', 's = input()\nt = input()\nt2 = t[-1] + t[:-1]\nwhile t2 != t:\n if s == t2:\n print("yes")\n exit()\n t2 = t2[-1] + t2[:-1]\nprint("no")\n', 's = input()\nt = input()\nfor _ in range(len(t)):\n if s == t:\n print("Yes")\n exit()\n t = t[-1] + t[:-1]\nprint("No")'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s465215605', 's636244135', 's951101248', 's974995204', 's255289088'] | [3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [136, 145, 134, 137, 121] |
p03293 | u572193732 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = input()\nT = input()\n\nflag = False\nfor i in range(len(S)):\n x = T[0]\n T = T[1:]\n T = T + x\n print(T)\n print(S)\n if T == S:\n flag = True\n break\n \nif flag:\n print("Yes")\nelse:\n print("No")', 'S = input()\nT = input()\n\nflag = False\nfor i in range(len(S)):\n x = T[0]\n T = T[1:]\n T = T + x\n if T == S:\n flag = True\n break\n \nif flag:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s348083782', 's278964005'] | [3060.0, 2940.0] | [17.0, 17.0] | [230, 204] |
p03293 | u573754721 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s=list(input())\nt=list(input())\n\nif len(s)!=len(t):\n print("No")\n exit()\nelif s==t:\n print("Yes")\n exit()\n\nfor i in range(len(s)):\n if s.append(s.pop(0))==t:\n print("Yes")\n exit()\nprint("No")\n ', 's=input()\nt=input()\n\nfor i in range(len(s)):\n s=s[-1]+s[:-1]\n print(s)\n if s==t:\n print("Yes")\n exit()\nprint("No")\n', "s=list(input())\nt=list(input())\n\nfor i in range(len(s)):\n s.insert(0,s.pop())\n if ''.join(s)==''.join(t):\n print('Yes')\n exit()\nprint('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s214915349', 's605049698', 's441627498'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [245, 152, 171] |
p03293 | u574053975 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['a=input()\nb=input()\nfor i in range(len(a)):\n if a==b:\n print("Yes")\n break\n \n a=a[-1]+a\n a=a[:len(a)-1]\nelse:\n print("No"', 'a=input()\nb=input()\nfor i in range(len(a)):\n if a==b:\n print("Yes")\n break\n \n a=a[-1]+a\n a=a[:len(a)-1]\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s468741096', 's165025920'] | [2940.0, 3060.0] | [17.0, 17.0] | [150, 151] |
p03293 | u578489732 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["# -*- coding: utf-8 -*-\nimport sys\n# ----------------------------------------------------------------\n# Use Solve Function\n\ndef solve(lines):\n l = list(map(int, lines.pop(0).split(' ')))\n l.sort()\n print(l[2] - l[0])\n\n#\n# main\n#\n\n# 1. use list instead of stdin\n# 2. use stdin\n\nlines = [x.strip() for x in sys.stdin.readlines()]\n\n#\n# solve !!\n#\nsolve(lines)", "# -*- coding: utf-8 -*-\nimport sys\n# ----------------------------------------------------------------\n# Use Solve Function\n\ndef solve(lines):\n S = lines.pop(0)\n T = lines.pop(0)\n for i in range(len(S)):\n S = S[-1] + S[:-1]\n if S == T:\n print('Yes')\n sys.exit(0)\n\n print('No')\n\n#\n# main\n#\n\n# 1. use list instead of stdin\n\n#contents = '''\\\n#abcdefg\n\n#'''\n\n\n# 2. use stdin\n\nlines = [x.strip() for x in sys.stdin.readlines()]\n\n#\n# solve !!\n#\nsolve(lines)"] | ['Runtime Error', 'Accepted'] | ['s204283665', 's663774024'] | [3064.0, 3060.0] | [18.0, 18.0] | [365, 536] |
p03293 | u578953945 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["ANS='No'\nS=input()\nT=input()\nN=len(S)\nfor i in range(S):\n if S[i:N] + S[:i] == T:\n ANS='Yes'\n break\nprint(ANS)", "ANS='No'\nS=input()\nT=input()\nN=len(S)\nfor i in range(N):\n if S[i:N] + S[:i] == T:\n ANS='Yes'\n break\nprint(ANS)"] | ['Runtime Error', 'Accepted'] | ['s087769143', 's226806028'] | [2940.0, 2940.0] | [17.0, 17.0] | [117, 117] |
p03293 | u579015878 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S=input()\ns=list(S)\nT=input()\nt=list(T)\nfor i in range(len(s)):\n s.insert(0,s[-1])\n print(s)\n s.pop(-1)\n \n print(s)\n if s==t:\n print('Yes')\n exit()\n \nprint('N", "S=input()\ns=list(S)\nT=input()\nt=list(T)\nfor i in range(len(s)):\n s.insert(0,s[-1])\n print(s)\n s.pop(-1)\n \n print(s)\n if s==t:\n print('Yes')\n exit()\n \nprint('No')", "S=input()\ns=list(S)\nT=input()\nt=list(T)\nfor i in range(len(s)):\n s.insert(0,s[-1])\n s.pop(-1)\n if s==t:\n print('Yes')\n exit()\n \nprint('No')"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s154730977', 's166674752', 's242869521'] | [2940.0, 3060.0, 3060.0] | [18.0, 19.0, 19.0] | [171, 174, 149] |
p03293 | u580316619 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s,t=input().split()\na=0\nf=False\n\nfor i in range(len(s)):\n\ta=s[-1]\n\ts=s[:-1]\n\ts=a+s\n\t\n\tif s==t:\n\t\tf=True\n\t\tbreak\n\t\t\nif f:\n\tprint('Yes')\nelse:\n\tprint('No')", "s=input()\nt=input()\na=0\nf=False\n\nfor i in range(len(s)):\n\ta=s[-1]\n\ts=s[:-1]\n\ts=a+s\n\t\n\tif s==t:\n\t\tf=True\n\t\tbreak\n\t\t\nif f:\n\tprint('Yes')\nelse:\n\tprint('No')"] | ['Runtime Error', 'Accepted'] | ['s840882663', 's006006463'] | [3060.0, 3060.0] | [17.0, 17.0] | [153, 153] |
p03293 | u581603131 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["N = int(input())\nprint('Yes' if 9 in N else 'No')", 'print("Yes" if input() in input()*2 else "No")'] | ['Runtime Error', 'Accepted'] | ['s377431256', 's688162704'] | [2940.0, 2940.0] | [18.0, 17.0] | [49, 46] |
p03293 | u591293973 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = input()\nt = input()\n\nfor i in range(len(s)):\n if s != t[i:]+t[:i]:\n j=0 \n \n else:\n j=1\n break\n\nif j==1:\n print("yes")\nelse:\n print("no")', 'S = list(input())\nT = list(input())\n\nfor i in range(len(S)):\n if S == T[i:]+T[:i]:\n j = 1\n break\n else:\n j = 0\n\nif j == 1:\n print("yes")\nelse:\n print("no")', 's = input()\nt = input()\n \nfor i in range(len(s)):\n if s[i:]+s[:i] != t:\n j=0 \n else:\n j=1\n break\n\nif j==1:\n print("yes")\nelse:\n print("no")', 'import sys\n\nS = list(input())\nT = list(input())\n\nfor i in range(len(S)):\n if S == (T[i:]+T[0:i]):\n print("yes")\n sys.exit()\n \nprint("no")', 'S = list(input())\nT = list(input())\n\nfor i in range(len(S)):\n if S == T[i:]+T[:i]:\n j = 1\n break\n else:\n j = 0\n\nif j == 1:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s092766460', 's207513247', 's540171364', 's889716397', 's602933951'] | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 18.0] | [156, 168, 152, 147, 168] |
p03293 | u592248346 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['aaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab', 'n=input()\nm=input()\nn*=2\nif m in n:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s389064469', 's698265897'] | [2940.0, 2940.0] | [17.0, 17.0] | [33, 74] |
p03293 | u595375942 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S=input()\nT=input()\nfor i in range(1,len(S)):\n if S[-i:]+S[:-i]==T:\n print('Yes')\n exit\nprint('No')", "S=input()\nT=input()\nfor i in range(0,len(S)):\n if S[-i:]+S[:-i]==T:\n print('Yes')\n exit()\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s290110247', 's604093875'] | [2940.0, 2940.0] | [18.0, 18.0] | [116, 118] |
p03293 | u597455618 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['print("Yes" for input() in input()*2 else "No") ', 'print("Yes" if input() in input()*2 else "No") '] | ['Runtime Error', 'Accepted'] | ['s157841917', 's867784515'] | [2940.0, 2940.0] | [17.0, 17.0] | [49, 48] |
p03293 | u606033239 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = input()\nt = input()\n\nfor i in range(100):\n a = 0\n s = s[-1:] + s[:-1]\n if s == t:\n a += 1\nif a == 1:\n print("Yes")\nelse:\n print("No")', 's=[input()]\nt=[input()]\ns.sort()\nt.sort()\nif s == t: \n print("Yes")\nelse:\n print("No")', 'vs=input()\nt=input()\nprint("Yes" if t in s*2 else "No")', 's=input()\nt=input()\nfor i in range(100):\n s = s[i:]+s[-i:]\n if t in s:\n print("Yes")\n exit()\nprint("No")'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s405429025', 's480452264', 's489630864', 's284795291'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 18.0] | [159, 93, 55, 124] |
p03293 | u606878291 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = list(input())\n\nif S[0] != 'A':\n print('WA')\nelif S[2:-1].count('C') != 1:\n print('WA')\nelse:\n S = list(S[1:])\n S.remove('C')\n S = ''.join(S)\n if S.islower():\n print('AC')\n else:\n print('WA')\n", "from collections import deque\n\nS = deque(input())\nT = deque(input())\n\nfor _ in range(len(S)):\n if S == T:\n print('Yes')\n break\nelse:\n print('No')\n\n\n", "from collections import deque\n\nS = deque(input())\nT = deque(input())\n\nfor _ in range(len(S)):\n if S == T:\n print('Yes')\n break\n S.rotate()\nelse:\n print('No')\n\n\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s271777282', 's352756885', 's813053907'] | [3060.0, 3316.0, 3316.0] | [17.0, 21.0, 20.0] | [230, 168, 183] |
p03293 | u607729897 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["Ss=input()\nTs=input()\ns=[_ for _ in Ss]\nt=[_ for _ in Ts]\nl=len(Ss)\nfor i in range(l):\n temp=s[l-1]\n for j in range(l-1,-1,-1):\n s[j]=s[j-1]\n else:\n s[0]=temp\n print(s)\n if s==t:\n res='Yes'\n break\nelse:\n res='No'\nprint(res)", "Ss=input()\nTs=input()\ns=[_ for _ in Ss]\nt=[_ for _ in Ts]\nl=len(Ss)\nfor i in range(l):\n temp=s[l-1]\n for j in range(l-1,-1,-1):\n s[j]=s[j-1]\n else:\n s[0]=temp\n if s==t:\n res='Yes'\n break\nelse:\n res='No'\nprint(res)\n"] | ['Wrong Answer', 'Accepted'] | ['s907091477', 's130068568'] | [3064.0, 3060.0] | [19.0, 18.0] | [241, 231] |
p03293 | u609061751 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['import sys\ninput = sys.stdin.readline\nS = list(input())\nT = list(input())\nN = len(S)\nfor i in range(N):\n S = S[-1] + S[:N-1]\n if S == T:\n print("Yes")\n sys.exit()\nprint("No")', 'import sys\ninput = sys.stdin.readline\nS = list(input().rstrip())\nT = list(input().rstrip())\nN = len(S)\nfor i in range(N):\n S = list(S[-1]) + S[:N-1]\n if S == T:\n print("Yes")\n sys.exit()\nprint("No")'] | ['Runtime Error', 'Accepted'] | ['s119426849', 's732536655'] | [3060.0, 3060.0] | [17.0, 20.0] | [194, 218] |
p03293 | u614627871 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['def main():\n s = list(input())\n t = list(input())\n print(t)\n print(s)\n s_len = len(s)\n for i in range(s_len):\n if s == t:\n return\n tmp = s[0]\n s.pop(0)\n s.append(tmp)\n print(t)\n print(s)\n\n\nmain()\n', 'def main():\n s = list(input())\n t = list(input())\n s_len = len(s)\n for i in range(s_len):\n if s == t:\n print("Yes")\n return\n tmp = s[0]\n s.pop(0)\n s.append(tmp)\n print("No")\n\n\nmain()\n'] | ['Wrong Answer', 'Accepted'] | ['s153456127', 's783400729'] | [2940.0, 2940.0] | [17.0, 17.0] | [259, 248] |
p03293 | u625741705 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['def solve(s,t):\n if(s == t):\n return "Yes"\n for i in range(len(s)-1,0,-1):\n f = s[i:] + s[:i]\n print(f)\n if(f == t):\n return "Yes"\n return "No"\n\ns = input()\nt = input()\nprint(solve(s,t))', 'def solve(s,t):\n if(s == t):\n return "Yes"\n for i in range(len(s)-1,0,-1):\n f = s[i:] + s[:i]\n if(f == t):\n return "Yes"\n return "No"\n\ns = input()\nt = input()\nprint(solve(s,t))'] | ['Wrong Answer', 'Accepted'] | ['s998757668', 's792935591'] | [3064.0, 3060.0] | [17.0, 17.0] | [234, 217] |
p03293 | u626228246 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['import sys\nS,T = map(str,input().split())\nfor i in range(len(S)):\n tmp = S[-1]\n S[-1] = ""\n S.insert(0,tmp)\n if S == T:\n print("Yes")\n sys.exit()\nprint("No")\n ', 'import sys\nS = input()\nT = input()\nfor i in range(len(S)):\n tmp = S[-1]\n S = tmp + S[:-1]\n if S == T:\n print("Yes")\n sys.exit()\nprint("No")'] | ['Runtime Error', 'Accepted'] | ['s161924530', 's296160441'] | [8976.0, 9036.0] | [23.0, 28.0] | [172, 148] |
p03293 | u626337957 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\nA = S\nif S == T:\n print('Yes')\nelse:\n eq = False:\n for i in range(len(S)):\n A = A[-1] + A[0:-1]\n if A == T:\n eq = True\n break\n if eq:\n print('Yes')\n else:\n print('No')\n ", "S = input()\nT = input()\nA = S\nif S == T:\n print('Yes')\nelse:\n eq = False\n for i in range(len(S)):\n A = A[-1] + A[0:-1]\n if A == T:\n eq = True\n break\n if eq:\n print('Yes')\n else:\n print('No')\n \n"] | ['Runtime Error', 'Accepted'] | ['s501975400', 's992832640'] | [2940.0, 2940.0] | [17.0, 17.0] | [221, 221] |
p03293 | u628047647 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['import sys\ns = input()\nt = input()\nfor i in len(s):\n ok = 1\n for j in len(s):\n if s[(i+j)%len(s)] != t[j]:\n ok = 0\n if ok == 1:\n print("Yes")\n sys.exit()\nprint("No")\n ', 'import sys\ns = input()\nt = input()\nfor i in range(len(s)):\n ok = 1\n for j in range(len(s)):\n if s[(i+j)%len(s)] != t[j]:\n ok = 0\n if ok == 1:\n print("Yes")\n sys.exit()\nprint("No")'] | ['Runtime Error', 'Accepted'] | ['s637141503', 's257250517'] | [2940.0, 3060.0] | [17.0, 21.0] | [187, 196] |
p03293 | u634159866 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\n\nlengt = len(S)\nlst = []\n\nfor i in range(length):\n lst.append(S[i: length]+S[0: i])\n \nif T in lst:\n print('Yes')\nelse:\n print('No')", "S = input()\nT = input()\n\nlength = len(S)\nlst = []\n\nfor i in range(length):\n lst.append(S[i: length]+S[0: i])\n \nif T in lst:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s494673385', 's538110767'] | [2940.0, 2940.0] | [17.0, 19.0] | [167, 168] |
p03293 | u635339675 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['a=list(input())\nb=list(input())\nhantei=True\nfor i in range(len(a)):\n\tc=[]\n\tc.append(a[-1])\n\tfor i in range(0,len(a)-1):\n\t\tc.append(a[i])\n\ta=c\n\tif c==b:\n\t\thantei=True\n\t\tbreak\n\telse:\n\t\thantei=False\n\nif hantei==False:\n\tprint("No")\nelse:\n\tprint("Yesk")\n', 'a=list(input())\nb=list(input())\nhantei=True\nfor i in range(len(a)):\n\tc=[]\n\tc.append(a[-1])\n\tfor i in range(0,len(a)-1):\n\t\tc.append(a[i])\n\ta=c\n\tif c==b:\n\t\thantei=True\n\t\tbreak\n\telse:\n\t\thantei=False\n\nif hantei==False:\n\tprint("No")\nelse:\n\tprint("Yes")\n'] | ['Wrong Answer', 'Accepted'] | ['s593760508', 's340262540'] | [3060.0, 3060.0] | [19.0, 18.0] | [249, 248] |
p03293 | u636162168 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s=str(input())\nt=str(input())\na=True\nfor i in range(101):\n if s==t:\n print("Yes")\n a=False\n break\n s=s[-1]+s[:-2]\nif a:\n print("No")', 's=str(input())\nt=str(input())\na=True\nfor i in range(len(s)):\n if s==t:\n a=False\n break\n s=s[-1]+s[:-2]\nif a:\n print("No")\nelse:\n print("Yes")\n ', 's=str(input())\nt=str(input())\na=0\nwhile a<=100:\n a+=1\n s=s[-1]+s[:-2]\n if s==t:\n print("Yes")\n break\nif a>100:\n print("No")\n ', 's=str(input())\nt=str(input())\na=True\nfor i in range(len(s)):\n if s==t:\n a=False\n break\n s=s[-1]+s[:-1]\nif a:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s103474700', 's108705917', 's607425523', 's590683329'] | [2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [162, 172, 154, 167] |
p03293 | u638282348 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['print("Yes" if input() in tuple(s1[i:] + s1[:i] for i in range(len(s1))) else "No")\n', 's1 = input()\nprint("Yes" if input() in tuple(s1[i:] + s1[:i] for i in range(len(s1))) else "No")\n'] | ['Runtime Error', 'Accepted'] | ['s188958061', 's437116788'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 97] |
p03293 | u640603056 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = list(input())\nt = list(input())\nfor i in range(len(s)):\n tmp = s[-1]\n for j in range(len(s)-1)[::-1]:\n s[j+1] = s[j]\n s[0]=tmp\n if s == t:\n print("yes")\n break\nelse:\n print("no")', 's = list(input())\nt = list(input())\nfor i in range(len(s)):\n \ttmp = s[-1]\n \tfor j in range(len(s)-1)[::-1]:\n \ts[j+1] = s[j]\n \ts[0]=tmp\n \tprint(s)\n \tif s == t:\n \tbreak\nelse:\n \tprint("no")', 's = list(input())\nt = list(input())\n\nfor i in range(len(s)):\n tmp = s[len(s)-1]\n for j in range(len(s))[::-1]:\n s[j] = s[j-1]\n s[0] = tmp\n if s == t:\n print("Yes")\n break\nelse:\n print("No")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s370593858', 's664171234', 's224633406'] | [3060.0, 2940.0, 3060.0] | [18.0, 17.0, 18.0] | [218, 210, 225] |
p03293 | u640922335 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S=input()\nT=input()\n\nfor i in range(len(S)):\n S=S[-1]+S[:-1]\n if T==S:\n print('Yes')\n exit()\n print(S)\nprint('No')", "S=input()\nT=input()\n\nfor i in range(len(S)):\n S=S[-1]+S[:-1]\n if T==S:\n print('Yes')\n exit()\n print(S)\nprint('No')", "S=input()\nT=input()\n\nfor i in range(len(S)):\n S=S[-1]+S[:-1]\n if T==S:\n print('Yes')\n exit()\n\nprint('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s116748441', 's802568123', 's642708990'] | [3060.0, 3060.0, 2940.0] | [19.0, 17.0, 17.0] | [137, 137, 125] |
p03293 | u641406334 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s=list(input())\nt=list(input())\nflag=False\ncnt=0\nif sorted(s)==sorted(t):\n a=s.index(t[0])\n for i in range(len(s)):\n b=i+a\n print(b)\n if b>=len(s):\n b-=len(s)\n if s[b]==t[i]:\n cnt+=1\n\nif cnt==len(S):\n flag=True\nprint('Yes' if flag else 'No')", "s=list(input())\nt=list(input())\nflag=False\ncnt=0\nif sorted(s)==sorted(t):\n a=s.index(t[0])\n for i in range(len(s)):\n b=i+a\n if b>=len(s):\n b-=len(s)\n if s[b]==t[i]:\n cnt+=1\n\nif cnt==len(s):\n flag=True\nprint('Yes' if flag else 'No')\n"] | ['Runtime Error', 'Accepted'] | ['s244949857', 's482864871'] | [3064.0, 3064.0] | [18.0, 17.0] | [266, 254] |
p03293 | u649558044 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s, t = input(), input()\nif s == t:\n print('Yes')\n exit(0)\nfor i in range(1, len(s)):\n print(s[:i], s[i:])\n print(t[-i:], t[:-i])\n if s[:i] == t[-i:] and s[i:] == t[:-i]:\n print('Yes')\n exit(0)\nprint('No')", "s, t = input(), input()\nif s == t:\n print('Yes')\n exit(0)\nfor i in range(1, len(s)):\n if s[:i] == t[-i:] and s[i:] == t[:-i]:\n print('Yes')\n exit(0)\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s653471962', 's730915337'] | [3064.0, 3060.0] | [18.0, 18.0] | [233, 183] |
p03293 | u651879504 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = input()\nT = input()\n\n\nif S == T :\n ans = "Yes"\nelse:\n list_S =list(S) \n list_T =list(T) \n L = list_S\n L = tuple(L)\n #print(L)\n ans = "N0"\n \n for i in range(1,len(S)+1):\n \n for j in range(len(S)):\n list_S[j] = L[-i+j]\n #print(L,list_S)\n print(list_S)\n #print(L)\n if list_S == list_T :\n ans = "Yes"\n break\nprint(ans) ', 'S = input()\nT = input()\n\n\nif S == T :\n ans = "Yes"\nelse:\n list_S =list(S) \n list_T =list(T) \n L = list_S\n L = tuple(L)\n #print(L)\n ans = "N0"\n \n for i in range(1,len(S)):\n \n for j in range(len(S)):\n list_S[j] = L[-i+j]\n #print(L,list_S)\n print(list_S)\n #print(L)\n if list_S == list_T :\n ans = "Yes"\n break\nprint(ans) ', 'N = input()\n\ncount = 0\n\nfor i in range(len(N)):\n count += int(N[i])\n \nif int(N) % count == 0:\n print("Yes")\nelse:\n print("No")', 'S = input()\nT = input()\n\n\nif S == T :\n ans = "Yes"\nelse:\n list_S =list(S) \n list_T =list(T) \n L = list_S\n L = tuple(L)\n ans = "No"\n \n for i in range(1,len(S)+1):\n \n for j in range(len(S)):\n list_S[j] = L[-i+j]\n if list_S == list_T :\n ans = "Yes"\n break\nprint(ans) '] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s110898936', 's246732736', 's651620394', 's158536067'] | [3064.0, 3064.0, 2940.0, 3064.0] | [19.0, 20.0, 17.0, 19.0] | [449, 447, 137, 368] |
p03293 | u657901243 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s = input()\nt = input()\nfor i in range(len(s)):\n if s==t:\n print('Yes')\n break;\n else:\n s = s[len(s)-1] + s[0:-1]\nprint('No')", "s = input()\nt = input()\nfor i in range(len(s)):\n if s==t:\n print('Yes')\n exit()\n else:\n s = s[len(s)-1] + s[0:-1]\nprint('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s686741584', 's370829902'] | [3060.0, 2940.0] | [17.0, 17.0] | [152, 153] |
p03293 | u662449766 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n s = input().strip()\n t = input().strip()\n print(\'Yes\' if any([s[-i:] + s[:-i] == t for i in range(len(s))]) \'No\')\n\n\nif __name__ == "__main__":\n main()\n', 'import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n s = input().strip()\n t = input().strip()\n print("Yes" if any([s[-i:] + s[:-i] == t for i in range(len(s))]) else "No")\n\n\nif __name__ == "__main__":\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s629709345', 's965199327'] | [2940.0, 2940.0] | [18.0, 17.0] | [217, 222] |
p03293 | u663438907 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['A = sorted(list(input()))\nT = sorted(list(input()))\n\nans = \'Yes\'\n\nfor i in range(len(A)):\n if A[i] != T[i]:\n ans = "No\'\n \nprint(ans)', "A = list(input())\nT = str(input())\n\ncheck = 'No'\n\n\nfor i in range(len(A)):\n if ''.join(A) == T:\n check = 'Yes'\n A.insert(A.pop(-1))\n\nprint(check)", "A = list(input())\nT = str(input())\n\ncheck = 'No'\n\nfor i in range(len(A)):\n if ''.join(A) == T:\n check = 'Yes'\n A.insert(0, A.pop(-1))\n\nprint(check)"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s410515005', 's450057929', 's669305929'] | [2940.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0] | [139, 150, 152] |
p03293 | u664796535 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['def str_rot(a, b):\n i = 0\n while a != b and i < len(a)-1:\n a = a[-1] + a[:-1]\n i += 1\n \n if a != b:\n return False\n else:\n return True', "def str_rot(a, b):\n i = 0\n while a != b and i < len(a)-1:\n a = a[-1] + a[:-1]\n i += 1\n\n if a != b:\n return 'No'\n else:\n return 'Yes'", "str1 = input()\nstr2 = input()\n\nif str1 == str2:\n print('Yes')\n\nelse:\n for i in range(len(str1) - 1):\n \n str1 = str1[-1] + str1[:-1]\n \n if str1 == str2:\n print('Yes')\n break\n \n if str1 != str2:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s222375726', 's956343535', 's131704102'] | [2940.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0] | [176, 172, 266] |
p03293 | u667024514 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['\n#include <string>\n\n#include <algorithm>\n\nusing namespace std;\n\nstring s,t;\nint si;\nint i;\n\nint main(){\n cin >> s >> t;\n\n s = s + s;\n if(s.find(t) != s.npos){\n cout << "Yes" << endl;\n }\n else{\n cout << "No" << endl;\n }\n \n return 0;\n}', '\n#include <string>\n\n#include <algorithm>\n\nusing namespace std;\n\nstring s,t;\nint i;\n\nint main(){\n cin >> s;\n cin >> t;\n\n s = s + s;\n if(s.find(t) != s.npos){\n cout << "Yes" << endl;\n }\n else{\n cout << "No" << endl;\n }\n \n return 0;\n}', 's = str(input())\nt = str(input())\nfor i in range(len(s)):\n if s == t:\n print("Yes")\n exit()\n nu = t[-1]\n t = nu+t[:-1]\nprint("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s275915625', 's416366812', 's805373705'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [307, 308, 139] |
p03293 | u668503853 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s=input()\nt=input()\nrs=s[::-1]\nif rs==t or s==t:\n print("Yes")\nelse:\n print("No")', 'S=input()\nT=input()\nans=0\nfor i in range(len(S)):\n S=S[-1]+S[:-1]\n if S==T:\n ans=1\n break\nif ans==0:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s239663164', 's125335999'] | [2940.0, 2940.0] | [18.0, 17.0] | [83, 143] |
p03293 | u668705838 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['for i in range(10):\n pass\nelse:\n print("Hoge")', 's = input()\nt = input()\nfor i in range(len(s)):\n if s[i:]+s[:i] == t:\n print("Yes")\n break\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s460064443', 's852698506'] | [2940.0, 2940.0] | [17.0, 17.0] | [48, 117] |
p03293 | u669770658 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s = str(input())\nt = str(input())\n\nans = 'No'\n\nfor i in range(len(s) - 1):\n if s != t:\n s = s[-1] + s[:-1]\n\n else:\n print('Yes')\n\nelse:\n print('No')\n", "s = str(input())\nt = str(input())\n\nfor i in range(len(s)):\n if s != t:\n s = s[-1] + s[:-1]\n\n else:\n print('Yes')\n break\n\nelse:\n print('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s755729699', 's119103217'] | [2940.0, 2940.0] | [17.0, 17.0] | [172, 170] |
p03293 | u673338219 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['a = str(input())\nb = str(input())\ncheck = 0\nfor i in range(len(a)):\n if a == b:\n check = 1\n break\n else:\n a = a[len(a)-1] + a[0:len(a)]\n \nif check == 0:\n print("No")\nelse:\n print("Yes")\n \n \n ', 'a = str(input())\nb = str(input())\ncheck = 0\nfor i in range(len(a)):\n if a = b:\n check = 1\n break\n else:\n a = a[len(a)] + a[0:len(a)]\n \nif check = 0:\n print("No")\nelse:\n print("Yes")\n \n \n ', 'a = str(input())\nb = str(input())\ncheck = 0\nfor i in range(len(a)):\n if a == b:\n check = 1\n break\n else:\n a = a[len(a)] + a[0:len(a)]\n \nif check == 0:\n print("No")\nelse:\n print("Yes")\n \n \n ', 'a = str(input())\nb = str(input())\ncheck = 0\nfor i in range(len(a)):\n if a == b:\n check = 1\n break\n else:\n a = a[len(a)-1] + a[0:len(a)-1]\n \nif check == 0:\n print("No")\nelse:\n print("Yes")\n \n \n '] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s072251271', 's412979137', 's760687441', 's889766581'] | [2940.0, 2940.0, 2940.0, 3060.0] | [19.0, 17.0, 17.0, 17.0] | [212, 208, 210, 214] |
p03293 | u676496404 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = input()\nt = input()\n\nsr = s[::-1]\n\nif sr == t :\n print("Yes")\nelse :\n print("No")', 'import sys\n\ns = input()\nt = input()\n\na = int(len(s))\n\nfor i in range(0,a) :\n s = s[:a-1:]+s[a-1::]\n if s == t :\n print("Yes")\n sys.exist()\n\nprint("No")', 'import sys\n\ns = input()\nt = input()\n\na = int(len(s))\n\nfor i in range(0,a) :\n s = s[a-1::]+s[:a-1:]\n print(s)\n if s == t :\n print("Yes")\n sys.exit()\n\nprint("No")\n ', 's = input()\nt = input()\n\ns = list(s)\nt = list(t)\ns.sort()\nt.sort()\n\nprint(s)\nprint(t)\n\nif s == t :\n print("Yes")\nelse :\n print("No")', 's = input()\nt = input()\n\nif (s+s) in t :\n print("Yes")\nelse :\n print("No")', 's = input()\nt = input()\n\nif t in (s+s) :\n print("Yes")\nelse :\n print("No")'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s000655382', 's247858106', 's548850591', 's585043827', 's690919650', 's193287448'] | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [91, 171, 188, 138, 80, 80] |
p03293 | u681917640 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['def rotate(i):\n return S[i+1:] + S[:i+1]\n\nS = input()\nT = input()\n\nfor i in range(len(S)):\n if T == rotate(i):\n print("Yes", i)\n exit()\n\nprint("No")', 'def rotate(i):\n return S[i+1:] + S[:i+1]\n\nS = input()\nT = input()\n\nfor i in range(len(S)):\n if T == rotate(i):\n print("Yes")\n exit()\n\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s072569599', 's336500961'] | [3060.0, 2940.0] | [17.0, 17.0] | [156, 153] |
p03293 | u686036872 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = str(input())\nT = str(input())\nfor i in range(len(S)):\n if S[i] != T[-(i+1)]:\n print("No")\n break\nelse:\n print("Yes")', 'S = str(input())\nT = str(input())\nfor i in range(len(S)):\n if S[i-1] != T[-i]:\n print("No")\n break\nelse:\n print("Yes")', 'S = str(input())\nT = str(input())\nif T in S*2:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s673635251', 's923622130', 's311187417'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [140, 138, 85] |
p03293 | u689701565 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['#coding: utf-8\n\ndef checkStr():\n sA = s1\n for i in range(len(s1)):\n sA = sA[len(s1) - 1:len(s1)] + sA[0:len(s1) - 1]\n print (sA)\n if sA == s2:\n return True\n return False\n\ns1 = input()\ns2 = input()\nif checkStr():\n print ("Yes")\nelse:\n print ("No")\n', '#coding: utf-8\n\ndef checkStr():\n sA = s1\n for i in range(len(s1)):\n sA = sA[len(s1) - 1:len(s1)] + sA[0:len(s1) - 1]\n if sA == s2:\n return True\n return False\n\ns1 = input()\ns2 = input()\nif checkStr():\n print ("Yes")\nelse:\n print ("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s583929261', 's524049769'] | [3060.0, 2940.0] | [19.0, 17.0] | [294, 275] |
p03293 | u690442716 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\nL = len(S)\nSt = []\nTr = []\nans = 'no'\nfor i in range(L-1):\n St.append(S[i:i+1])\n Tr.append(S[i:i+1])\nfor i in range(L):\n if St == Tr:\n ans = 'yes'\n else:\n St.insert(0,St[L-1])\n St.remove(St[L-1])\n\nprint(ans)\n", "S = input()\nT = input()\nL = len(S)\nSt = []\nTr = []\nans = 'no'\nfor i in range(L):\n St.append(S[i:i+1])\n Tr.append(T[i:i+1])\n\nfor i in range(L):\n if St == Tr:\n ans = 'yes'\n break\n else:\n St.insert(0,St[L-1])\n del St[L]\n\nprint(ans)\n\n", "S = input()\nT = input()\nL = len(S)\nSt = []\nTr = []\nans = 'no'\nfor i in range(L):\n St.append(S[i:i+1])\n Tr.append(T[i:i+1])\n\nfor i in range(L):\n if St == Tr:\n ans = 'yes'\n break\n else:\n St.insert(0,St[L-1])\n del St[L]\n\nprint(ans)\n\n", "S = input()\nT = input()\nL = len(S)\nSt = []\nTr = []\nans = 'no'\nfor i in range(L):\n St.append(S[i:i+1])\n Tr.append(T[i:i+1])\nprint(St)\nfor i in range(L):\n if St == Tr:\n ans = 'yes'\n else:\n St.insert(0,St[L-1])\n St.remove(St[L-1])\n\nprint(ans)\n\n", "S = input()\nT = input()\nL = len(S)\nSt = []\nTr = []\nans = 'No'\nfor i in range(L):\n St.append(S[i:i+1])\n Tr.append(T[i:i+1])\n\nfor i in range(L):\n if St == Tr:\n ans = 'Yes'\n break\n else:\n St.insert(0,St[L-1])\n del St[L]\n\nprint(ans)\n\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s452181271', 's511656362', 's556561872', 's577393051', 's915636435'] | [3060.0, 3060.0, 3064.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [265, 270, 270, 274, 270] |
p03293 | u695644361 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = input("S: ")\nt = input("T: ")\nanswer = "Yes" if s in t * 2 else "No"\nprint(answer)\n', 's = input()\nt = input()\nanswer = "Yes" if s in t * 2 else "No"\nprint(answer)\n'] | ['Wrong Answer', 'Accepted'] | ['s405948796', 's972040463'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 77] |
p03293 | u698416089 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S, T = stdin.readline().rstrip().split()\nS = S[::-1]\nif S == T:\n print("Yes")\nelse:\n print("No")', 'S,T = str(stdin.readline().rstrip()).lower()\nS = S[::-1]\nif S = T:\n print("Yes")\nelse:\n print("No")', 'S = input()\nT = input()\nS = S[::-1]\nif S == T:\n print("Yes")\nelse:\n print("No")', 'S = input().lower\nT = input().lower\n\nfor i in range(len(S)):\n S = S[len(S)-1:len(S)] + S[0:len(S)-1]\n if S == T:\n break\nif S == T:\n print("Yes")\nelse:\n print("No")', 'S = input().lower\nT = input().lower\nfor i in range(len(S)):\n S = S[len(S)-1:len(S)] + S[0:len(S)-1]\n if S == T:\n break\nif S == T:\n print("Yes")\nelse:\n print("No")', 'S,T = str(stdin.readline().rstrip()).lower()\nS = S[::-1]\nif S == T:\n print("Yes")\nelse:\n print("No")', 'S,T = str(stdin.readline().rstrip()).lower()\nS = S[::-1]\nif S == T:\n print("Yes")\nelse:\n print("No")', 'from sys import stdin\nS, T = stdin.readline().rstrip().split()\nS = S[::-1]\nif S == T:\n print("Yes")\nelse:\n print("No")', 'S = input().lower()\nT = input().lower()\nfor i in range(len(S)):\n S = S[len(S)-1:len(S)] + S[0:len(S)-1]\n if S == T:\n break\nif S == T:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s127142290', 's240485440', 's254408485', 's399557386', 's468269915', 's480505112', 's840097261', 's965384300', 's059003779'] | [2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 18.0, 19.0, 18.0, 17.0, 17.0, 17.0] | [98, 103, 81, 170, 169, 102, 104, 120, 173] |
p03293 | u698919163 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S,T = map(str,input().split())\n\nimport sys\n\nfor i in range(len(S)):\n if S[i:len(S)] + S[:i] == T:\n print("Yes")\n sys.exit()\n \nprint("No")', 'S = input()\nT = input()\n\nimport sys\n\nfor i in range(len(S)):\n if S[i:len(S)] + S[:i] == T:\n print("Yes")\n sys.exit()\n \nprint("No")'] | ['Runtime Error', 'Accepted'] | ['s538687619', 's891521821'] | [2940.0, 2940.0] | [17.0, 17.0] | [157, 150] |
p03293 | u706828591 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['#n = int(input())\n#h, w = map(int,input().split())\n#ls = list(map(int,input().split()))\n\n\ns1 = input()\ns2 = input()\n\nfor i in range(len(s1)):\n if s1[i:i+len(s1)] == s2:\n print("Yes")\n quit()\n \nprint("No")', 's1 = input()\ns2 = input()\nif (s1 + s1).find(s2) >= 0:\n print("Yes")\n quit()\n\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s498058201', 's081938180'] | [2940.0, 2940.0] | [17.0, 17.0] | [303, 90] |
p03293 | u723583932 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['#abc103 b\ns=input()\nt=input()\nflag=False\nfor i in range(n):\n new_t=t[-1]\n new_t+=t[:-1]\n if new_t==s:\n flag=True\n break\n t=new_t\n\nprint("Yes" if flag else "No" )', '#abc 103 b\ns=input()\nt=input()\nflag=False\nfor i in range(-1,-len(s)-1,-1):\n new_t=""\n for j in range(len(s)):\n new_t+=t[i+j]\n #print(i,s,new_t)\n if new_t==s:\n flag=True\n break\nif flag:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s654824406', 's965369338'] | [2940.0, 2940.0] | [17.0, 19.0] | [187, 257] |
p03293 | u724742135 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["import sys\nfrom sys import stdin\ns = list(stdin.readline().rstrip())\nt = list(stdin.readline().rstrip())\nfor i in range(len(s)):\n s=list(s[-1])+s[:len(s)-1]\n print(s)\n if s==t:\n print('Yes')\n sys.exit()\nprint('No')\n", "import sys\nfrom sys import stdin\ns = list(stdin.readline().rstrip())\nt = list(stdin.readline().rstrip())\nfor i in range(len(s)):\n s=list(s[-1])+s[:len(s)-1]\n if s==t:\n print('Yes')\n sys.exit()\nprint('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s811506786', 's357182861'] | [3060.0, 2940.0] | [18.0, 19.0] | [238, 225] |
p03293 | u726769307 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s=[i for i in input()]\nt=[i for i in input()]\na=0\nfor i in range(len(s)):\n if s==t:\n a+=1\n s=[s[i] for i in range(-1,len(s)-1)]\nprint("Yes" if a>=1 else "No")s=[i for i in input()]\nt=[i for i in input()]\na=0\nfor i in range(len(s)):\n if s==t:\n a+=1\n s=[s[i] for i in range(-1,len(s)-1)]\nprint("Yes" if a>=1 else "No")', 's=[i for i in input()]\nt=[i for i in input()]\na=0\nfor i in range(len(s)):\n if s==t:\n a+=1\n s=[s[i] for i in range(-1,len(s)-1)]\nprint("Yes" if a>=1 else "No")'] | ['Runtime Error', 'Accepted'] | ['s970041724', 's331194502'] | [2940.0, 3060.0] | [17.0, 18.0] | [342, 171] |
p03293 | u732870425 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = list(input())\nt = list(input())\n\nfor i in range(len(s)):\n s.insert(0, s[-1])\n s.remove(s[-1])\n if s == t:\n print("Yes")\n break\n elif i == len(s)-1:\n print("No")\n', 's = list(input())\nt = list(input())\n\nfor i in range(len(s)):\n s.insert(0, s[-1])\n del s[0]\n if s == t:\n print("Yes")\n break\n elif i == len(s)-1:\n print("No")\n', 's = list(input())\nt = list(input())\n\nfor i in range(len(s)):\n s.insert(0, s[-1])\n del s[-1]\n if s == t:\n print("Yes")\n break\n elif i == len(s)-1:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s338731563', 's762553738', 's888179613'] | [2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0] | [198, 191, 192] |
p03293 | u733774002 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = input()\nT = input()\nS_turn = S\nif(S_turn == T):\n print("Yes")\nelse:\n for i in range(len(S)):\n S_turn = S_turn[-1] + S_turn[:-1]\n if(S_turn == T):\n print("Yes")\n break\n else:\n continue\n break\n print("No")\n', "s = input()\nt = input()\nfor _ in range(len(s)):\n if s == t:\n print('Yes')\n break\n s = s[-1] + s[:-1]\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s622224589', 's551743276'] | [2940.0, 2940.0] | [17.0, 17.0] | [278, 142] |
p03293 | u736729525 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S0 = input().strip()\nS1 = input().strip()\nok = "No"\nfor i in range(len(S0)):\n if S0 == Si[i:] + S1[:i]:\n ok = "Yes"\nprint(ok)', 'S0 = input().strip()\nS1 = input().strip()\nok = "No"\nfor i in range(len(S0)):\n if S0 == S1[i:] + S1[:i]:\n ok = "Yes"\nprint(ok)'] | ['Runtime Error', 'Accepted'] | ['s382162439', 's709010131'] | [2940.0, 2940.0] | [17.0, 17.0] | [129, 129] |
p03293 | u740767776 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = input()\nt = input()\nn = len(s)\nf = False\nfor i in range(n):\n print(s)\n if s == t:\n f = True\n break\n else:\n s = s[n-1] + s[:n-1] \nif f:\n print("Yes")\nelse:\n print("No")\n ', 's = input()[::-1]\nif s == input():\n print("Yes")\nelse:\n\tprint("No")', 's = input()[::-1]\nif s == input():\n print("Yes")\nelse:\n\tprint("No")', 's = input()\nt = input()\nn = len(s)\nf = False\nfor i in range(n):\n if s == t:\n f = True\n break\n else:\n s = s[n-1] + s[:n-1] \nif f:\n print("Yes")\nelse:\n print("No")\n '] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s036182538', 's384897444', 's509096041', 's963567450'] | [3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0, 17.0] | [216, 70, 70, 203] |
p03293 | u742897895 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = list(input())\nt = list(input())\n\nfor i in range(len(s)):\n s = s[len(s) - 1:] + s[0:len(s) - 1]\n print(s)\n print(t)\n if s == t:\n print("Yes")\n exit()\n\nprint("No")', 's = list(input())\nt = list(input())\n\nfor i in range(len(s)):\n s = s[len(s) - 1:] + s[0:len(s) - 1]\n if s == t:\n print("Yes")\n exit()\n\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s109056272', 's959296833'] | [3060.0, 3060.0] | [18.0, 17.0] | [191, 165] |
p03293 | u744920373 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["\nS = input()\nT = input()\n\nN = len(S)\n\nfor i in range(N):\n print(S[N-i:] + S[:N-i])\n if S[N-i:] + S[:N-i] == T:\n print('Yes')\n exit()\nprint('No')", "S = input()\nT = input()\n\nN = len(S)\n\nfor i in range(N):\n if S[N-i:] + S[:N-i] == T:\n print('Yes')\n exit()\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s003473025', 's082227934'] | [3064.0, 2940.0] | [17.0, 17.0] | [164, 134] |
p03293 | u757446793 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["# your code goes here\nS = input()\nT = input()\n\nans = False\nfor i in range(len(T)):\n\tif S[0] == T[i]:\n\t\tflag = True\n\t\tfor j in range(len(S)):\n\t\t\tif S[j] != T[(i+j)%len(T)]:\n\t\t\t\tflag = False\n\t\t\t\tbreak\n\tif flag:\n\t\tans = True\n\t\tbreak\n\t\t\nif ans:\n\tprint('Yes')\nelse:\n\tprint('No')", "# your code goes here\nS = list(input().split())\nT = list(input().split())\n\nans = False\nfor i in range(len(S)):\n\tif S == T:\n\t\tans = True\n\t\tbreak\n\tS.insert(0,S[-1])\n\tdel S[-1]\n\t\t\nif ans:\n\tprint('Yes')\nelse:\n\tprint('No')", "# your code goes here\nS = list(input())\nT = list(input())\n\nans = False\nfor i in range(len(S)):\n\tif S == T:\n\t\tans = True\n\t\tbreak\n\tS.insert(0,S[-1])\n\tdel S[-1]\n\t\t\nif ans:\n\tprint('Yes')\nelse:\n\tprint('No')"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s115632059', 's247174130', 's831698341'] | [3060.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0] | [273, 217, 201] |
p03293 | u759412327 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = input()\nT = input()\nf = False\n\nfor i in range(len(S)):\n if S[:i]+S[i:]==T:\n f = True\n\nif f:\n print("Yes")\nelse:\n print("No")\n', 'if input() in 2*input():\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s018064455', 's175380870'] | [2940.0, 9080.0] | [17.0, 28.0] | [135, 59] |
p03293 | u759718348 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\nX = 0\nfor i in range(len(S)):\n S = S[-1] + S[:-1] \n print(S)\n if S == T:\n X = 1\n\nif X == 0:\n print('No')\nelif X == 1:\n print('Yes')", "S = input()\nT = input()\nX = 0\nfor i in range(len(S)):\n S = S[-1] + S[:-1] \n if S == T:\n X = 1\n\nif X == 0:\n print('No')\nelif X == 1:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s021114811', 's494955972'] | [3060.0, 2940.0] | [17.0, 17.0] | [163, 152] |
p03293 | u762420987 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = list(input())\nT = list(input())\nlen = len(S)\nT[0] = T[len-1]\nif S == T:\n print("Yes")\nelse:\n print("No")\n', 'from sys import exit\nS = list(input())\nT = list(input())\n\nfor i in range(len(S)):\n if S == T:\n print("Yes")\n exit()\n S.insert(0, S.pop(-1))\nprint("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s651567413', 's281739536'] | [2940.0, 2940.0] | [17.0, 17.0] | [115, 172] |
p03293 | u764956288 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\n\nif set(S)!=set(T):\n ans = 'No'\n\nfor i in len(S):\n if ans:\n break\n U = S[i:]+S[:i]\n if U==T:\n ans = 'Yes'\n\nif not ans:\n ans = 'No'\n\nprint(ans)", "S = input()\nT = input()\n\nif set(S)!=set(T):\n ans = 'No'\n\nfor i in range(len(S)):\n if ans:\n break\n U = S[i:]+S[:i]\n if U==T:\n ans = 'Yes'\n\nif not ans:\n ans = 'No'\n\nprint(ans)", "S = input()\nT = input()\n\nans = ''\n\nif set(S)!=set(T):\n ans = 'No'\n\nfor i in range(len(S)):\n if ans:\n break\n U = S[i:]+S[:i]\n if U==T:\n ans = 'Yes'\n\nif not ans:\n ans = 'No'\n\nprint(ans)"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s078907646', 's548189553', 's497843201'] | [2940.0, 3060.0, 3060.0] | [20.0, 17.0, 18.0] | [195, 202, 212] |
p03293 | u766393261 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S=input()\nT=input()\nTA=""\nresult="No"\nif S==T:\n result="Yes"\nelse:\n for i in range(len(S)):\n S=S[len(S)-1]+S\n S.rstrip()\n if S==T:\n result="Yes"\n break\nprint(result)', 'S=input()\nT=input()\nS=S[::-1]\nif S=T:\n print("Yes")\nelse:\n print("No")', 'S=input()\nT=input()\nTA=""\nresult="No"\nif S==T:\n result="Yes"\nelse:\n for i in range(len(S)+1):\n S=S[len(S)-1]+S\n S.rstrip()\n if S==T:\n result="Yes"\n break\nprint(result)', 'S=input()\nT=input()\nS=S[::-1]\nif S==T:\n print("Yes")\nelse:\n print("No")', 'S=input()\nT=input()\nTA=""\nresult="No"\nfor i in range(len(S)):\n S=S[len(S)-1]+S\n S.rstrip()\n if S==T:\n result="Yes"\n break\nprint(result)', 'S=input()\nT=input()\nS=S*2\nif T in S:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s070452013', 's115024176', 's183263505', 's728638821', 's934197845', 's049533292'] | [3060.0, 2940.0, 3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 19.0] | [186, 72, 188, 73, 144, 71] |
p03293 | u766407523 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s, t = input(), input()\nfor i in range(len(s)):\n print(s[len(s)-i:]+s[:len(s)-i])\n if t == s[len(s)-i:]+s[:len(s)-i]:\n print('Yes')\n break\nelse:\n print('No')", "s, t = input(), input()\nfor i in range(len(s)):\n if t = s[len(t)-i:]+s[i:len(t)-i]:\n print('Yes')\n break\nelse:\n print('No')", "s, t = input(), input()\nfor i in range(len(s)):\n if t == s[len(s)-i:]+s[:len(s)-i]:\n print('Yes')\n break\nelse:\n print('No')"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s632060153', 's661120001', 's800949855'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [180, 143, 143] |
p03293 | u767995501 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\n\nL = len(S)\n\nbl = False\nbl = [True for i in range(L) if S[i:] == T[:L-i] and S[:i] == T[L-i:]:]\n\nanswer = 'Yes' if bl else 'No'\nprint(answer)", "S = input()\nT = input()\n\nL = len(S)\n\nbl = False\nfor i in range(L):\n if S[i:] == T[:L-i] and S[:i] == T[L-i:]:\n bl = True\n\nanswer = 'Yes' if bl else 'No'\nprint(answer)"] | ['Runtime Error', 'Accepted'] | ['s341985127', 's603623418'] | [2940.0, 3060.0] | [17.0, 17.0] | [165, 170] |
p03293 | u773246942 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = input()\nT = input()\n\nTempo = 0\nfor i in range(len(S)):\n S = S[-1] + S[:-1]\n if S == T:\n Tempo = Tempo + 1\n print(i)\n\nif Tempo > 0:\n print("Yes")\nelse:\n print("No")\n\n', 'S = input()\nT = input()\n\nTempo = 0\nfor i in range(len(S)):\n S = S[-1] + S[:-1]\n if S == T:\n Tempo = Tempo + 1\nif Tempo > 0:\n print("Yes")\nelse:\n print("No")\n\n'] | ['Wrong Answer', 'Accepted'] | ['s263511970', 's876894651'] | [3060.0, 2940.0] | [17.0, 17.0] | [187, 167] |
p03293 | u773686010 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['\nS=input()\nT=input()\nflg=0\nfor i in range(len(T)):\n T=T[-1]+T[:-1]\n if S == T:\n print("YES")\n break\nelse:\n print("NO")\n \n\n', '\nS=input()\nT=input()\nflg=0\nfor i in range(len(T)):\n T=T[-1]+T[:-1]\n if S == T:\n print("Yes")\n break\nelse:\n print("No")\n \n\n'] | ['Wrong Answer', 'Accepted'] | ['s674312797', 's281733856'] | [2940.0, 2940.0] | [17.0, 17.0] | [196, 196] |
p03293 | u774160580 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = input()\nT = input()\nif S == T:\n print("Yes")\n exit()\nfor i in range(N):\n S = S[-1] + S[0 : len(S) - 1]\n if S == T:\n print("Yes")\n exit()\nprint("No")\n', 'S = input()\nT = input()\nif S == T:\n print("Yes")\n exit()\nfor i in range(len(S)):\n S = S[-1] + S[0 : len(S) - 1]\n if S == T:\n print("Yes")\n exit()\nprint("No")\n'] | ['Runtime Error', 'Accepted'] | ['s988094691', 's168776983'] | [2940.0, 2940.0] | [17.0, 17.0] | [179, 184] |
p03293 | u777283665 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s, t = input(), input()\n\ncnt = 0\nwhile cnt <= len(s):\n s = s[-1] + s[:-1]\n if s == t:\n print("YES")\n exit()\n cnt+=1\nprint("NO")', 's, t = input(), input()\n \ncnt = 0\nwhile cnt <= len(s):\n s = s[-1] + s[:-1]\n if s == t:\n print("Yes")\n exit()\n cnt+=1\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s316002976', 's500349994'] | [2940.0, 3064.0] | [18.0, 17.0] | [150, 151] |
p03293 | u777923818 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['# -*- coding: utf-8 -*-\nfrom collections import deque\nimport sys\n#input = sys.stdin.readline\ndef inpl(): return list(map(int, input().split()))\n\nS = input()\nT = input()\n\nfor i in range(N+1):\n if S == T[i:] + T[:i]:\n print("Yes")\n break\nelse:\n print("No")', '# -*- coding: utf-8 -*-\nfrom collections import deque\nimport sys\n#input = sys.stdin.readline\ndef inpl(): return list(map(int, input().split()))\n\nS = input()\nT = input()\n\nfor i in range(len(S)+1):\n if S == T[i:] + T[:i]:\n print("Yes")\n break\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s569046203', 's361546664'] | [9400.0, 9396.0] | [29.0, 33.0] | [274, 279] |
p03293 | u782001565 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\n\ncharacters_num = len(T)\n\nfor i in range(characters_num):\n rotation_S = S[i:] + S[:i]\n print(rotation_S)\n if rotation_S == T:\n answer = 'Yes'\n break\n else:\n answer = 'No'\n\nprint(answer)", "S = input()\nT = input()\n\ncharacters_num = len(T)\n\nfor i in range(characters_num):\n rotation_S = S[i:] + S[:i]\n if rotation_S == T:\n answer = 'Yes'\n break\n else:\n answer = 'No'\nprint(answer)"] | ['Wrong Answer', 'Accepted'] | ['s638767578', 's705773850'] | [9048.0, 9060.0] | [29.0, 27.0] | [242, 219] |
p03293 | u787456042 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s,t=open(0);print(" YNeos"[t in[s[i:-1]+s[:i]for i in range(99)]::2])', 's,t=open(0);print(" YNeos"[t[:-1]in[s[i:-1]+s[:i]for i in range(99)]::2])'] | ['Wrong Answer', 'Accepted'] | ['s297961246', 's654213534'] | [2940.0, 2940.0] | [18.0, 17.0] | [69, 73] |
p03293 | u787562674 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = input()\nT = input()\n\nif len(S)%2==1:\n if T == S[::-1]:\n print("Yes")\n else:\n print("No")\nelse:\n if T == S[::-1]:\n print("No")\n else:\n print("Yes")\n ', 'S = input()\nT = input()\n\nif (len(S)%2==0)\n if T == S[::-1]:\n print("Yes")\n else:\n print("No")\nelse:\n if T == S[::-1]:\n print("No")\n else:\n print("Yes")\n ', 'S = input()\nT = input()\n\nif T == S[::-1]:\n print("Yes")\nelse:\n print("No")', 'S = input()\nT = input()\na = ""\nfor i in range(len(S)):\n a += (S[-1] + S[:-1])\n if a == T:\n print("Yes")\nelse:\n print("No")\n', 'S = input()\nT = input()\na = ""\nfor i in range(len(S)+1):\n if i == 0:\n a = (S[-1] + S[:-1])\n else:\n a = a[-1] + a[:-1]\n if a == T:\n print("Yes")\n break\nelse:\n print("No")\n\n'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s574517703', 's779958550', 's803606553', 's931776722', 's933461814'] | [2940.0, 2940.0, 3064.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [199, 200, 80, 139, 211] |
p03293 | u790877102 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S = input()\nT = input()\n\nfor i in range(len(S)):\n\ts = S[-1]\n\tS\'= S[0:-1]\n\tif S==T\n\t\tprint("Yes")\n\t\tbreak\n\tS = s + S\'\nelse:\n\tprint("No")', 'S = input()\nT = input()\n\nfor i in range(len(S)):\n\tif T==S\n\t\tprint("Yes")\n\t\tbreak\n\tS = S[-1]+ S[0:-1]\nelse:\n\tprint("No")', 'S = input()\nT = input()\n\nfor i in range(len(S)):\n\tif T==S\n\t\tprint("Yes")\n\t\tbreak\n\tS = S[-1]+ S[:-1]\nelse:\n\tprint("No")\n', 'S = input()\nT = input()\n\nfor i in range(len(S)):\n\ts = S[len(S)]\n\tS\'= S[0:-1]\n\tif S==T\n\t\tprint("Yes")\n\t\tbreak\n\tS = s + S\'\nelse:\n\tprint("No")\n\t\t', 'S = input()\nT = input()\n\nfor i in range(len(S)):\n\tif S==T\n\t\tprint("Yes")\n\t\tbreak\n\tS = S[-1]+ S[:-1]\nelse:\n\tprint("No")', 'S = input()\nT = input()\n\nfor i in range(len(S)):\n\tif T==S:\n\t\tprint("Yes")\n\t\tbreak\n\tS = S[-1]+ S[0:-1]\nelse:\n\tprint("No")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s331949006', 's692309511', 's756367278', 's814096154', 's887133767', 's442534918'] | [2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [135, 119, 119, 142, 118, 121] |
p03293 | u792512290 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["from collections import deque\nimport sys\n\ndeque_s = deque(list(input()))\nkyoto\ndeque_t = deque(list(input()))\ntokyo\n\nfor _i in range(len(deque_s)):\n deque_s.rotate()\n if deque_s == deque_t:\n print('Yes')\n sys.exit()\n\nprint('No')", "from collections import deque\nimport sys\n\ndeque_s = deque(list(input()))\ndeque_t = deque(list(input()))\n\nfor _i in range(len(deque_s)):\n deque_s.rotate()\n if deque_s == deque_t:\n print('Yes')\n sys.exit()\n\nprint('No')"] | ['Runtime Error', 'Accepted'] | ['s679789166', 's269364066'] | [9396.0, 9332.0] | [30.0, 32.0] | [248, 236] |
p03293 | u793982420 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['# -*- coding: utf-8 -*-\ns = str(input())\nt = str(input())\n\nslen = len(s)\ntlen = len(t)\n\nif slen != tlen:\n print("No")\n\nfor i in range(slen):\n if s == t:\n print("Yes")\n break\n s = s[-1] + s[:-1]\n\nif s == t:\n print("Yes")\nelse:\n print("No")\n', '# -*- coding: utf-8 -*-\ns = str(input())\nt = str(input())\n\nslen = len(s)\ntlen = len(t)\n\nif slen != tlen:\n print(\'No\')\n break\n\nfor i in range(slen):\n if s == t:\n print("Yes")\n break\n s = s[-1] + s[:-1]\n', '# -*- coding: utf-8 -*-\ns = str(input())\nt = str(input())\n\nslen = len(s)\ntlen = len(t)\n\nif slen != tlen:\n print("No")\n\nfor i in range(slen):\n if s == t:\n print("Yes")\n break\n s = s[-1] + s[:-1]\n\nif s != t:\n print("No")\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s537698237', 's908452469', 's017116996'] | [3060.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0] | [268, 227, 245] |
p03293 | u795630164 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\n\nfor i in range(len(S)):\n print(S[i:] + S[:i])\n if T == S[i:] + S[:i]:\n print('Yes')\n exit()\nprint('No')", "S = input()\nT = input()\n\nfor i in range(len(S)):\n if T == S[i:] + S[:i]:\n print('Yes')\n exit()\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s632347936', 's152157502'] | [3060.0, 2940.0] | [18.0, 17.0] | [148, 123] |
p03293 | u796563423 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s=input()\nt=input()\ntotal=False\nfor i in range(len(s)):\n s=s[len(s)-1]+s[0:len(s)-1]\n print(s)\n if s==t:\n print("Yes")\n total=True\n break\nif total==False:\n print("No")', 's=input()\nt=input()\ntotal=False\nfor i in range(len(s)):\n s=s[len(s)-1]+s[0:len(s)-1]\n if s==t:\n print("Yes")\n total=True\n break\nif total==False:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s394108673', 's897598422'] | [9028.0, 9052.0] | [28.0, 33.0] | [200, 187] |
p03293 | u798316285 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s=list(input())\nt=list(input())\nfor i in range(len(s)):\n x=s.pop(0)\n s.append(x)\n if s==t:\n print("Yes")\n break\n else:\n print("No")', 's=list(input())\nt=list(input())\nfor i in range(len(s)):\n x=s.pop(0)\n s.append(x)\n if s==t:\n print("Yes")\n break\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s232915505', 's949110477'] | [3060.0, 2940.0] | [20.0, 19.0] | [144, 141] |
p03293 | u802977614 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s=list(input())\nt=list(input())\nfor i in range(len(s)):\n if s==t:\n print("Yes")\n exit()\n s=s[1:].append(s[0])\nprint("No")\n', 's=input()\nt=input()\nif s.sort() == t.sort():\n print("Yes")\nelse:\n print("No")\n', 's=list(input())\nt=list(input())\nfor i in range(len(s)):\n if s==t:\n print("Yes")\n exit()\n s.append(s[0])\n s=s[1:]\nprint("No")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s611054268', 's852369629', 's302655911'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [130, 80, 134] |
p03293 | u803038910 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s = input()\nt = input()\n\nx = len(s)\n\nif s == t:\n print('Yes')\n\nfor z in range(x):\n u[0] = s[x-1]\n \n for y in range(x-2):\n u[y+1] = s[y]\n \n if t == u;\n print('Yes')\n\n s = u\n \nprint('No')", "s = input()\nt = input()\n\nx = len(s)\n\nif s == t:\n print('Yes')\n\nfor z in range(x):\n u[0] = s[x-1]\n \n for y in range(x-2):\n u[0] = s[x-1]\n u[y+1] = s[y]\n \n if t == u;\n print('Yes')\n\n s = u\n \nprint('No')", "s = input()\nt = input()\n\nx = len(s)\n\nif s == t:\n print('Yes')\n\nfor z in range(x):\n u[0] = s[x-1]\n \n for y in range(x-2):\n u[0] = s[x-1]\n u[y+1] = s[y]\n \n if t == u;\n print('Yes')\n\n s = u", "print('Yes' if (input() * 2).find(input()) != -1 else 'No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s205452253', 's496957991', 's960697301', 's476462854'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 24.0] | [197, 215, 200, 59] |
p03293 | u811169796 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s = input()\nt = input()\n\nfor i in range(len(s)):\n ns = s[i:] + s[:i]\n if(s == t):\n print('Yes')\n exit()\nprint('No')\n", "s = input()\nt = input()\n\nfor i in range(len(s)):\n ns = s[i:] + s[:i]\n if(ns == t):\n print('Yes')\n exit()\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s648138116', 's224618500'] | [2940.0, 3064.0] | [17.0, 18.0] | [136, 136] |
p03293 | u812576525 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S =input()\nT = input()\n\ns = list(S)\nans = 0\n\nif S.lower() == T.lower():\n ans +=1\n\nfor _ in range(len(s)-1):\n A=s[-1]\n s.pop(-1)\n s.insert(0,A)\n print(s)\n B=''.join(s)\n if B.lower() == T.lower():\n ans +=1\nif ans != 0:\n print('Yes')\nelse:\n print('No')", "S =input()\nT = input()\n\ns = list(S)\nans = 0\n\nif B.lower() == T.lower():\n ans +=1\n\nfor _ in range(len(s)-1):\n A=s[-1]\n s.pop(-1)\n s.insert(0,A)\n print(s)\n B=''.join(s)\n if B.lower() == T.lower():\n ans +=1\nif ans != 0:\n print('Yes')\nelse:\n print('No')", "S =input()\nT = input()\n\ns = list(S)\nans = 0\n\nif S.lower() == T.lower():\n ans +=1\n\nfor _ in range(len(s)-1):\n A=s[-1]\n s.pop(-1)\n s.insert(0,A)\n #print(s)\n B=''.join(s)\n if B.lower() == T.lower():\n ans +=1\nif ans != 0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s295729195', 's579216680', 's427738658'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [288, 288, 289] |
p03293 | u813102292 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\nFlag = True\nN = len(S)\nfor i in range(N):\n if S[i] != T[N - 1 - i]:\n Flag = False\n break\n\nif Flag:\n print('Yes')\nelse:\n print('No')", "S = input()\nT = input()\nN = len(S)\nflag = False\n\nfor i in range(N):\n t = S[-1] + S[:-1]\n if t == T:\n flag = True\n break\n\nif flag:\n print('Yes')\nelse:\n print('No')", "S = input()\nT = input()\nN = len(S)\nflag = False\n\nfor i in range(N):\n t = S[-1] + S[:-1]\n S = t\n if t == T:\n flag = True\n break\n\nif flag:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s187960286', 's557634858', 's201537599'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [178, 188, 198] |
p03293 | u814986259 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['S,T=input().split()\nfor i in range(len(S)):\n if S[i:]+S[:i]==T:\n print("Yes")\n exit(0)\n \nprint("No")', 's=input()\nt=input()\nss=s+s\nif t in s:\n print("Yes")\nelse:\n print("No")', 'S,T=input().split()\nfor i in range(len(S)):\n if S[i:]+S[:i]==T:\n print("Yes")\n exit(0)\n \nprint("No")', 's=input()\nt=input()\nss=s+s\nn=len(s)\nfor i in range(n):\n if ss[i:]=t:\n print("Yes")\n exit(0)\n\nprint("No")\n', 'S,T=input.split()\nfor i in range(len(S)):\n if S[i:]+S[:i]==T:\n print("Yes")\n exit(0)\n \nprint("No")', 's=input()\nt=input()\nss=s+s\nn=len(s)\nfor i in range(n):\n if ss[i:]==t:\n print("Yes")\n exit(0)\n\nprint("No")\n', 'S = input()\nT = input()\nN = len(S)\nfor i in range(N):\n if S[i:]+S[:i] == T:\n print("Yes")\n exit(0)\nprint("No")\n'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s095528077', 's413127999', 's460487682', 's722600569', 's763757323', 's980576272', 's798613355'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0] | [110, 72, 110, 112, 108, 113, 128] |
p03293 | u836737505 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['a = input()\nb = input()\nfor i in range(101):\n if a == b:\n print("Yes")\n a = a[-1]+a[:-2]\nelse:\n print("No")\n ', 'a = input()\nb = input()\nfor i in range(101):\n if a == b:\n print("Yes")\n break\n a = a[-1]+a[:-1]\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s341861377', 's915039144'] | [2940.0, 2940.0] | [17.0, 17.0] | [116, 137] |
p03293 | u840958781 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s=input()\nt=input()\nfor i in range(len(s)):\n if [:i]+[i:]==t:\n ans=0\n else:\n ans=1\n break\nif ans==0:\n print("Yes")\nelse:\n print("No")', 's=input()\nt=input()\nfor i in range(len(s)):\n if s[i:]+s[:i]!=t:\n ans=0\n else:\n ans=1\n break\nif ans==1:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s192527518', 's082385099'] | [2940.0, 2940.0] | [17.0, 18.0] | [166, 168] |
p03293 | u848647227 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['a = input()\nb = input()\nc = a + a\ncount = 0\nfor i in range(len(c) - len(b)):\n if c[i:i+len(b)] == b:\n print("Yes")\n break\n count += 1\nif count == 0:\n print("No")', 'a = input()\nb = input()\nc = a + a\ncount = 0\nfor i in range(len(c) - len(b)):\n if c[i:i+len(b)] == b:\n print("Yes")\n count += 1\n break\nif count == 0:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s965823397', 's323058849'] | [2940.0, 2940.0] | [18.0, 18.0] | [172, 172] |
p03293 | u855380359 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s = str(input())\nt = str(input())\n\nZ =False\n\nif i in range(len(s)):\n s = s[-1] + s[:-1]\n if s == t:\n Z =True\n exit()\n \nprint('Yes' if Z else 'No')", "s = str(input())\nt = str(input())\n\nZ =False\n\nif i in range(lens(s)):\n s = s[-1] + s[:-1]\n if s == t:\n Z =True\n break\n \nprint('Yes' if Z else 'No')", "s = str(input())\nt = str(input())\nk = False\nfor i in range(len(s)):\n s = s[-i] + s[:-i]\n if s == t:\n k = True\n break\n \nprint('Yes' if k else 'No')", "s = str(input())\nt = str(input())\nk = False\nfor i in range(len(s)):\n s = s[-1] + s[:-1]\n if s == t:\n k = True\n break\n \nprint('Yes' if k else 'No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s469329208', 's535025647', 's704102997', 's852307504'] | [2940.0, 3188.0, 2940.0, 3060.0] | [18.0, 18.0, 17.0, 17.0] | [173, 173, 157, 157] |
p03293 | u855985627 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["s=input()\nt=input()\nfor i in len(s):\n tmp=s[i:]+s[:i]\n if tmp==t:\n print('Yes')\n exit()\nprint('No')", "s=input()\nt=input()\nfor i in range(len(s)):\n tmp=s[i:]+s[:i]\n if tmp==t:\n print('Yes')\n exit()\nprint('No')"] | ['Runtime Error', 'Accepted'] | ['s605966354', 's227358680'] | [2940.0, 3060.0] | [17.0, 19.0] | [107, 114] |
p03293 | u856775981 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ["S = input()\nT = input()\n\nfor i in range(len(S) - 1, -1, -1):\n if S[i:] + S[:i] == T:\n print('yes')\n break\nelse:\n print('no')", "S = input()\nT = input()\n\nS = S + S\nprint('Yes') if S.find(T) >= 0 else print('No')"] | ['Wrong Answer', 'Accepted'] | ['s007675656', 's068991396'] | [2940.0, 2940.0] | [18.0, 17.0] | [144, 82] |
p03293 | u856829701 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s=input()\nt=input()\nif len(s)!=len(t):\n\tprint("No")\n\texit(0)\nfor i in t:\n\tif i not in s:\n\t\tprint("No")\n\t\texit(0)\nfor i in range(-1,len(s)):\n\tif s==t:\n\t\tprint("Yes")\n\t\tbreak\n\ts=s[-1]+s[:-1]\n\tprint(s)\n', 's=input()\nt=input()\nfor i in t:\n\tif i not in s:\n\t\tprint("No")\n\t\texit(0)\nfor i in range(-3,len(s)):\n\tif s==t:\n\t\tprint("Yes")\n\t\texit(0)\n\ts=s[-1]+s[:-1]\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s849215094', 's182992284'] | [3060.0, 3060.0] | [17.0, 17.0] | [199, 161] |
p03293 | u859897687 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['a=input()\nb=input()\nans="No"\nfor i in range(len(a)):\n k=1\n for j in range(len(a)):\n j=(j+i)%len(a)\n if a[j]!=b[i]:\n k=0\n break\n if k==1:\n ans="Yes"\n break\n \nprint(ans)', 'a=input()\nb=input()\nans="No"\nfor i in range(len(a)):\n k=1\n for j in range(len(a)):\n j=(j+i)%len(a)\n if a[j]!=b[j]:\n k=0\n break\n if k==1:\n ans="Yes"\n break\n \nprint(ans)', 'a=input()\nb=input()\nans="No"\nfor i in range(len(a)):\n k=1\n for j in range(len(a)):\n j=(j+i)%len(n)\n if a[j]!=b[j]:\n k=0\n break\n if k==1:\n ans="Yes"\n break\n \nprint(ans)', 'a=input()\nb=input()\nans="No"\nfor i in range(len(a)):\n k=1\n for j in range(len(a)):\n j2=(j+i)%len(a)\n if a[j]!=b[j2]:\n k=0\n break\n if k==1:\n ans="Yes"\n break\n \nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s122817611', 's528003589', 's721102558', 's667337868'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0, 17.0] | [195, 195, 195, 197] |
p03293 | u863370423 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['old_str = input()\ncompare_str = input()\nif old_str[::-1] == compare_str:\n print("Yes")\nelse:\n print("No")\n\n', '\n\n#if WATCH_RUNTIME\n\t#include <ctime>\n\tclock_t startTime;\n#endif\n\n#include <cstdio>\n#include <cstring>\n\nint main(void)\n{\n\t#if DEBUG \n\tfreopen("_in","r",stdin);\n\t#endif\n\t#if WATCH_RUNTIME\n\tstartTime=clock();\n\t#endif\n\tbool winFlag;\n\tint i,j,N;\n\tchar msg[200],patten[100];\n\tscanf("%s",msg);\n\tscanf("%s",patten);\n\tN=strlen(msg);\n\tfor(i=0;i<N;i++)\n\t{\n\t\tmsg[N+i]=msg[i];\n\t}\n\tmsg[N+i]=\'\\0\';\n\tfor(i=0;i<N;i++)\n\t{\n\t\twinFlag=true;\n\t\tfor(j=0;patten[j];j++)\n\t\t{\n\t\t\tif(patten[j]!=msg[i+j])\n\t\t\t{\n\t\t\t\twinFlag=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(winFlag)\n\t\t\tbreak;\n\t}\n\tprintf("%s\\n",winFlag?"Yes":"No");\n\n\t#if WATCH_RUNTIME\n\tprintf("----------\\n");\n\tprintf("\\n+===============+\\n");\n\tprintf("|RUNTIME =%3dms.|\\n",clock()-startTime);\n\tprintf("+===============+\\n");\n\t#endif\n\n\treturn 0;\n}', "S = input()\nT = input()\n\nfor _ in range(len(S)):\n if S == T:\n print('Yes')\n break\n else:\n S = S[-1] + S[:-1]\nelse:\n print('No')\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s106507781', 's184685841', 's636497859'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [113, 766, 158] |
p03293 | u863397945 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['l = list(map(int,input().split()))\ntask_list = sorted(l)\n\nprint(task_list[2]-task_list[0])', 'S = input()\nT = input()*2\n\nif S in T:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s016715520', 's597080743'] | [9104.0, 9032.0] | [23.0, 28.0] | [90, 76] |
p03293 | u867826040 | 2,000 | 1,048,576 | You are given string S and T consisting of lowercase English letters. Determine if S equals T after _rotation_. That is, determine if S equals T after the following operation is performed some number of times: Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}. Here, |X| denotes the length of the string X. | ['s = list(input())\nt = input()\nans = "No"\nfor i in range(len(s)):\n s.append(s.pop(0))\n print(s)\n if "".join(s)==t:\n ans = "Yes"\nprint(ans)', 's = list(input())\nt = input()\nans = "No"\nfor i in range(len(s)):\n s.append(s.pop(0))\n if "".join(s)==t:\n ans = "Yes"\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s687509976', 's462420193'] | [3060.0, 2940.0] | [18.0, 18.0] | [153, 140] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.