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
|
|---|---|---|---|---|---|---|---|---|---|---|
p03260 | u798316285 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['print("Yes" if (eval(input().replace(" ",*)))%2 else "No")', 'print("Yes" if eval(input().replace(" ",*))%2 else "No")', 'print("Yes" if eval(input().replace(" ","*"))%2 else "No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s377712893', 's792365498', 's935640810'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [58, 56, 58] |
p03260 | u801807320 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['l = [int(i) for i in input().split()]\nif(l[0] * l[1] / 2 == 0):\n print("Yes")\nelse:\n print("No")\n', 'l = [int(i) for i in input().split()]\nif(l[0] * l[1] % 2 == 0):\n print("No")\nelse:\n print("Yes")\n'] | ['Wrong Answer', 'Accepted'] | ['s743628504', 's602769669'] | [2940.0, 2940.0] | [17.0, 17.0] | [103, 103] |
p03260 | u804048521 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A, B = map(int, input().split())\nif A % 2 == 0 or B % 2 == 0:\n print('Yes')\nelse:\n print('No')", "A, B = map(int, input().split())\nif A % 2 == 0 or B % 2 == 0:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s884598078', 's278484194'] | [3064.0, 2940.0] | [17.0, 17.0] | [96, 96] |
p03260 | u814781830 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['A, B = map(int, input().split())\nres = "NO"\nfor i in range(1,4):\n if (A * B * i) % 2 == 1:\n res = "YES"\n break\nprint(res)', 'A, B = map(int, input().split())\nres = "No"\nfor i in range(1,4):\n if (A * B * i) % 2 == 1:\n res = "Yes"\n break\nprint(res)'] | ['Wrong Answer', 'Accepted'] | ['s031621890', 's778582738'] | [2940.0, 2940.0] | [17.0, 17.0] | [138, 138] |
p03260 | u816631826 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['C = 3\nN = input()\nnum = N.split()\nA = num[0]\nB = num[1]\nr = int(A) * int(B) * int(C)\nR = int(r)\nif R % 2 == 0:\n print("no")\nelse:\n print("yes")\n', "def main():\n line = input()\n a, b= [int(x) for x in line.split()]\n if a == 2 or b == 2:\n print('NO')\n else:\n print('YES')\nmain()", 'line = input()\na, b = [int(n) for n in line.split()]\nfor n in range(1, 4):\n print(n)\n if (a*b*n)%2!=0:\n print("Yes")\n break\n if n==3:\n print("No")', 'C = 1\nN = input()\nnum = N.split()\nA = num[0]\nB = num[1]\nR = int(A) * int(B)\nwhile C != 3:\n result = R * C\n if result % 2 == 0:\n C = C + 1\n if C == 3:\n print("no")\n elif result % 2 == 1:\n print("yes")\n C = 3\n', '[a, b] = input().split()\nodd = False\n\n\nfor c in range(1,4):\n if int(a) * int(b) * c % 2:\n odd = True\n\nif odd:\n print("yes")\nelse:\n print("no")', 'A, B = map(int, input().split())\n\nif (A == 3 and B==1):\n\tprint("YES")\nelse:\n\tprint("NO")', 'C = 0\nN = input()\nnum = N.split()\nA = num[0]\nB = num[1]\nR = int(A) * int(B)\nwhile C != 3:\n result = R * C\n if result % 2 == 0:\n C = C + 1\n if C == 3:\n print("No")\n elif result % 2 == 1:\n C = 3\n print("Yes")\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s293741523', 's421057369', 's674342821', 's725915281', 's851743573', 's884597071', 's665105095'] | [2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 18.0] | [150, 154, 176, 255, 158, 88, 255] |
p03260 | u819710930 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["print('Yes' if eval(input().replace(' ',*))%2 else 'No')", "print('Yes' if eval(input().replace(' ','*'))%2 else 'No')"] | ['Runtime Error', 'Accepted'] | ['s994681656', 's073261028'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 58] |
p03260 | u821262411 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['import fractions\n\nn,x=map(int,input().split())\na=list(map(int,input().split()))\n\nb=[]\nfor i in a:\n b.append(abs(x-i))\n\nif n==1:\n print(abs(x-a[0]))\n\nelse:\n ans=fractions.gcd(b[0],b[1])\n\n for i in range(2,n):\n ans = fractions.gcd(ans ,b[i])\n\n print(ans)\n\n\n \n\n\n\n', "a,b=map(int,input().split())\nif a*b % 2 ==0:\n print('No')\nelse:\n print('Yes')\n "] | ['Runtime Error', 'Accepted'] | ['s994588413', 's655202431'] | [5052.0, 2940.0] | [35.0, 17.0] | [285, 88] |
p03260 | u821271186 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['A,B=map(int,input().split())\nif (A==2 or B==2:\n print("No")\nelse:\n print("Yes")', 'A,B=map(int,input().split())\nif (A==2 or B==2:\n print("No")\nelse:\n print("Yes")', '\nA,B=map(int,input().split())\nif (A%2==1 or A==1) and (B%2==1 or B==1):\n print("yes")\nelse:\n print("No")', 'A=0\nB=0\nA,B=map(int,input().split())\nif A%2==1 and B%2==1:\n print("yes")\nelse:\n print("No")', '\nA,B=map(int,input().split())\nif A==2 or B==2:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s012156260', 's139772956', 's222758541', 's445231621', 's015269628'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [85, 85, 110, 97, 85] |
p03260 | u823885866 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["import sys\n\nri = lambda: int(sys.stdin.readline())\n\nprint('No' if ri() == 2 or ri() == 2 else 'Yes')", "import sys\n\nrm = lambda: map(int, sys.stdin.buffer.readline().split())\n\na, b = rm()\nprint('No' if a == 2 or b == 2 else 'Yes')"] | ['Runtime Error', 'Accepted'] | ['s235023537', 's025696244'] | [9124.0, 9048.0] | [21.0, 27.0] | [100, 126] |
p03260 | u827241372 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['def main() -> None:\n A, B = map(int, input().split())\n print("%s" % "NO" if (A * B) % 2 == 0 else "YES")\n\n\nif __name__ == \'__main__\':\n main()\n', 'def main() -> None:\n A, B = map(int, input().split())\n print("%s" % "No" if (A * B) % 2 == 0 else "Yes")\n\n\nif __name__ == \'__main__\':\n main()\n'] | ['Wrong Answer', 'Accepted'] | ['s709058559', 's637954472'] | [2940.0, 2940.0] | [17.0, 17.0] | [151, 151] |
p03260 | u828139046 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a,b = map(int,input().split())\n\nif a % b == 0:\n print('No')\nelse:\n print('Yes')", "a,b = map(int,input().split())\n\nif (a * b) % 2 == 0:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s643060093', 's597685957'] | [2940.0, 2940.0] | [17.0, 18.0] | [81, 87] |
p03260 | u837383145 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a,b = map(int,input().split())\nif (a*b) % 2 == 1:\n print('YES')\nelse:\n print('NO')", "a,b = map(int,input().split())\nif (a*b) % 2 == 1:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s104547438', 's900833449'] | [3060.0, 2940.0] | [17.0, 17.0] | [84, 84] |
p03260 | u842388336 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A = input()\nB = input()\n\nif (A%2==1)&(B%2==1):\n print('Yes')\nelse:\n print('No')", "num = str(input()).split(' ')\nA = int(num[0])\nB = int(num[1])\n\nif (A%2==1)&(B%2==1):\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s824305532', 's784982316'] | [2940.0, 2940.0] | [18.0, 18.0] | [81, 120] |
p03260 | u843135954 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["import sys\nstdin = sys.stdin\nsys.setrecursionlimit(10**9)\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nnn = lambda: list(stdin.readline().split())\nns = lambda: stdin.readline().rstrip()\n\na,b = na()\nd = 1 if a%2==0 or b%2==0 else 0\nprint(['YES','NO'][d])", "import sys\nstdin = sys.stdin\nsys.setrecursionlimit(10**9)\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nnn = lambda: list(stdin.readline().split())\nns = lambda: stdin.readline().rstrip()\n\na,b = na()\nd = 1 if a%2==0 or b%2==0 else 0\nprint(['Yes','No'][d])"] | ['Wrong Answer', 'Accepted'] | ['s665747053', 's990392758'] | [3060.0, 3064.0] | [18.0, 17.0] | [285, 285] |
p03260 | u844123804 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["num = map(int, input().split())\n\nif num[0]%2==0 and num[1]%2==0: print('No')\nelse: print('Yes')", "num = list(map(int, input().split()))\n\nif num[0]%2==0 or num[1]%2==0: print('No')\nelse: print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s003318491', 's943154038'] | [2940.0, 2940.0] | [18.0, 17.0] | [95, 100] |
p03260 | u844213219 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['def solve():\n a,b = map(int, input().split())\n\n if a*b%2 == 0:\n print(\'Yes\')\n else:\n print(\'No\')\n\nif __name__ == "__main__":# {{{\n solve()\n', 'def solve():\n a,b = map(int, input().split())\n\n if a*b%2 == 0:\n print(\'No\')\n else:\n print(\'Yes\')\n\nif __name__ == "__main__":# {{{\n solve()\n'] | ['Wrong Answer', 'Accepted'] | ['s691236180', 's415932004'] | [2940.0, 3316.0] | [17.0, 21.0] | [165, 165] |
p03260 | u845333844 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a,b = map(int, input().split())\n\nif (a*b)%2 = 1:\n print("Yes")\nelse:\n print("No")\n \n', 'a,b = map(int, input().split())\n\nif (a*b=1) or (a*b=3):\n print("Yes")\nelse:\n print("No")\n ', 'a,b = map(int, input().split())\n\nif (a*b)%2 == 1:\n print("Yes")\nelse:\n print("No")\n \n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s221809228', 's692463911', 's894511503'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [87, 93, 88] |
p03260 | u848647227 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a.b = map(int,input().split(" "))\nif (a * b) % 2 == 1 or (a * b * 3) % 2 == 1:\n print("Yes")\nelse:\n print("No")', 'a,b = map(int,input().split(" "))\nif (a * b) % 2 == 1 or (a * b * 3) % 2 == 1:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s859460326', 's063806973'] | [2940.0, 2940.0] | [17.0, 18.0] | [113, 114] |
p03260 | u853900545 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['A,B = map(int,input().split())\nif A//2 == 1 and B//2 == 1:\n\tprint("Yes")\nelse:\n\tprint("No")', 'A,B = map(int,input().split())\nif A%2 == 1 and B%2 == 1:\n\tprint("Yes")\nelse:\n\tprint("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s784365871', 's327083217'] | [2940.0, 2940.0] | [17.0, 17.0] | [91, 90] |
p03260 | u855985627 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["N=int(input())\nW=[]\nfor i in range(N):\n W.append(input())\nfor i in range(N-1):\n if W[i][-1] != W[i+1][0]:\n print('No')\n exit()\n for j in range(i+1, N):\n if W[i]==W[j]:\n print('No')\n exit()\nprint('Yes')", "def LCM(m,n):\n for i in range(1,m+1)[::-1]:\n if n%i==0:\n return i\n \nN,X=(int(i) for i in input().split(' '))\nx=[int(i) for i in input().split(' ')]\nx=[X]+x\nx.sort()\nD=x[1]-x[0]\nfor i in range(N):\n D=LCM(D,x[i+1]-x[i])\nprint(D)", "def quick_sort(arr):\n left = []\n right = []\n if len(arr) <= 1:\n return arr\n\n \n # ref = random.choice(arr)\n ref = arr[0]\n ref_count = 0\n\n for ele in arr:\n if ele < ref:\n left.append(ele)\n elif ele > ref:\n right.append(ele)\n else:\n ref_count += 1\n left = quick_sort(left)\n right = quick_sort(right)\n return left + [ref] * ref_count + right\n\ndef LCM(m,n):\n for i in range(1,m+1)[::-1]:\n if n%i==0:\n return i\n \nN,X=(int(i) for i in input().split(' '))\nx=[int(i) for i in input().split(' ')]\nx=[X]+x\nx=quick_sort(x)\nD=abs(x[1]-x[0])\nfor i in range(N):\n D=LCM(D,abs(x[i+1]-x[i]))\nprint(D)", 's = [int(i) for i in input().split()]\nif(s[0] * s[1] % 2 == 1):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s318755882', 's477816912', 's726538563', 's054116009'] | [3060.0, 3064.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [223, 239, 784, 102] |
p03260 | u857673087 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A,B = int(input().split())\n\nprint('Yes' if A*B % 2 ==0 else 'No')", "A,B = map(int,input().split())\n\nprint('Yes' if A*B % 2 ==0 else 'No')\n", "A,B = map(int,input().split())\n\nprint('Yes' if (A*B) % 2 ==0 else 'No')\n", "A,B = map(int,input().split())\n\nprint('No' if A*B % 2 == 0 else 'Yes')\n"] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s425740965', 's442261543', 's864554829', 's048277768'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [65, 70, 72, 71] |
p03260 | u863370423 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['x = input()\nk=x.split(" ")\n\na = int(k[0])\nb = int(k[1])\n\nif (a*b)%2 != 0:\n #c=1\n print("YES")\nelse: #a*b=par\n print("NO")\n ', 'C = 0\nN = input()\nnum = N.split()\nA = num[0]\nB = num[1]\nR = int(A) * int(B)\nwhile C != 3:\n result = R * C\n if result % 2 == 0:\n C = C + 1\n if C == 3:\n print("no")\n elif result % 2 == 1:\n print("yes")\n C = 3\n', 'n = int(input())\n\nwords = []\nfor i in range(n):\n words.append(input())\n\nret = "Yes"\nif len(set(words)) != n:\n ret = "No"\nelse:\n for i in range(n-1):\n if words[i][-1] != words[i+1][0]:\n ret = "No"\n break\n\nprint(ret)', 'line = input()\na, b = [int(n) for n in line.split()]\nans = "No" if (a*b)%2 == 0 else "Yes"\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s123370939', 's216349643', 's274618660', 's925617015'] | [2940.0, 3060.0, 3060.0, 2940.0] | [17.0, 18.0, 18.0, 18.0] | [135, 255, 252, 101] |
p03260 | u864197622 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['from functools import reduce\n\ndef gcd(a, b):\n\n if b == 0:\n return a\n else:\n return gcd(b, a % b)\n\ndef gcd_list(numbers):\n return reduce(gcd, numbers)\n\nN, X = map(int, input().split(" "))\nXi = [int(a) for a in input().split()]\n\ndef minusX(a):\n return abs(a-X)\n\nXi = map(minusX, Xi)\n\nd = gcd_list(Xi)\nprint (d)', 'Print("Yes")', 'a, b = map(int, input().split(" "))\nif a % 2 == 1 and b % 2 == 1:\n print ("Yes")\nelse:\n print ("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s108966342', 's780067505', 's871911682'] | [3572.0, 2940.0, 2940.0] | [23.0, 17.0, 17.0] | [334, 12, 106] |
p03260 | u871374729 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ncity_num, start_pos = list(map(int, input().split()))\ncity_list = list(map(int, input().split()))\n\n\ncity_list.append(start_pos)\n\ncity_list.sort()\n\n\ndistance_list = [city_list[i+1] - city_list[i] for i in range(city_num)]\n\n\nif len(distance_list) == 1:\n print(distance_list[0])\n exit()\n\n\ndistance_list.sort()\n\n\nmax_gcd = gcd(distance_list[0], distance_list[1])\nfor i in range(2, len(distance_list)):\n max_gcd = gcd(max_gcd, distance_list[i])\n\n\nprint(max_gcd)\n', 'a, b = list(map(int, input().split()))\n\nif a == 2 or b == 2:\n print("No")\nelse:\n print("Yes")\n\n'] | ['Runtime Error', 'Accepted'] | ['s100927544', 's203265088'] | [3064.0, 2940.0] | [17.0, 17.0] | [731, 101] |
p03260 | u875608890 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A, B = map(int, input().split())\nflg = True\nfor i in range(1, 4):\n if (A * B * i) % 2 == 1:\n flg = False\n break\nif flg == False:\n print('Yes')\nelif == True:\n print('No')", "A, B = map(int, input().split())\nflg = True\nfor i in range(1, 4):\n if A * B * i % 2 == 1:\n flg = True\n break\nif flg == False:\n print('Yes')\nelif flg == True:\n print('No')", "A, B = map(int, input().split())\nflg = True\nfor i in range(1, 4):\n if A * B * i % 2 == 1:\n flg = False\n \nif flg == False:\n print('Yes')\nelif flg == True:\n print('No')"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s501542792', 's831723136', 's643261735'] | [8920.0, 9032.0, 9112.0] | [26.0, 28.0, 30.0] | [192, 193, 189] |
p03260 | u886902015 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a,b=map(int,input().split())\nif a%2==0 and b%2==0:\n print("Yes")\nelse:\n print("No")\n', 'a,b=map(int,input().split())\nif a%2== and b%2==0:\n print("Yes")\nelse:\n print("No")', 'a,b=map(int,input().split())\nif a%2!=0 and b%2!=0:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s420748055', 's800670592', 's135051303'] | [9044.0, 8900.0, 9136.0] | [25.0, 23.0, 27.0] | [90, 88, 90] |
p03260 | u888512581 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A, B = map(int, input().split())\nif A % 2 == 0 and B % 2 == 0:\n print('Yes')\nelse:\n print('No')", "A, B = map(int, input().split())\nif A % 2 == 0 or B % 2 == 0:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s782460047', 's527058715'] | [2940.0, 2940.0] | [17.0, 17.0] | [101, 100] |
p03260 | u894694822 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a, b=map(int, input())\nif a%2==1 and b%2==1:\n print("Yes")\nelse:\n print("No")', 'a, b=map(int, input().split())\nif a%2==1 and b%2==1:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s621350290', 's582594718'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 88] |
p03260 | u895536055 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['A, B = map(int, input().split())\n\nif A == 2 || B == 2:\n print("No")\nelse:\n print("Yes")', 'A, B = map(int, input().split())\n\nif A == 2 or B == 2:\n print("No")\nelse:\n print("Yes")\n'] | ['Runtime Error', 'Accepted'] | ['s323018651', 's425578166'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 90] |
p03260 | u897436032 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['N = int(input())\nw = [input() for i in range(N)]\n\nvalid = False\n\nfor i in range(1, N-1):\n if w[i-1][-1] == w[i][0] and len(set(w)) == len(w):\n valid = True\n else:\n valid = False\n\n print("Yes" if valid else "No")', 'A, B = map(int, input().split())\n\njudge = False\nfor c in range(1,4):\n if A*B*C %2 == 1:\n judge = True\n \n\n \nif judge == True:\n print("Yes")\nelse:\n print("False")\n \n ', 'A, B = map(int, input().split())\n \njudge = False\nfor c in range(1,4):\n if (A*B*C) %2 == 1:\n judge = True\n \n \n \nif judge == True:\n print("Yes")\nelse:\n print("No")\n ', 'A, B = map(int, input().split())\n \njudge = False\nfor C in range(1,4):\n if (A*B*C) %2 == 1:\n judge = True\n \n \n \nif judge == True:\n print("Yes")\nelse:\n print("No")\n '] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s161433148', 's722140527', 's730100436', 's321005948'] | [3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [235, 181, 177, 177] |
p03260 | u898058223 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a,b=map(int,input().split())\nif a%2==0 or b%2==0:\n print("No")\nelse:\n priint("Yes")', 'a,b=map(int,input().split())\nif a%2==0 or b%2==0:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s928953760', 's362203254'] | [2940.0, 2940.0] | [17.0, 17.0] | [85, 84] |
p03260 | u901598613 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a,b=map(int,input().split())\nif a*b%2:\n print("No")\nelse:\n print("Yes")', 'a,b=map(int,input().split())\nif a*b%2==0:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s541946257', 's666373925'] | [2940.0, 2940.0] | [17.0, 17.0] | [77, 80] |
p03260 | u903948194 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["if (a*b) % 2 == 0:\n print('No')\nelse:\n print('Yes') ", "if a*b % 2 == 0:\n print('No')\nelse:\n print('Yes') ", "a, b = map(int, input().split())\nif (a*b) % 2 == 0:\n print('No')\nelse:\n print('Yes') "] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s077473460', 's965094493', 's771015407'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [58, 56, 91] |
p03260 | u906129425 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a, b = map(int, input().split())\nprint('YES' if any(a * b * c % 2 == 1 for c in range(1, 4)) else 'NO')\n", "a, b = map(int, input().split())\nprint('Yes' if any(a * b * c % 2 == 1 for c in range(1, 4)) else 'No')\n"] | ['Wrong Answer', 'Accepted'] | ['s030120745', 's098967765'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 104] |
p03260 | u909162870 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['list1 = list(map(int,input().split()))\nh = list1[0]\nw = list1[1]\na = list()\ni = 0\nn = 0\nans = list()\nwhile i <= h-1:\n a.append(list(map(int,input().split())))\n i += 1\nfor i in range(h):\n for j in range(w-1):\n if a[i][j] % 2 != 0:\n a[i][j] -= 1\n a[i][j+1] += 1\n n+=1\n ans.append([i+1,j+1,i+1,j+2])\nfor i in range(h-1):\n if a[i][w-1] % 2 != 0:\n a[i][w-1] -= 1\n a[i+1][w-1] += 1\n ans.append([i+1, w, i+2, w])\n n+=1\nprint(n)\nfor i in range(n):\n print(ans[i][0],ans[i][1],ans[i][2],ans[i][3])\n', "list1 = list(map(int,input().split()))\na = list1[0]\nb = list1[1]\nif a % 2 != 0:\n if b % 2 != 0:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s970629501', 's958245102'] | [3064.0, 3060.0] | [18.0, 17.0] | [582, 171] |
p03260 | u914797917 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['A,B,C=map(int,input().split())\n\nprint(max(A,B,C)*9+A+B+C) \n \n ', "A,B= map(int,input().split())\n\nif (A*B)%2!=0:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s413415635', 's403919492'] | [2940.0, 2940.0] | [17.0, 17.0] | [65, 80] |
p03260 | u917558625 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A,B=map(int,input().split())\nif A%2==0 and B%2==0:print('Yes')\nelse:print('No')", "A,B=map(int,input().split())\nif A%2==0 or B%2==0:print('Yes')\nelse:print('No')\n", "A,B=map(int,input().split())\nif A%2==0 or B%2==0:print('No')\nelse:print('Yes')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s163198297', 's892018195', 's309693640'] | [9100.0, 8988.0, 9032.0] | [26.0, 26.0, 28.0] | [79, 79, 78] |
p03260 | u918009437 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a,b = map(int,input().split())\n\nif (a＊b)%2==1:\n print('Yes')\nelse:\n print('No')", "a,b = map(int,input().split())\n\nif (a*b)%2==1:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s819232627', 's150045639'] | [2940.0, 2940.0] | [18.0, 19.0] | [83, 82] |
p03260 | u918859246 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A, B = map(int, input().split())\nC = range(1, 4)\nfor c in C:\n if (A * B * c)%2 != 0:\n print('Yes')\n else:\n print('No')", "A, B = map(int, input().split())\nC = range(1, 4)\ncount = 0\nfor c in C:\n if (A * B * c)%2 != 0:\n count += 1\nif count >= 1:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s740274691', 's686087661'] | [2940.0, 2940.0] | [17.0, 17.0] | [138, 170] |
p03260 | u919127329 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a,b=map(int,input().split())\nif(a * b % 2 == 0):\n print("Yes")\nelse:\n print("No")', 'a,b=map(int,input().split())\nif(a * b % 2 == 0):\n print("Yes")\nelse:\n print("No")', 'a,b=map(int,input().split())\nif(a * b % 2 == 0):\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s513842099', 's705771706', 's135591602'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [87, 87, 87] |
p03260 | u919730120 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a,b=map(int,input().split())\nif ab%2==0:\n print('NO')\nelse:\n print('Yes')", "a,b=map(int,input().split())\nif a*b%2==0:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s700410403', 's153418684'] | [3064.0, 2940.0] | [18.0, 17.0] | [75, 76] |
p03260 | u921615009 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['args = input().split(" ")\nif args[0]*args[1]%2 == 0:\n print("No")\nelse:\n print("Yes")', 'count, init = tuple(map(int, input().split(" ")))\nXs = [init] + list(map(int, input().split(" ")))\nl = [abs(Xs[i]-Xs[i+1]) for i in range(count)]\nfor i in range(2, min(l)+1)[::-1]:\n if max(map(lambda x: x%i, l)) == 0:\n print(i)\n exit(0)\nprint(1)', 'A, B = map(int, input().split(" "))\nif A*B%2 == 0:\n print("No")\nelse:\n print("Yes")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s047867869', 's864956708', 's155426195'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [87, 262, 90] |
p03260 | u921773161 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['l = list(map(int,input().split().split()))\nl.sort()\nprint(l[0]*10 +l[1]+l[2])', "a,b = map(int,input())\nif a*b %2 != 0:\n print('Yes')\nelse :\n print('No')", "a,b = map(int,input().split())\nif a*b %2 != 0:\n print('Yes')\nelse :\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s293215561', 's811411068', 's324261212'] | [2940.0, 2940.0, 2940.0] | [20.0, 18.0, 18.0] | [77, 74, 82] |
p03260 | u923712635 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A,B = [int(x) for x in input().split()]\nif(A%2==0 or B%2===0):\n print('No')\nelse:\n print('Yes')", "A,B = [int(x) for x in input().split()]\nif(A%2==0 or B%2==0):\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s852080419', 's262332697'] | [2940.0, 2940.0] | [17.0, 17.0] | [97, 96] |
p03260 | u924671994 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a,b = map(int, input().split())\n\nif (a*b)%2==0:\n print("Yes")\nelse:\n print("No")', 'a,b = map(int,input().split())\n\nif (a*b)%2==0:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s010095212', 's438660115'] | [2940.0, 3316.0] | [18.0, 22.0] | [82, 81] |
p03260 | u926674523 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["s = raw_input()\na, b = s.split()\n\nc = int(a) * int(b)\nprint 'YES' if c % 2 == 1 else 'NO'", 'n = int(input())\n\nwords = []\nfor i in range(n):\n words.append(input())\n\nret = "Yes"\nif len(set(words)) != n:\n ret = "No"\nelse:\n for i in range(n-1):\n if words[i][-1] != words[i+1][0]:\n ret = "No"\n break\n\nprint(ret)\n##17024960 | nowg\'s solution for [AtCoder-4250] [Problem A]', 'nums = input()\n\nif \'2\' in nums:\n print("No")\nelse:\n print("Yes")\n#17025159 | nowg\'s solution for [AtCoder-4250] [Problem A]'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s213527791', 's290491788', 's781244894'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [89, 312, 129] |
p03260 | u928784113 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nA,B = map(int, input().split())\nif (A == 2) or (B == 2):\n print("Yes")\nelse:\n print("No")', '#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nA,B = map(int, input().split())\nif (A = 2) or (B = 2):\n print("Yes")\nelse:\n print("No")', '#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nif (A = 2) or (B = 2):\n print("Yes")\nelse:\n print("No")\n', '#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nA,B = map(int, input().split())\nif (A == 2) or (B == 2):\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s451623503', 's535424063', 's886587627', 's335727062'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0] | [137, 135, 104, 137] |
p03260 | u930862022 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a, b = map(int, input().split())\n\nif (a * b) % 2 == 0:\n print('Yes')\nelse:\n print('No')", "a, b = map(int, input().split())\n\nif (a * b) % 2 == 0:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s624621226', 's457312361'] | [2940.0, 2940.0] | [17.0, 17.0] | [93, 93] |
p03260 | u931071094 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a,b=map(int,input().split())\nif (a*b)%2==0 : print('Yes')\nelse : print('No')", "a,b=map(int,input().split())\nif (a*b)%2==0 : print('No')\nelse : print('Yes')\n"] | ['Wrong Answer', 'Accepted'] | ['s716248357', 's599263009'] | [2940.0, 2940.0] | [19.0, 17.0] | [76, 77] |
p03260 | u937238023 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a,b = map(int, input())\nif\t(a*b)%2==1:\n print("Yes")\nelse:\n print("No")', 'a,b = map(int, input().split())\nif\t(a*b)%2==1:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s273914731', 's599738653'] | [9040.0, 9152.0] | [23.0, 29.0] | [73, 81] |
p03260 | u940279019 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['A,B = map(int,input().split())\nif((A*B) % 2 == 0):\n print("NO")\nelse:\n print("YES")', 'A,B = map(int,input().split())\nif(A*B % 2 == 0):\n print("NO")\nelse:\n print("YES")', 'A,B = map(int,input().split())\nif((A*B) % 2 == 0):\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s178216459', 's255603892', 's160468290'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [85, 83, 85] |
p03260 | u942697937 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['A, B = map(int, input().split())\nfor C in [1, 2, 3]:\n if (A * B * C) % 2 == 1:\n print("YES")\n exit(0)\nprint("NO")\n', 'A, B = map(int, input().split())\nfor C in [1, 2, 3]:\n if (A * B * C) % 2 == 1:\n print("Yes")\n exit(0)\nprint("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s143075529', 's841406936'] | [2940.0, 2940.0] | [17.0, 17.0] | [131, 131] |
p03260 | u950708010 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a,b = (int(i) for i in input().split())\nif a*b&2 == 1:print('Yes')\nelse: print('No')", "a,b = (int(i) for i in input().split())\nif (a*b)%2 == 1:print('Yes')\nelse: print('No')"] | ['Wrong Answer', 'Accepted'] | ['s907617568', 's566686177'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 86] |
p03260 | u951480280 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['print("Yes" if "2" in input() else "No")', 'print("Yes" if "2" not in input() else "No")\n'] | ['Wrong Answer', 'Accepted'] | ['s727290227', 's290053235'] | [2940.0, 2940.0] | [17.0, 17.0] | [40, 45] |
p03260 | u951601135 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["N=int(input())\ns=[input() for i in range(N)]\ncount=0\nif(len(s)!=len(set(s))):\n count=1\nelse:\n for i in range(N-1):\n len_s=len(s[i])\n if(s[i][len_s-1]!=s[i+1][0]):\n count=1\n break\n else:continue\nif(count==0):\n\tprint('Yes')\nelse:print('No')", "a,b=map(int,input().split())\nprint('YES' if (a*b%2==1) else 'NO')", "a,b=map(int,input().split())\nprint('No' if (a*b%2==0) else 'Yes')"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s263163599', 's900775581', 's037260540'] | [3064.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0] | [259, 65, 65] |
p03260 | u952588409 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['A,B = map(int, input().split())\nprint(A,B)\nif A==2 or B==2: print("No")\nelse: print("Yes")', 'A,B = input(),input()\nif A==2 or B==2: print("Yes")\nelse: print("No")', 'A,B = map(int, input().split())\nif A==2 or B==2: print("No")\nelse: print("Yes")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s448707980', 's581288657', 's878787304'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [90, 69, 79] |
p03260 | u954488273 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a=map(int,input().split())\nif a[0]!=2 and a[1]!=2:\n print("Yes")\nelse:\n print("No)', 'a=list(map(int,input().split()))\nif a[0]!=2 and a[1]!=2:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s428067487', 's952665908'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 91] |
p03260 | u957872856 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['print("NO" if eval(input().replace(" ","+"))%2==0 else "YES")', 'print("NO" if eval(input().replace(" ","*"))%2==0 else "YES")', 'print("No" if eval(input().replace(" ","*"))%2==0 else "Yes")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s004812008', 's711989624', 's326781657'] | [2940.0, 2940.0, 2940.0] | [20.0, 17.0, 17.0] | [61, 61, 61] |
p03260 | u958506960 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a, b = int(input())\nfor c in range(1, 4):\n if (a * b * c) % 2 == 1:\n print('Yes')\n exit()\nprint('No')", "a, b = map(int, input().split())\nprint('Yes' if a%2 and b%2 else 'No')"] | ['Runtime Error', 'Accepted'] | ['s656394875', 's483959233'] | [9092.0, 9012.0] | [23.0, 28.0] | [118, 70] |
p03260 | u959651981 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a,b = map(int(),input().split)\n\nif(a*b%2==0){\n print('NO')\n}else{\n print('YES')\n}", "a,b=map(int, input().split())\n\nif a*b%2==0:\n print('No')\nelse:\n print('Yes')\n"] | ['Runtime Error', 'Accepted'] | ['s364394739', 's410499645'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 79] |
p03260 | u960171798 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['import fractions\n\nN,X = map(int, input().split())\nx = list(map(int, input().split()))\nx.append(X)\nx.sort()\n\nif N != 1:\n A = [0]*(N-1)\n for i in range(N-1):\n A[i] = x[i+1]-x[i]\n\n a = A[0]\n for i in range(N-1):\n a = fractions.gcd(a,A[i])\n print(a)\nelse:\n print(x[1]-x[0])\n', 'a,b = map(int, input().split())\nprint ("Yes" if a*b%2==1 else “No”)', 'a,b = map(int, input().split())\nprint ("Yes" if a*b%2==1 else "No")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s289251219', 's808233923', 's240137625'] | [5436.0, 3188.0, 2940.0] | [39.0, 18.0, 17.0] | [302, 71, 68] |
p03260 | u969657979 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a, b = (int(i) for i in input().split()) \nif a%2 and b%2:\n \tprint("Yes")\n else:\n print("No")', 'a, b = (int(i) for i in input().split())\nif a % 2 and b % 2:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s844550190', 's868121059'] | [2940.0, 2940.0] | [17.0, 17.0] | [98, 100] |
p03260 | u970107703 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A, B = map(int, input().split())\nflag = False\nfor C in range(1, 4):\n if(A*B*C%2 == 1):\n flag = True\nif(flag):\n print('YES')\nelse:\n print('NO')", "A, B = map(int, input().split())\nflag = False\nfor C in range(1, 4):\n if(A*B*C%2 == 1):\n flag = True\nif(flag):\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s616620644', 's824849532'] | [2940.0, 2940.0] | [17.0, 17.0] | [158, 158] |
p03260 | u970899068 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A=int() , B=int()\nx=A*B\nif x%2==0:\n print('Yes')\nelse:\n print('No')", "A,B=int(input()) \nx=A*B\nif x%2==0:\n print('No')\nelse:\n print('Yes')", "input(A,B)\nx=A*B\nif x%2==0:\n return 'Yes'\nelse:\n returun 'No'", "i=list(map(int,input().split())) \nA=i[0]\nB=i[1]\nif A*B%2==0:\n print('Yes')\nelse:\n print('No')", "if A%2==0 or B%2==0:\n return 'Yes'\nelse:\n return 'No'", "A,B=int(input()) \nx=A*B\nif x%2==0:\n print('Yes')\nelse:\n print('No')", "int A, int B\nx=A*B\nif x%2==0:\n print('Yes')\nelse:\n print('No')", "i=list(map(int,input().split())) \n\nif i[0]*i[1]%2==0:\n print('Yes')\nelse:\n print('No')", "int A, int B\nx=A*B\nif x%2==0:\n return 'Yes'\nelse:\n returun 'No'", "A,B=list(map(int,input().split()))\nx=A*B\nif x%2==0:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s077311398', 's225908535', 's319781771', 's475961894', 's560886561', 's587480988', 's651955170', 's711475043', 's984520614', 's296658597'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [69, 69, 63, 95, 55, 69, 64, 88, 65, 86] |
p03260 | u972892985 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['a, b = map(int,input().split())\nif (a * b * 3) % 2 == 0:\n print("No")\n \nelif (a * b * 2) % 2 == 0:\n print("No")\n\nelif (a * b * 1) % 2 == 0:\n print("No")\n\nelse:\n print("Yes")\n', 'a, b = map(int,input().split())\nc for i in range(3)\n\nif (a+b)+ i == 0:\n print("No")\nelse:\n print("Yes")', 'a, b = map(int,input().split())\nif (a == 1 and b == 2) or (a == 2 and b == 1) or (a == 2 and b == 2) or (a == 3 and b == 2) or (a == 2 and b == 3):\n print("No")\nelse:\n print("Yes")\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s155785543', 's228356422', 's153145936'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [179, 105, 183] |
p03260 | u973840923 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A = int(input())\nB = int(input())\n\nfor i in range(1,4):\n if A * B * i % 2 == 1:\n print('Yes')\n break\n\nprint('No')", "from itertools import product\n \nH, W = map(int, input().split())\n \na = [ list(map(int, input().split())) for _ in range(H) ]\n \noutput = ''\ndirection = -1\nidou = 0\nlast_i = 0\nlast_j = 0\ncount = 0\nj = -1\nfor i in range(H):\n direction *= -1\n j += direction\n for _ in range(W):\n if idou == 1:\n count += 1\n output += '{} {} {} {}\\n'.format(last_i+1, last_j+1, i+1, j+1)\n if (a[i][j] + idou) % 2 == 1:\n idou = 1\n else:\n idou = 0\n last_i = i\n last_j = j\n j += direction\n \noutput = str(count) + '\\n' + output.strip()\nprint(output)", "A, B = map(int, input().split())\n\nif A * B % 2 == 1:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s332087643', 's572591349', 's387144093'] | [2940.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [130, 617, 88] |
p03260 | u980492406 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a,b = map(int,input().split())\nfor i in range(1,4) :\n if (a*b*c)%2 == 1 :\n print('Yes')\n else :\n print('No')", "a,b = map(int,input().split())\nfor i in range(1,4) :\n if (a*b*i)%2 == 1 :\n print('Yes')\n else :\n print('No')", "a,b = map(int,input().split())\nif (a*b)%2 == 1 :\n print('Yes')\nelse :\n print('No')"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s130866002', 's938996375', 's421629061'] | [2940.0, 2940.0, 2940.0] | [19.0, 17.0, 17.0] | [128, 128, 88] |
p03260 | u982473248 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['import math\nfrom functools import reduce\n\nc, d = (int(i) for i in input().split()) \na = [int(i) for i in input().split()]\nb = a.copy()\n\nk = 0\nfor i in a:\n b[k] = abs(i - d)\n k += 1\n\nm = min(b) \n\nlo = []\n\ndef gcd_list(numbers):\n return reduce(math.gcd, numbers)\n\n\n \nprint(gcd_list(b))', 'a, b = (int(i) for i in input().split())\n\nif a%2 ==0 or b%2 ==0: \n print("NO") \nelse: \n print("YES")', 'a, b = (int(i) for i in input().split())\n\nif a%2 ==0 or b%2 ==0: \n print("No") \nelse: \n print("Yes")'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s175863095', 's232122625', 's642495386'] | [3572.0, 2940.0, 3316.0] | [22.0, 17.0, 19.0] | [308, 106, 106] |
p03260 | u989157442 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["a, b = map(int, input().slice())\nif a == 2 or b == 2:\n print('No')\nelse:\n print('Yes')\n", "a, b = map(int, input().split())\nif a == 2 or b == 2:\n print('No')\nelse:\n print('Yes')\n"] | ['Runtime Error', 'Accepted'] | ['s301271695', 's680277989'] | [2940.0, 2940.0] | [17.0, 17.0] | [93, 93] |
p03260 | u989385104 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ['N = int(input())\n \nW = [[list(input())]]\n \ndef shiritori(N):\n for i in range(N):\n if any(W[i]):\n return "No"\n else:\n \tif W[i-1][-1] == W[i][0]:\n return "Yes"\n \telse:\n return "No"\n \n\n \nprint(shiritori(N))', 'A,B = map(int, input().split())\n\nif A*B % 2 == 0:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s198189362', 's564318203'] | [3060.0, 2940.0] | [17.0, 17.0] | [249, 84] |
p03260 | u992910889 | 2,000 | 1,048,576 | You are given integers A and B, each between 1 and 3 (inclusive). Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number. | ["A,B=map(int,input().split())\nwhile True:\n for i in range(1,4):\n if A*B*C%2==1:\n print('Yes')\n print('No')", "# coding: utf-8\n# Your code here!\nA,B=map(int,input().split())\nwhile True:\n for i in range(1,4):\n if A*B*i%2==1:\n print('Yes')\n break\n print('No')\n break", "# coding: utf-8\n# Your code here!\nA,B=map(int,input().split())\nif A%2==1 and B%2==1:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s237216837', 's423142002', 's229575576'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [129, 191, 123] |
p03261 | u001036276 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['import sys\n\nn = int(input())\nl = []\np = None\n\nfor i in range(n):\n s = input()\n if s in l && (p == None || p[-1:] == s[1:]):\n l.append(s)\n p = s\n else:\n print("No")\n sys.exit()\nprint("Yes")', 'import sys\n \nn = int(input())\nl = []\np = None\n \nfor i in range(n):\n s = input()\n if s not in l and (p == None or p[-1:] == s[:1]):\n l.append(s)\n p = s\n else:\n print("No")\n sys.exit()\nprint("Yes")'] | ['Runtime Error', 'Accepted'] | ['s419499439', 's000354836'] | [2940.0, 3060.0] | [17.0, 17.0] | [203, 210] |
p03261 | u007886915 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['# -*- coding: utf-8 -*-\nimport sys\nimport itertools\n\n#w=input()\nfrom operator import itemgetter\nfrom sys import stdin\n\n\nN=3\nM=3\ni=0\nj=0\nk=0\n\n\n\nN=int(input())\narray=[input().split()for i in range(N)]\n\n\n# c.append(array[i][0])\n\nc=list(itertools.chain.from_iterable(array))\n\n\nfor i in range(N-1):\n #s=input()\n a=[i for i in array[i][0]]\n b=[j for j in array[i+1][0]]\n "str型の2次元文字列分割入力もパターンに入れとくか"\n #print(a[-1],b[0])\n if a[-1]!=b[0]:\n print("No")\n sys.exit()\n\n#print(c)\nfor i in range(N-1):\n #for j in reversed(range(N-i-2)):\n for j in (range(N-i-2)):\n print(c[i],c[i+j+1])\n if c[i]==c[i+j+1]:\n print("No")\n sys.exit()\nprint("Yes")\n\n#print(a[0])\n#print([a])\n\n\n\n#print(array[1][0])\n"[行][列]の順番であることに注意"\n#print(array)\n"正方行列にstr型の値を入力"\n\n#A=int(input())\n#B=int(input())\n#print(N)\n"1行1つの整数を入力を取得し、整数と取得する"\n\n\n\n#print(number_list)\n"12 21 332 とか入力する時に使う"\n"1行に複数の整数の入力を取得し、整数として扱う"\n\n\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\n\n\n\n\n\n\n\n\n#print(type(brray[0][0]))\n#print(brray)\n\n"列数に関して自由度の高いint型の値を入力するタイプの行列"\n\n\n\'\'\'\ntable = [[int(i) for i in input().split()] for m in range(m)]\n\nprint(type(N))\nprint(N)\nprint(type(M))\nprint(M)\n\nprint(type(table))\nprint(table)\n\'\'\'\n\n\n\n\n#s=input()\n\n#print(a[0])\n#print([a])\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n#a= stdin.readline().rstrip()\n#print(a.upper())\n"aという変数に入っているものを大文字にして出力"\n\n\n\n\n\n#a=[[int(i) for i in 1.strip()]for 1 in sys.stdin]\n#a = [[int(c) for c in l.strip()] for l in sys.stdin]]\n#print(a)\n\n', '# -*- coding: utf-8 -*-\nimport sys\nimport itertools\n\n#w=input()\nfrom operator import itemgetter\nfrom sys import stdin\n\n\nN=3\nM=3\ni=0\nj=0\nk=0\n\n\n\nN=int(input())\narray=[input().split()for i in range(N)]\n\n\n# c.append(array[i][0])\n\nc=list(itertools.chain.from_iterable(array))\n\n\nfor i in range(N-1):\n #s=input()\n a=[i for i in array[i][0]]\n b=[j for j in array[i+1][0]]\n "str型の2次元文字列分割入力もパターンに入れとくか"\n #print(a[-1],b[0])\n if a[-1]!=b[0]:\n print("No")\n sys.exit()\n\n#print(c)\nfor i in range(N-1):\n #for j in reversed(range(N-i-2)):\n for j in (range(N-i-1)):\n #print(c[i],c[i+j+1])\n if c[i]==c[i+j+1]:\n print("No")\n sys.exit()\nprint("Yes")\n\n#print(a[0])\n#print([a])\n\n\n\n#print(array[1][0])\n"[行][列]の順番であることに注意"\n#print(array)\n"正方行列にstr型の値を入力"\n\n#A=int(input())\n#B=int(input())\n#print(N)\n"1行1つの整数を入力を取得し、整数と取得する"\n\n\n\n#print(number_list)\n"12 21 332 とか入力する時に使う"\n"1行に複数の整数の入力を取得し、整数として扱う"\n\n\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\'\n\n\n\n\n\n\n\n\n#print(type(brray[0][0]))\n#print(brray)\n\n"列数に関して自由度の高いint型の値を入力するタイプの行列"\n\n\n\'\'\'\ntable = [[int(i) for i in input().split()] for m in range(m)]\n\nprint(type(N))\nprint(N)\nprint(type(M))\nprint(M)\n\nprint(type(table))\nprint(table)\n\'\'\'\n\n\n\n\n#s=input()\n\n#print(a[0])\n#print([a])\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n#a= stdin.readline().rstrip()\n#print(a.upper())\n"aという変数に入っているものを大文字にして出力"\n\n\n\n\n\n#a=[[int(i) for i in 1.strip()]for 1 in sys.stdin]\n#a = [[int(c) for c in l.strip()] for l in sys.stdin]]\n#print(a)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s181271324', 's005437606'] | [3388.0, 3064.0] | [25.0, 19.0] | [3918, 3919] |
p03261 | u010069411 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['#! /usr/bin/python\nn = int(input())\nw = list(map(int, stdin.read().splitlines()))\nprint("Yes" if n == len(set(w)) else "No")\n', '#! /usr/bin/python\nfrom sys import stdin\nn = int(input())\nw = list(map(int, stdin.read().splitlines()))\nprint("Yes" if n == len(set(w)) else "No")\n', '#! /usr/bin/python\nfrom sys import stdin\nn = int(input())\nW = stdin.read().splitlines()\nif n != len(set(W)):\n print("No")\n exit()\nfor i in range(n-1):\n if W[i][-1] != W[i+1][0]:\n print("No")\n exit()\nprint("Yes")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s002141203', 's621925685', 's472234004'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0] | [125, 147, 235] |
p03261 | u010437136 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['sys.stdin = io.StringIO(lines)\n\nline1 = sys.stdin.readline().rstrip()\nlista = []\nfor i in range(int(line1)):\n line2 = sys.stdin.readline().rstrip()\n lista.append(line2)\n #print(line1,lista)\ndef ans(lista): \n listb = []\n hantei = "true"\n for i in lista:\n if i not in listb:\n listb.append(i)\n else:\n hantei = "false"\n for i in range(len(listb)-1):\n if listb[i][-1] != listb[i+1][0]:\n hantei = "false"\n if hantei == "true":\n return("Yes")\n else:\n return("No")\nans(lista)', 'line1 = sys.stdin.readline().rstrip()\nlista = []\nfor i in range(int(line1)):\n line2 = sys.stdin.readline().rstrip()\n lista.append(line2)\n #print(line1,lista)\ndef ans(lista): \n listb = []\n hantei = "true"\n for i in lista:\n if i not in listb:\n listb.append(i)\n else:\n hantei = "false"\n for i in range(len(listb)-1):\n if listb[i][-1] != listb[i+1][0]:\n hantei = "false"\n if hantei == "true":\n return("Yes")\n else:\n return("No")\nans(lista)', 'def solve(lista): \n listb = []\n hantei = "true"\n for i in lista:\n if i not in listb:\n listb.append(i)\n else:\n hantei = "false"\n for i in range(len(listb)-1):\n if listb[i][-1] != listb[i+1][0]:\n hantei = "false"\n if hantei == "true":\n return("Yes")\n else:\n return("No")\n\ndef readQuestion():\n line1 = sys.stdin.readline().rstrip()\n lista = []\n for i in range(int(line1)):\n line2 = sys.stdin.readline().rstrip()\n lista.append(line2)\n return (lista)\n\ndef main():\n a = readQuestion()\n answer = solve(a)\n print(answer)\n \nif __name__ == \'__main__\':\n main()', 'import io\nimport sys\ndef solve(lista): \n listb = []\n hantei = "true"\n for i in lista:\n if i not in listb:\n listb.append(i)\n else:\n hantei = "false"\n for i in range(len(listb)-1):\n if listb[i][-1] != listb[i+1][0]:\n hantei = "false"\n if hantei == "true":\n return("Yes")\n else:\n return("No")\n\ndef readQuestion():\n line1 = sys.stdin.readline().rstrip()\n lista = []\n for i in range(int(line1)):\n line2 = sys.stdin.readline().rstrip()\n lista.append(line2)\n return (lista)\n\ndef main():\n a = readQuestion()\n answer = solve(a)\n print(answer)\n \nif __name__ == \'__main__\':\n main()'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s104612976', 's236074735', 's948954525', 's093631931'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 17.0] | [565, 533, 771, 792] |
p03261 | u014333473 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["n=[input() for _ in range(int(input()))];if len(set(n))!=len(n): print('No');exit()\nprint('NYoe s'[all([1 if n[i-1][-1]==n[i][0] else 0 for i in range(1,len(n))])::2])", "n=[input() for _ in range(int(input()))]\nif len(set(n))!=len(n): print('No');exit()\nprint('NYoe s'[all([1 if n[i-1][-1]==n[i][0] else 0 for i in range(1,len(n))])::2])"] | ['Runtime Error', 'Accepted'] | ['s733460079', 's772670321'] | [8952.0, 9208.0] | [23.0, 26.0] | [167, 167] |
p03261 | u016901717 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['n=int(input())\nW=[input() for i in range(n)]\ncnt=0\nfor i in range(1,n):\n if W[i-1][-1]==W[i][0]:\n cnt+=1\nif cnt==n-1:\n print("Yes")\nelse:\n print("No")\n', 'n=int(input())\nW=[input() for i in range(n)]\ncnt=0\nfor i in range(1,n):\n if W[i-1][-1]==W[i][0] and W[i] not in W[:i]:\n cnt+=1\nif cnt==n-1:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s340724428', 's712265995'] | [2940.0, 2940.0] | [17.0, 18.0] | [167, 189] |
p03261 | u018679195 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['noOfWords= int(input())\nwords = []\nsatisfactor = True\nfor i in range(noOfWords):\n word = input()\n words.append(word)\n\nif len(set(words)) < len(words):\n print("NO") \n satisfactor = False \nelse:\n for i in range(len(words)-1):\n if words[i][len(words[i])-1] == words[i+1][0]:\n continue\n else:\n satisfactor = False\n print("NO")\n break\nif satisfactor :\n print("YES") \n\n', "n=int(input())\nwords=[]\ngm='YES'\nrep='YES'\nfor i in range(n):\n c=input()\n words.append((len(c),c))\n\nfor i in range(n-1):\n a=words[i][1]\n b=words[i+1][1]\n if b[0]==a[len(a)-1]:\n gm='YES'\n continue\n else:\n gm='NO'\n break\nwords=sorted(words)\nfor i in range(n-1):\n if words[i][0]==words[i+1][0]:\n if words[i][1]==words[i+1][1]:\n rep='NO'\n break\nif rep=='YES'and gm=='YES':\n print(rep)\nelse:\n print('NO')", 'num=int(input())\nlist1=[]\nflag=0\nj=0\n\nfor i in range(num):\n\n a=input()\n\n\n\n if a in list1:\n flag+=1\n list1.append(a)\n if j>0:\n if list1[i-1][len(list1[i-1])-1]==list1[i][0]:\n pass\n\n else:\n flag+=2\n\n j=1\n\nif flag>1:\n print("No")\nelse:\n print("Yes")\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n', 'n = int(input())\nwords = []\nwon = True\nfor i in range(n):\n new_word = input()\n if i > 0 and won:\n if new_word in words or new_word[0] != words[i-1][len(words[i-1])-1]:\n won = False\n words.append(new_word)\n\nif won:\n print("YES")\nelse:\n print("NO")\n', "n=int(input())\nx=[]\nf_l_checker=True\n\nfor i in range(n):\n x.append(input())\n \n if i==0:\n for j in x:\n last_char=j[-1]\n break\n elif f_l_checker==True:\n for j in range(len(x[i])-1):\n first_char=x[i][0]\n if first_char==last_char:\n last_char=x[i][len(x[i])-1]\n f_l_checker=True\n break\n else:\n f_l_checker=False\n break\n else:\n break\n \nset_x=set(x)\nif len(set_x)==len(x) and f_l_checker==True:\n print('YES')\nelse:\n print('NO')", 'N=int(input())\nW=[]\nsame=[]\nfor i in range(N):\n W.append(input())\n\nfor i in range(len(W)):\n for x in range(i+1,len(W)):\n if W[i]==W[x]:\n same.append(W[i])\n \nfor i in range(len(W)-1):\n if len(same)!=0:\n print("NO")\n break\n \n if W[i][-1]==W[i+1][0]:\n print("YES")\n break\n \n else:\n print("NO")\n break\n', "N = int(input())\nword = list(str(input()) for _ in range(N))\nres = 'Yes'\nif len(word) != len(set(word)):\n print('No')\n exit()\nlast = (word[0])[0]\nfor i, x in enumerate(word):\n if last != x[0]:\n print('No')\n exit()\n last = x[-1]\nprint('Yes')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s056225153', 's114500372', 's453412007', 's460857650', 's786358562', 's861907856', 's686611363'] | [3060.0, 3064.0, 3060.0, 3060.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 18.0, 18.0, 18.0, 18.0] | [454, 483, 322, 280, 595, 384, 266] |
p03261 | u021548497 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['import sys\nn = int(input())\nyetlist = []\nfor i in range(n):\n word = input()\n if word in yetlist:\n print("No")\n sys.exit()\n if word[0] != yetlist[-1][-1]:\n print("No")\n sys.exit()\n yetlist.append(word)\nprint("Yes")', 'import sys\nn = int(input())\nyetlist = []\nfor i in range(n):\n word = input()\n if word in yetlist:\n print("No")\n sys.exit()\n if yetlist:\n if word[0] != yetlist[-1][-1]:\n print("No")\n sys.exit()\n yetlist.append(word)\nprint("Yes")'] | ['Runtime Error', 'Accepted'] | ['s848465545', 's459825810'] | [3060.0, 3060.0] | [17.0, 17.0] | [253, 281] |
p03261 | u022113193 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['if __name__ == \'__main__\':\n \n flag = 1\n \n wordNum = int(input())\n wordAll = []\n\n for i in range(wordNum) :\n\n word = input()\n wordAll.append(word)\n wordLen = len(word)\n \n if i > 0 and wordLast != word[0]:\n flag = 0\n break\n \n for j in range(len(wordAll)):\n if wordAll[j] == word:\n flag == 0\n break\n \n wordLast = word[wordLen - 1]\n\n if flag == 1 :\n print("Yes")\n \n else :\n print("No")', 'if __name__ == \'__main__\':\n \n flag = 1\n \n wordNum = int(input())\n wordAll = []\n\n for i in range(wordNum) :\n\n word = input()\n wordAll.append(word)\n wordLen = len(word)\n \n if i > 0 and wordLast != word[0]:\n flag = 0\n break\n \n \n for j in range(len(wordAll)-1):\n if wordAll[j] == word:\n print(j, wordAll[j], word)\n flag = 0\n break\n \n \n wordLast = word[wordLen - 1]\n print(wordAll)\n \n if flag == 1 :\n print("Yes")\n \n else :\n print("No")\n', 'if __name__ == \'__main__\':\n \n flag = 1\n \n wordNum = int(input())\n wordAll = []\n\n for i in range(wordNum) :\n\n word = input()\n wordAll.append(word)\n wordLen = len(word)\n \n if i > 0 and wordLast != word[0]:\n flag = 0\n break\n \n \n for j in range(len(wordAll)-1):\n if wordAll[j] == word:\n flag = 0\n break\n \n \n wordLast = word[wordLen - 1]\n\n \n if flag == 1 :\n print("Yes")\n \n else :\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s352304798', 's889196030', 's042108719'] | [3064.0, 3064.0, 3060.0] | [18.0, 19.0, 18.0] | [454, 524, 471] |
p03261 | u022343475 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['#-*- coding:utf-8 -*-\n\ndef check(words):\n answer = "Yes"\n for i in range(0, len(words)):\n for j in range(i, len(words)):\n if(words[i] == words[j]):\n answer = "No"\n\n return answer\n\n\ndef main(str):\n words = str.split()\n answer = check(words)\n print(answer)\n\n\nif __name__ == "__main__":\n num = int(input()) \n str = [input() for i in range(0, num)] \n main(str)', '#-*- coding:utf-8 -*-\n\ndef check(words):\n answer = "Yes"\n\n \n for i in range(0, len(words)):\n for j in range(i+1, len(words)):\n if(words[i] == words[j]):\n answer = "No"\n\n \n for i in range(0, len(words)-1):\n if(words[i][-1] != words[i+1][0]):\n answer = "No"\n\n return answer\n\n\ndef main(words):\n answer = check(words)\n print(answer)\n\n\nif __name__ == "__main__":\n num = int(input()) \n str = [input() for i in range(0, num)] \n main(str)\n'] | ['Runtime Error', 'Accepted'] | ['s326634520', 's800912743'] | [3064.0, 3064.0] | [19.0, 18.0] | [1213, 1412] |
p03261 | u022488946 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["N = int(input())\nwords = []\nfor _ in range(N):\n words.append(input())\nprint('Yes' if all(w[i].startswith(w[i-1][-1]) for i in range(1, N)) and len(set(words)) == N else 'No')", "N = int(input())\nwords = []\nfor _ in range(N):\n words.append(input())\nprint('Yes' if all(words[i].startswith(words[i-1][-1]) for i in range(1, N)) and len(set(words)) == N else 'No')"] | ['Runtime Error', 'Accepted'] | ['s859882638', 's261362064'] | [9100.0, 9124.0] | [21.0, 27.0] | [177, 185] |
p03261 | u022871813 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["n = int(input())\nlist = []\nfor i in range(n):\n a = input()\n list.append(a)\ndef is_unique(seq):\n return len(seq) == len(set(seq))\n\nif is_unique(a) == False:\n print('No')\n\nelse:\n for k in range(n-1):\n a = list[k]\n b = list[k + 1]\n if a[-1] == b[0]:\n pass\n else:\n print('No')\n break\n print('Yes')\n", "n = int(input())\nlist = []\nfor i in range(n):\n a = input()\n list.append(a)\ndef is_unique(seq):\n return len(seq) == len(set(seq))\n\nif is_unique(list) == False:\n print('No')\n\nelse:\n s = 0\n for k in range(n-1):\n a = list[k]\n b = list[k + 1]\n if a[-1] == b[0]:\n s += 1\n else:\n print('No')\n break\n if (s+1) == n:\n print('Yes')\n else:\n pass\n"] | ['Wrong Answer', 'Accepted'] | ['s665568228', 's467962154'] | [3060.0, 3064.0] | [17.0, 17.0] | [373, 434] |
p03261 | u026155812 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["import sys\nn = int(input())\nw = []\nfor i in range(n):\n word = input()\n if word in w:\n print('No')\n sys.exit()\ncur = w[0][-1]\nfor x in w[1:]:\n if cur != x[0]:\n print('No')\n sys.exit()\n cur = x[-1]\nprint('Yes')", "import sys\nn = int(input())\nw = []\nfor i in range(n):\n word = input()\n if word in w:\n print('No')\n sys.exit()\n w.append(word)\ncur = w[0][-1]\nfor x in w[1:]:\n if cur != x[0]:\n print('No')\n sys.exit()\n cur = x[-1]\nprint('Yes')"] | ['Runtime Error', 'Accepted'] | ['s013348224', 's712481256'] | [3060.0, 3064.0] | [17.0, 17.0] | [224, 241] |
p03261 | u026537738 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['n = int(input())\nw = [""] * n \nresult = "Yes"\n\nfor i in range(n):\n tmp = input()\n if tmp in w:\n result = "No"\n break\n w[i] = tmp \nfor i in range(n-1):\n if w[i][-1] == w[i+1][0]:\n pass\n else:\n result = "No"\nprint(result)', 'n = int(input())\nw = [0] * n \nresult = "Yes"\n\nfor i in range(n):\n w[i] = int(input())\nfor i in range(n-1):\n if w[i][-1] == w[i+1][0]:\n pass\n else:\n result = "No"\nprint(result)', 'n = int(input())\nw = [0] * n \nresult = "Yes"\n\nfor i in range(n):\n tmp = input()\n if tmp in w:\n result = "No"\n break\n w[i] = tmp \nfor i in range(n-1):\n if w[i][-1] == w[i+1][0]:\n pass\n else:\n result = "No"\nprint(result)', 'n = int(input())\nw = [""] * n \nresult = "Yes"\n\nfor i in range(n):\n tmp = input()\n if tmp in w:\n result = "No"\n w[i] = tmp \nfor i in range(n-1):\n if w[i][-1] == w[i+1][0]:\n pass\n else:\n result = "No"\nprint(result)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s083225274', 's691037290', 's788203106', 's113514271'] | [3060.0, 3060.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0, 18.0] | [262, 198, 261, 249] |
p03261 | u033524082 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['import sys\nn=input()\nw=input()\nl=[]\nl.append(w)\nfor i in range(1,n):\n w=input()\n if w[0]!=l[-1][-1] or w in l:\n print("No")\n sys.exit()\n else:\n l.append(w)\nprint("Yes")', 'import sys\nn=int(input())\nw=input()\nl=[]\nl.append(w)\nfor i in range(1,n):\n w=input()\n if w[0]!=l[-1][-1] or w in l:\n print("No")\n sys.exit()\n else:\n l.append(w)\nprint("Yes")'] | ['Runtime Error', 'Accepted'] | ['s645620930', 's637560915'] | [3060.0, 3064.0] | [17.0, 18.0] | [198, 203] |
p03261 | u037221289 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["N = int(input())\n\nW = [input() for i in range(N)]\n\ndef alg1(W):\n list = []\n point = W[0]\n for i in range(1,N):\n if W[i] not in list and W[i][0] == point[-1]:\n list.append(W[i])\n point = W[i]\n pass\n else:\n return 'No'\n return 'Yes'\n\nprint(alg1(W))", "N = int(input())\n\nW = [input() for i in range(N)]\n\ndef alg1(W):\n list = [W[0],]\n point = W[0]\n for i in range(1,N):\n if W[i] not in list and W[i][0] == point[-1]:\n list.append(W[i])\n point = W[i]\n else:\n return 'No'\n return 'Yes'\n\nprint(alg1(W))"] | ['Wrong Answer', 'Accepted'] | ['s674884378', 's827564260'] | [3060.0, 3060.0] | [18.0, 17.0] | [276, 270] |
p03261 | u041382530 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['N=int(input())\nW={}\nA={}\ncount=0\nfor i in range(N):\n\tA=W[i]=str(input())\nfor i in range(N):\n\ta=A.count(W[i])\n\tif a>=2:\n\t\tprint("No")\n\t\tcount=1\nfor i in range(N-1):\n\ts=0\n\tfor j in W[i+1]:\n\t\ts=s+1\n\t\tif s==1:\n\t\t\tt=j\n\t\tfor k in W[i]:\n\t\t\tr=k\n\tif t!=r and count==0:\n\t\tprint("No")\n\t\tcount=1\nif count==0:\n\tprint("Yes")', 'N=int(input())\nW=[]\ncount=0\nfor i in range(N):\n\tw=str(input())\n\tW.append(w)\nfor i in range(N):\n\tc=0\n\tfor j in range(N):\n\t\tif W[i]==W[j]:\n\t\t\tc=c+1\n\t\tif c>=2 and count==0:\n\t\t\tprint("No")\n\t\t\tcount=1\nfor i in range(N-1):\n\ts=0\n\tfor j in W[i+1]:\n\t\ts=s+1\n\t\tif s==1:\n\t\t\tt=j\n\t\tfor k in W[i]:\n\t\t\tr=k\n\tif t!=r and count==0:\n\t\tprint("No")\n\t\tcount=2\nif count==0:\n\tprint("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s376972019', 's229139062'] | [3064.0, 3064.0] | [19.0, 23.0] | [310, 363] |
p03261 | u044635590 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['num_word = int(input())\nword_list = []\nflag = True\n\nfor i in range(num_word):\n word_list.append(input())\n\nfor j in range(num_word - 1):\n word1 = word_list[j]\n word2 = word_list[j + 1]\n if word1[len(word1) - 1] != word2[0]:\n flag = False\n break\n\nif flag:\n print("Yes")\nelse:\n print("No")', 'num_word = int(input())\nword_list = []\nflag = True\n\nfor i in range(num_word):\n word_list.append(input())\n\nfor j in range(num_word - 1):\n word1 = word_list[j]\n word2 = word_list[j + 1]\n for k in range(j):\n if word1 == word_list[k]:\n flag = False\n break\n if word1[len(word1) - 1] != word2[0]:\n flag = False\n break\nfor l in range(num_word - 1):\n if word_list[num_word - 1] == word_list[l]:\n flag = False\n\nif flag:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s533700003', 's172960269'] | [3064.0, 3064.0] | [17.0, 18.0] | [318, 518] |
p03261 | u047023156 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nW = []\nfor _ in range(N):\n W.append(input().strip())\n\ncheck = set()\nflag = True\nbefore = W[0][-1]\nfor i in range(1, N):\n if before != W[i][0] or W[i] in check:\n flag = False\n break\n else:\n before = W[i][-1]\n check.add(W[i])\n\nif flag:\n print('Yes')\nelse:\n print('No')\n\n", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nW = []\nfor _ in range(N):\n W.append(input().strip())\n\ncheck = set(W[0])\nflag = True\nbefore = W[0][-1]\nfor i in range(1, N):\n if before != W[i][0] or W[i] in check:\n flag = False\n break\n else:\n before = W[i][-1]\n check.add(W[i])\n\nif flag:\n print('Yes')\nelse:\n print('No')\n\n", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nW = []\nfor _ in range(N):\n W.append(input().strip())\n\ncheck = set()\nflag = True\nbefore = W[0][-1]\nfor i in range(1, N):\n if before != W[i][0] or W[i] in check:\n flag = False\n else:\n before = W[i][-1]\n check.add(W[i])\n\nif flag:\n print('Yes')\nelse:\n print('No')\n\n", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nW = []\nfor _ in range(N):\n W.append(input().strip())\n\ncheck = set([W[0]])\nflag = True\nbefore = W[0][-1]\nfor i in range(1, N):\n if before != W[i][0] or W[i] in check:\n flag = False\n break\n else:\n before = W[i][-1]\n check.add(W[i])\n\nif flag:\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s082685795', 's215265421', 's690247719', 's389748376'] | [3060.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0, 18.0] | [368, 372, 354, 373] |
p03261 | u050428930 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['n=int(input())\ns=[input() for i in range(n)]\np=list(s[0])[0]\nfrom collections import Counter\nc=Counter(s)\nif sum(c.values())!=n:\n print("No")\n exit()\nelse:\n for i in s:\n a=list(i)[0]\n b=list(i)[-1]\n if p==a:\n p=b\n else:\n print("No")\n exit()\nprint("Yes")\n ', 'n=int(input())\ns=[input() for i in range(n)]\np=list(s[0])[0]\nfrom collections import Counter\nc=Counter(s)\nif [1 for i in range(n)]!=list(c.values()):\n print("No")\n exit()\nelse:\n for i in s:\n a=list(i)[0]\n b=list(i)[-1]\n if p==a:\n p=b\n else:\n print("No")\n exit()\nprint("Yes")\n '] | ['Wrong Answer', 'Accepted'] | ['s793855826', 's952613510'] | [3552.0, 3316.0] | [25.0, 21.0] | [332, 353] |
p03261 | u052347048 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['num = int(input())\nlis = [input() for i in range(num)]\nli = []\nend = lis[0][-1]\nfor n in range(1,num):\n if end == lis[n][0]:li.append(lis[n])\n end = lis[n][-1]\nif len(set(li)) == num-1:print("Yes")\nelse:print("No")', 'num = int(input())\nlis = [input() for i in range(num)]\nli = []\nend = lis[0][-1]\nfor n in range(1,num):\n if end == lis[n][0]:li.append(lis[n])\n end = lis[n][-1]\nif len(set(li)) == num-1:print("Yes")\nelse:print("No")', 'num = int(input())\nlis = [input() for i in range(num)]\nli = [lis[0]]\nend = lis[0][-1]\nfor n in range(1,num):\n if end == lis[n][0]:li.append(lis[n])\n end = lis[n][-1]\nif len(set(li)) == num-1:print("Yes")\nelse:print("No")', 'num = int(input())\nlis = [input() for i in range(num)]\nfor n in range(0,num-1):\n if lis[n][-1] != lis[n+1][0]:print("No");exit()\nif len(set(lis)) == num:print("Yes")\nelse:print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s029237504', 's353148214', 's567921803', 's470959288'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0, 20.0] | [220, 220, 226, 185] |
p03261 | u055914475 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["x = input().split('\\n')\nn = int(x[0])\nw = [x[i] for i in range(1, n+1)]\n\ndef chk_shiri(w):\n for i in range(n - 1):\n if w[i][-1] == w[i + 1][0]:\n continue\n else:\n return False\n return True\n \nif len(w) != len(set(w)):\n print('No')\nelif chk_shiri(w):\n print('Yes')\nelse:\n print('No')\n ", "x = input().split('\\n')\nn = int(x[0])\nw = [x[i] for i in range(1, n+1)]\n\ndef chk_shiri(w):\n for i in range(n - 1):\n if w[i][-1] == w[i + 1][0]:\n continue\n else:\n return False\n return True\n \nif len(w) != len(set(w)):\n print('No')\nelif chk_shiri(w):\n print('Yes')\nelse:\n print('No')\n ", "n = int(input())\nw = []\nfor i in range(n):\n w.append(input())\n\ndef chk_shiri(w):\n for i in range(n - 1):\n if w[i][-1] == w[i + 1][0]:\n continue\n else:\n return False\n return True\n \nif len(w) != len(set(w)):\n print('No')\nelif chk_shiri(w):\n print('Yes')\nelse:\n print('No')\n \n \n "] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s108911309', 's306443715', 's652115524'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [339, 339, 342] |
p03261 | u067983636 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['N = int(input())\nS = [input() for _ in range(N)]\n\nif len(S) != len(set(S)):\n print("No")\n\nnext_s = ""\nfor s in S:\n if next_s == "":\n next_s = s[-1]\n continue\n \n if next_s != s[0]:\n print("No")\n break\n \n next_s = s[-1]\nelse:\n print("Yes")\n\n', 'N = int(input())\nS = [input() for _ in range(N)]\n\nif len(S) != len(set(S)):\n print("No")\n\nnext_s = S[0][0]\nfor s in S:\n if next_s != s[0]:\n print("No")\n break\n \n next_s = s[-1]\nelse:\n print("Yes")\n\n', 'N = int(input())\nS = [input() for _ in range(N)]\n\nif len(S) != len(set(S)):\n print("No")\n \nelse:\n next_s = S[0][0]\n for s in S:\n if next_s != s[0]:\n print("No")\n break\n \n next_s = s[-1]\n else:\n print("Yes")\n \n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s399526264', 's903566875', 's907797134'] | [3316.0, 3060.0, 3060.0] | [21.0, 17.0, 17.0] | [288, 227, 277] |
p03261 | u069602573 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['n = int(input())\nlast = ""\nflg = 0\nli = []\nfor i in range(n):\n s = input()\n str = list(s) \n if last == "":\n last = str[-1]\n continue\n\n if str[0] != last or s in li:\n flg = 1\n\n last = str[-1]\n li.append(s)\n\n\nif flg == 0:\n print("Yes")\nelse:\n print("No")\n', 'n = int(input())\nlast = ""\nflg = 0\nli = []\nfor i in range(n):\n s = input()\n str = list(s) \n if last == "":\n last = str[-1]\n li.append(s)\n continue\n\n if str[0] != last or s in li:\n flg = 1\n\n last = str[-1]\n li.append(s)\n\n\nif flg == 0:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s144412950', 's260393147'] | [3060.0, 3064.0] | [18.0, 20.0] | [322, 343] |
p03261 | u071164145 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["# coding:utf-8\ndef main():\n N = int(input())\n d = {}\n stack = []\n result = 'Yes'\n if N == 0: result = 'No'\n for i,n in enumerate(range(N),start=0):\n stack.append(input().strip())\n if i == 0: continue\n if result == 'No': continue\n if stack[-1] not in d and stack[-2][-1]==stack[-1][0]:\n d[stack[-1]] = True\n else:\n result = 'No'\n print(result)\n\nif __name__ == '__main__':\n main()", "# coding:utf-8\ndef main():\n N = int(input())\n d = {}\n stack = []\n result = 'Yes'\n for i,n in enumerate(range(N),start=0):\n stack.append(input().strip())\n if i == 0: continue\n if result == 'No': continue\n if stack[-1] not in d and stack[-2][-1]==stack[-1][0]:\n d[stack[-1]] = True\n else:\n result = 'No'\n print(result)\n\nif __name__ == '__main__':\n main()", "# coding:utf-8\nN = int(input())\nd = {}\nstack = []\nresult = 'Yes'\nfor i,n in enumerate(range(N),start=0):\n stack.append(input())\n if i == 0: continue\n if result == 'No': continue\n if stack[-1] not in d and stack[-2][-1]==stack[-1][0]:\n d[stack[-1]] = True\n else:\n result = 'No'\nprint(result)", "# coding:utf-8\nN = int(input())\nd = {}\nstack = []\nresult = 'Yes'\nfor i,n in enumerate(range(N),start=0):\n stack.append(input().strip())\n if i == 0: continue\n if result == 'No': continue\n if stack[-1] not in d and stack[-2][-1]==stack[-1][0]:\n d[stack[-1]] = True\n else:\n result = 'No'\nprint(result)", 'n=int(input())\ns=[input()for _ in[0]*n]\nf=0\nfor i in range(1,n):\n f+=s[i-1][-1]!=s[i][0]\nprint("No"if f or len(set(s))<n else"Yes")\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s317582487', 's493118216', 's519843202', 's999143939', 's564297091'] | [3064.0, 3064.0, 3060.0, 3064.0, 2940.0] | [18.0, 17.0, 17.0, 18.0, 17.0] | [459, 430, 319, 327, 135] |
p03261 | u076894102 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["\nn=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n):\n x = input()\n if x in w or w[i-1][len(w[i-1])-1]!=x[0]:\n check=False\n w.append(x)\nif check:\n print('YES')\nelse:\n print('NO')\n\n", 'import sys\nn=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n-1,1):\n x = input()\n if x in w or x[0]!=w[i-1][len(w[i-1])-1]:\n check=False\n w.append("0")\n else:\n w.append(x)\nif check:\n print(\'YES\')\nelse:\n print(\'NO\')\n\n', 'a=int(input())\nx=[].append(input())\nflag=0\nfor i in range(1,a):\n s=input()\n if s in x or x[i-1][len(x[i-1])-1]!=s[0] :\n x.append("1")\n flag=1\n else:\n x.append(s)\nif flag == 0:\n print("Yes")\nelse:\n print("No")', 'import sys\nn=int(input())\nw=[].append(input())\n\ncheck=True\nfor i in range (1,n-1,1):\n x = input()\n print(w)\n if x in w or x[0]!=w[i-1][len(w[i-1])-1]:\n check=False\n w.append("0")\n else:\n w.append(x)\nif check:\n print(\'YES\')\nelse:\n print(\'NO\')\n\n', "import sys\nn=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n-1,1):\n x = input()\n if x in w or x[0]!=w[i-1][len(w[i-1])-1]:\n check=False\n w.append(x)\nif check:\n print('YES')\nelse:\n print('NO')\n\n", "import sys\nn=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n):\n x = input()\n if x in w or w[i-1][len(x[i-1])-1]!=x[0]:\n check=False\n w.append(x)\nif check:\n print('YES')\nelse:\n print('NO')\n\n", "import sys\nn=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n):\n x = input()\n if x in w or x[0]!=w[i-1][len(w[i-1])-1]:\n check=False\n w.append(x)\nif check:\n print('YES')\nelse:\n print('NO')\n\n", "import sys\nn=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n):\n x = input()\n if x in w or x[0]!=w[i-1][len(w[i-1])-1]:\n check=False\n w.append(x)\nif check:\n print('YES')\nelse:\n print('NO')\n\n", 'import sys\nn=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n,1):\n x = input()\n print(w)\n if x in w or x[0]!=w[i-1][len(w[i-1])-1]:\n check=False\n w.append("0")\n else:\n w.append(x)\nif check:\n print(\'YES\')\nelse:\n print(\'NO\')\n\n', "\nn=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n):\n x = input()\n if x in w or w[i-1][len(x[i-1])-1]!=x[0]:\n check=False\n w.append(x)\nif check:\n print('YES')\nelse:\n print('NO')\n\n", 'import sys\nn=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n,1):\n x = input()\n print(w)\n if x in w or x[0]!=w[i-1][len(w[i-1])-1]:\n check=False\n w.append("0")\n else:\n w.append(x)\nif check:\n print(\'YES\')\nelse:\n print(\'NO\')\n\n', "n=int(input())\nw=[input()]\ncheck=True\nfor i in range (1,n):\n x = input()\n if x in w or w[i-1][len(w[i-1])-1]!=x[0]:\n check=False\n w.append(x)\nif check:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s009438637', 's172882895', 's520257049', 's581730126', 's630768430', 's660885668', 's663460858', 's783971699', 's790968995', 's811795817', 's880063539', 's889166415'] | [2940.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 18.0, 17.0, 18.0, 17.0] | [209, 259, 244, 282, 223, 219, 219, 219, 270, 209, 270, 206] |
p03261 | u084968244 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["import sys\nif __name__ == '__main__':\n N = int(input())\n W = [str(input()) for _ in range(N)]\n for i in range(1,N):\n if W[i-1][-1] != W[i][0]:\n print('No')\n sys.exit(0)\n print('Yes')", "import sys\nif __name__ == '__main__':\n N = int(input())\n W = [int(input()) for _ in N]\n for i in range(1,N):\n if W[i-1][-1] != W[i][0]:\n print('No')\n sys.exit()\n print('Yes')", "import sys\nif __name__ == '__main__':\n N = int(input())\n W = [int(input()) for _ in range(N)]\n for i in range(1,N):\n if W[i-1][-1] != W[i][0]:\n print('No')\n sys.exit()\n print('Yes')", "import sys\nif __name__ == '__main__':\n N = int(input())\n W = [str(input()) for _ in range(N)]\n if len(W) != len(set(W)):\n print('No')\n sys.exit(0)\n for i in range(1,N):\n if W[i-1][-1] != W[i][0]:\n print('No')\n sys.exit(0)\n print('Yes')"] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s167191868', 's599630814', 's783726493', 's496297232'] | [3060.0, 2940.0, 3056.0, 3060.0] | [17.0, 17.0, 17.0, 18.0] | [223, 215, 222, 293] |
p03261 | u089032001 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ['N = int(input())\n\ntmpW = input()\npast = set()\nflag = True\nfor i in range(N-1):\n W = input()\n if(tmpW[-1:] != W[0:1]):\n flag = False\n elif(W in past):\n flag = False\n tmpW = W\n \n past.add(W)\n\nif(flag is True):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\n\ntmpW = input()\npast = set()\npast.add(tmpW)\nflag = True\nfor i in range(N - 1):\n W = input()\n if(tmpW[-1:] != W[0:1]):\n flag = False\n elif(W in past):\n flag = False\n tmpW = W\n\n past.add(W)\n # print(past)\n\nif(flag is True):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s260327330', 's475930856'] | [3188.0, 3064.0] | [17.0, 17.0] | [254, 309] |
p03261 | u089230684 | 2,000 | 1,048,576 | Takahashi is practicing _shiritori_ alone again today. Shiritori is a game as follows: * In the first turn, a player announces any one word. * In the subsequent turns, a player announces a word that satisfies the following conditions: * That word is not announced before. * The first character of that word is the same as the last character of the last word announced. In this game, he is practicing to announce as many words as possible in ten seconds. You are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions. | ["n=int(input())\nY=input()\ny=list(Y)\np=len(y)-1\nlast=y[p]\nm=[]\nv=1\nfor i in range(n-1):\n x=input()\n if x in m:\n v=0\n m.append(x)\n z=list(x)\n if last!=z[0]:\n v=0\n p = len(z) - 1\n last = z[p]\nif v==0:\n print('No')\nelse:\n print('Yes')", 'import sys\nn = int (input())\nwords = []\nNo=" "\nfor i in range (n) :\n words.append(input())\nfor x in range(len(words)):\n if words.count(words[x]) > 1 or words[x+1][0] != words[x][-1]:\n No="No"\n print (No)\n sys.exit() \nIf No != "No":\n print ("Yes")', 'a=int(input())\nc=0\nz=[]\ny=[]\nb=[]\nfor i in range(a):\n x=str(input())\n z.append(x[0])\n y.append(x[-1])\n if i==0:\n b.append(x)\n if x not in b and z[i]==y[i-1]:\n b.append(x)\n c+=1\nif c==a-1:\n print("YES")\nelse:\n print("NO")', "from collections import Counter\nf = open('pokemon', 'r')\nnames = []\nfor line in f:\n names.append(line)\nmax_length = 0\npokemon = ''\nfor i in range(len(names)):\n p = [names[i]]\n start = names[i][-2]\n shiritori = True\n count = 1\n while shiritori == True:\n shiritori = False\n for j in range(len(names)):\n if i != j and names[j][0] == start and not names[j] in p:\n count += 1\n start = names[j][-2]\n shiritori = True\n p.append(names[j])\n if count > max_length:\n max_length = count\n pokemon = names[i]\n break\n print (p)\nprint (pokemon + str(max_length))", 'n = int(input())\nW = [ input() for _ in range(n) ]\nif sorted(W) != sorted(list(set(W))):\n print("No")\nelse:\n for i in range(n-1):\n if W[i][-1] != W[i+1][0]:\n print("No")\n exit()\n print("Yes")'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s356578984', 's394860360', 's470356924', 's517402891', 's477816746'] | [3064.0, 2940.0, 3064.0, 3316.0, 3060.0] | [18.0, 17.0, 18.0, 21.0, 17.0] | [270, 277, 262, 720, 207] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.