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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02730 | u745812846 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = list(input())\nn = len(s)\ns_0 = s[:(n-1)//2]\ns_1 = s[(n+1)//2:]\nif s_0 == s_0[::-1] and s_1 == s_1[::-1] and s == s[::-1]\n print("Yes")\nelse:\n print("No")', 's = list(input())\nn = len(s)\ns_0 = s[:(n-1)//2]\ns_1 = s[(n+1)//2:]\nif s_0 == s_0[::-1] and s_1 == s_1[::-1] and s == s[::-1]:\n print("Ye... | ['Runtime Error', 'Accepted'] | ['s611397956', 's993855570'] | [2940.0, 3060.0] | [17.0, 18.0] | [163, 164] |
p02730 | u750651325 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['import sys\nimport math\nimport itertools\nimport bisect\nfrom copy import copy\nfrom collections import deque,Counter\nfrom decimal import Decimal\ndef s(): return input()\ndef k(): return int(input())\ndef S(): return input().split()\ndef I(): return map(int,input().split())\ndef X(): return list(input())\ndef L():... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s072814593', 's799639543', 's620933769'] | [9892.0, 3064.0, 9964.0] | [30.0, 17.0, 35.0] | [653, 409, 653] |
p02730 | u757117214 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['from scipy.misc import comb\nN,M = map(int,input().split())\neven = int(comb(N,2))\nodd = int(comb(M,2))\nprint(even + odd)', 'from scipy.misc import comb\nN,M = map(int,input().split())\neven = comb(N,2)\nodd = comb(M,2)\nprint(int(even) + int(odd))', 'S = [c for c in input()]\nN = len(S) - 1\ns1 = S[:(N-1)//2 + 1]\... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s711146321', 's959049391', 's448822337'] | [23824.0, 26000.0, 3064.0] | [349.0, 378.0, 18.0] | [119, 119, 232] |
p02730 | u758973277 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S= input()\nif S[0::] = S[::-1]\n print(Yes)\nelse\n print(No)', "S = input()\nN = len(S)\nif S == S[::-1] and S[:(N-1)//2] == S[:(N-1)//2:-1] and S[(N+1)//2:] == S[(N+1)//2::-1] :\n print('Yes')\nelse:\n print('No')\n", 'S= input()\nif S[0::] = S[::-1]\n print(Yes)\nelse\n print(No)', "S = input()\nN = len(S)... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s249747420', 's723756351', 's745115537', 's707065321'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [60, 149, 60, 149] |
p02730 | u759726213 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["import sys\n\nS = input()\n\n# S = 'akasaka'\n\nN = len(S)\n\nS_rev = S[::-1]\nif S != S_rev:\n print('No')\n sys.exit(1)\n\nsub_S = S[:int((N - 1)/2)+1]\nsub_S_rev = S[int((N + 3)/2)-1:]\nif sub_S != sub_S_rev:\n print('No')\n sys.exit(1)\n\nprint('Yes')", "import sys\n\nS = input()\n\n# S = 'akasaka'\n\... | ['Runtime Error', 'Accepted'] | ['s426031103', 's002932805'] | [3060.0, 3060.0] | [18.0, 26.0] | [248, 246] |
p02730 | u760961723 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['str = input()\nrev_str = str[::-1]\nlen_str = len(str)\n\npre_str = str[0:((len_str-1)//2)]\npro_str = str[(((len_str+3)//2)-1)::]\n\nprint(pre_str)\nprint(pro_str)\n\n\nrev_pre_str = pre_str[::-1]\nrev_pro_str = pro_str[::-1]\n\npali = 0\n\nif str == rev_str:\n if pre_str == rev_pre_str:\n if pro_str == re... | ['Wrong Answer', 'Accepted'] | ['s467192110', 's200620142'] | [3064.0, 3064.0] | [17.0, 18.0] | [386, 387] |
p02730 | u763210820 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["n = list(input())\nnr = list(reversed(n))\nmae = []\nusiro = []\nprint((len(n)-1)/2)\nfor i in range(int((len(n)-1)/2)):\n mae.append(n[i])\n usiro.append(nr[i])\n\nif mae == usiro:\n print('Yes')\nelse:\n print('No')\n", "n = list(input())\n\nmae = []\nusiro = []\nfor i in range(int((len(n)-1)/2)):\n ... | ['Wrong Answer', 'Accepted'] | ['s978829993', 's535686080'] | [3060.0, 3060.0] | [18.0, 17.0] | [218, 219] |
p02730 | u763424241 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["\ndef check_p(s):\n return s == s[::-1]\n\nS = input().strip()\nif len(S)%2 == 0:\n print('NO')\nelse:\n if not check_p(S[:(len(S) - 1)//2]):\n print('NO')\n elif not check_p(S[((len(S) + 3)//2) - 1:]):\n print('NO')\n else:\n print('YES')\n", "\ndef check_p(s):\n return s == s[... | ['Wrong Answer', 'Accepted'] | ['s360747404', 's835833451'] | [2940.0, 3060.0] | [18.0, 17.0] | [263, 308] |
p02730 | u765699396 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['X=input()\nL=X[::-1]\nif N % 2 == 1:\n if L==X:\n N=len(X)\n a=int((N-1)/2)\n b=int((N+3)/2)\n Ya=X[0:a]\n LYa=Ya[::-1]\n Yb=X[b-1:N]\n LYb=Yb[::-1]\n if LYa ==Ya and LYb == Yb:\n print("Yes")\n else:\n print("No")\n else:\n ... | ['Runtime Error', 'Accepted'] | ['s709668003', 's491971901'] | [3064.0, 3064.0] | [18.0, 17.0] | [340, 332] |
p02730 | u766051499 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['def palindrome(str):\n n = len(str)\n for i in range(n // 2):\n if str[i] != str[n - 1 - i]:\n return False\n return True\n\nstr = input()\nis_palindrome = palindrome(str)\nn = len(str)\nif n % 2 == 1:\n is_palindrome = palindrome(str[:(n - 1) // 2]) and palindrome(str[(n + 3) // 2:])\n\nprint("Yes" if is... | ['Wrong Answer', 'Accepted'] | ['s148638439', 's325897543'] | [3060.0, 3060.0] | [17.0, 17.0] | [327, 344] |
p02730 | u766235618 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = list(input())\nprint(S)\nFS = S[:int((len(S) - 1)/ 2)]\nBS = S[int((len(S) + 3) / 2) -1:]\n\nr_S = list(reversed(S))\nr_FS = list(reversed(FS))\nr_BS = list(reversed(BS))\nflag = 0\n\nfor i in range(len(S)):\n # print(r_FS, BS)\n if r_S[i] == S[i] and r_FS == FS and r_BS == BS:\n flag = 1\n\n ... | ['Wrong Answer', 'Accepted'] | ['s308468725', 's807972290'] | [3064.0, 3064.0] | [17.0, 17.0] | [408, 410] |
p02730 | u767995501 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = str(input())\nn = int(len(s))\nif (s[::-1] != s) or (s[:(n-1)//2:] != s[:(n-1)//2:-1]) or (s[(n+3)//2::] != s[(n+3)//2::-1]):\n print("No")\nelse:\n print("Yes")', 'S = input()\nN = len(S)\nprint("Yes" if S == S[::-1] and S[:N//2] == S[-N//2+1:] else "No")'] | ['Wrong Answer', 'Accepted'] | ['s455061124', 's057754265'] | [3060.0, 2940.0] | [18.0, 17.0] | [166, 89] |
p02730 | u768559443 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s=input()\nn=len(s)\nans="No"\nif s==s[::-1]:\n if s[:(n-1)//2]==s[:((n-1)//2):-1]:\n if s[((n+3)//2)-1:n]==s[((n+3)//2)-1:n:-1]:\n ans="Yes"\nprint(ans)', 's=input()\nn=len(s)\na=s[((n+3)//2)-1:n]\nans="No"\nif s==s[::-1]:\n if s[:(n-1)//2]==s[:((n-1)//2):-1]:\n if a==a[::-1]:\n ... | ['Wrong Answer', 'Accepted'] | ['s031864745', 's552806442'] | [3060.0, 3060.0] | [17.0, 17.0] | [167, 158] |
p02730 | u771538568 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['n=input()\ns=len(n)\nd=int((s-1)/2)\np=int(s+3)/2\nm=n[::-1]\nn1=n[0:d-1]\nn2=n1[::-1]\nn3=n[p-1:]\nn4=n3[::-1]\nif n==m and n1==n2 and n3==n4:\n print("Yes")\nelse:\n print("No")', 'n=input()\ns=len(n)\nd=int((s-1)/2)\np=int((s+3)/2)\nm=n[::-1]\nn1=n[0:d]\nn2=n1[::-1]\nn3=n[p-1:]\nn4=n3[::-1]\nif n==m and n1==... | ['Runtime Error', 'Accepted'] | ['s844647254', 's963512089'] | [3064.0, 3064.0] | [17.0, 18.0] | [173, 173] |
p02730 | u771994691 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["import math\n\ndef isPalindrome(s):\n n = len(s)\n flag = True\n for i in range(n):\n if i < math.floor(n/2):\n if s[i] == s[n - i - 1]:\n continue\n else:\n flag = False\n return flag\n\n\ns = str(input())\nn = len(s)\nmedium = math.floor(n/2)\np... | ['Wrong Answer', 'Accepted'] | ['s210366216', 's521870355'] | [3064.0, 3064.0] | [17.0, 17.0] | [512, 447] |
p02730 | u773440446 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s = input()\na = s.sort()\nif s != s.sort():\n print('No')\n exit()\n \nif s[0:len(s)//2] == a[0:len(s)//2]:\n print('Yes')\nelse:\n print('No')", "s = input()\n\ndef kaibun(s):\n if s == s[::-1]:\n return 1\n else:\n return 0\n \nq = len(s)\nd = int((q-1)/2)\nket = s[0:d]\nmat = s[int... | ['Runtime Error', 'Accepted'] | ['s005461305', 's320343783'] | [9004.0, 9064.0] | [30.0, 32.0] | [140, 256] |
p02730 | u773711732 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S = str(input())\njudge = True\nS = list(S)\nfor i in range(int(len(S)/2)):\n if S[i] != S[len(S) - 1 - i]:\n judge = False\nfor i in range(int(len(S)/4)):\n if S[i] != S[int(len(S)/2) - 1 - i]:\n judge = False\nfor i in range(int(len(S)/4)):\n if S[i + int(len(S)/2) + 1] != S[int(len(S)) - 1 -... | ['Wrong Answer', 'Accepted'] | ['s093634173', 's670323888'] | [3064.0, 3064.0] | [17.0, 18.0] | [347, 345] |
p02730 | u777394984 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['def ispalindrome(s):\n h = len(s) / 2\n for a, b in zip(s[:h], reversed(s[h+1:])):\n if a != b: return False\n return True\ns = input()\nn = len(s)\nif ispalindrome(s) and ispalindrome(s[0:int((n+1)/2)-1]) and ispalindrome(s[int((n+3)/2)-1:n-1]):\n print("Yes")\nelse:\n print("No")', 'def k(stri... | ['Runtime Error', 'Accepted'] | ['s257212512', 's491046807'] | [3064.0, 3060.0] | [17.0, 18.0] | [294, 178] |
p02730 | u779293207 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input()\nc = True\nfor i in range (len(S)//2):\n if S[i]=S[len(S)//2-i-1]=S[len(S)//2+1+i]=S[len(S)-i-1]:\n c = True\n else:\n c = False\nif (c):\n print('Yes')\nelse:\n print('No')", "S = input()\nc = True\nfor i in range (len(S)//2):\n if S[i]==S[len(S)//2-i-1]==S[len(S)//2+1+i]==S[len(S)-i-1]:\n ... | ['Runtime Error', 'Accepted'] | ['s194488482', 's696891537'] | [2940.0, 3060.0] | [17.0, 18.0] | [185, 198] |
p02730 | u779728630 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input()\n\nN = len(S)\n\nng = False\nfor i in range(N):#First\n if S[i] != S[-i]:\n ng = True\n\nfor i in range(N):#Second\n if S[i] != S[ N // 2 - i - 1]:\n ng = True\n\nprint('No') if ng else print('Yes')", "S = input()\n\nN = len(S)\n\nng = False\nfor i in range(N):#First\n if S[i] != S[-i]:\n ng =... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s042608281', 's746515917', 's718534241'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [205, 209, 215] |
p02730 | u780962115 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['print(int(input())**3/27)', 's=list(input())\nn=len(s)\nflag1=True\nflag2=True\n\nb=s[:(n-1)//2]\nc=s[(n+1)//2:]\n\nif b==b[::-1] and c==c[::-1] and s==s[::-1]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s185226871', 's164350175'] | [2940.0, 3064.0] | [17.0, 17.0] | [25, 162] |
p02730 | u787131053 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S = input()\n\nend = len(S)\nhalf = int(end/2)\n\nfor i in range(0,half):\n if S[i] is not S[half-1-i]:\n print("NO")\n exit()\nS1 = S[0:half]\nS2 = S[half+1:end]\n\nif S1 == S2:\n print("YES")\nelse:\n print("NO")', 'S = input()\n\nend = len(S)\nhalf = int(end/2)\n\nfor i in range(0,half):\n ... | ['Wrong Answer', 'Accepted'] | ['s599180841', 's327276646'] | [3060.0, 3060.0] | [17.0, 17.0] | [222, 231] |
p02730 | u790710233 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input()\nn = len(s)\ncnt = 0\nif s == s[::-1]:\n cnt += 1\n\nidx = (n-1)//2\nif s[:idx] == s[:idx][::-1]:\n cnt += 1\nidx = (n+3)//2\nif s[idx:] == s[idx:][::-1]:\n cnt += 1\n\nprint("Yes" if cnt == 3 else "No")\n', 's = input()\nn = len(s)\ncnt = 0\nif s == s[::-1]:\n cnt += 1\nidx = (n-1)//2\nif s[:... | ['Wrong Answer', 'Accepted'] | ['s627795403', 's772884785'] | [3060.0, 3060.0] | [17.0, 18.0] | [212, 212] |
p02730 | u796044734 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s = str(input())\nk = len(s)\n\ncnt=0\nfor i in range(k):\n if s[i]=!s[int((n+1)/2)-i]:\n cnt+=1\n if s[int((n+3)/2)+i]=!s[int((3*n+3)/2)-i]:\n cnt+=1\n\nif cnt==0:\n print('Yes')\nelse:\n print('No')\n", "s = input()\nn = len(s) // 2\n\nif s[:n] == s[-n:]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s429436397', 's467021590'] | [3068.0, 2940.0] | [18.0, 17.0] | [198, 87] |
p02730 | u798086274 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input()\nps1 = s[:len(s)//2]\nps2 = s[(len(s)+2)//2:]\n\nif s == reversed(s) and ps1 == reversed(ps1) and ps2 == reversed(ps2):\n print("Yes")\nelse :\n print("No")', 's = input()\nps1 = s[:len(s)//2]\nps2 = s[(len(s)+2)//2:]\n\nif s == s[::-1] and ps1 == ps1[::-1] and ps2 == ps2[::-1]:\n print("Yes")\ne... | ['Wrong Answer', 'Accepted'] | ['s809130424', 's487360969'] | [2940.0, 3060.0] | [17.0, 18.0] | [167, 155] |
p02730 | u798675549 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["def f(x):\n return x==x[::-1]\nS=input()\nn=(len(S)-1)/2\nS1,S2=S[:n-1],S[n+1:]\nif f(S) and f(S1) and f(S2):\n print('Yes')\nelse:\n print('No')", "def f(x):\n return x==x[::-1]\nS=input()\nn=(len(S)-1)//2\nS1,S2=S[:n],S[n+1:]\nif f(S) and f(S1) and f(S2):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s342614834', 's679543319'] | [3060.0, 3060.0] | [17.0, 17.0] | [140, 139] |
p02730 | u799428010 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S=str(input())\nN=len(S)\nif S!=S[::-1]:\n print('No')\nelse:\n S1=S[0:(N-1)//2]\n S2=S[(N+3)//2:N]\n if S1==S1[::-1] and S2==S2[::-1]:\n print('Yes')\n else:\n print('No')", "S=str(input())\nN=len(S)\nif S!=S[::-1]:\n print('No')\nelse:\n S1=S[:(N-1)/2]\n S2=S[(N+3)/2:]\n if ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s365171467', 's981999005', 's620573436'] | [8984.0, 9064.0, 8868.0] | [29.0, 27.0, 28.0] | [292, 288, 292] |
p02730 | u801573951 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input("")\nl = len(s)\ns1 = s[:int((l-1)/2)]\ns2 = s[int((l+3)/2) - 1:]\nif (s1 == s1[::-1]) and (s2 == s2[::-1]):\n print("Yes")\nelse :\n print("No")\nprint(s1,s2)', 's = input("")\nl = len(s)\ns1 = s[:int((l-1)/2)]\ns2 = s[int((l+3)/2) - 1:]\nif (s1 == s1[::-1]) and (s2 == s2[::-1]) and (s == s[::-1]):\n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s018166423', 's410122128', 's497518140', 's763918606'] | [3060.0, 3064.0, 3060.0, 3060.0] | [18.0, 18.0, 17.0, 17.0] | [167, 186, 167, 173] |
p02730 | u804339040 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['n = len(s)\nsa = s[:(n-1)//2]\nsb = s[(n+3)//2-1:n]\nif s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:\n print("Yes")\nelse:\n print("No")', 'n = len(s)\nsa = s[:int((n-1)/2)]\nsb = s[int((n+3)/2)-1:]\nif s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:\n print("Yes")\nelse:\n print("No")\n', 's =... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s001779337', 's050626884', 's090684099'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [143, 151, 156] |
p02730 | u804885478 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["sente=input()\nn=len(sente)\nnt=int((n-1)/2)\nnb=int((n+3)/2)\n#print(nt,nb)\n#print(sente[nb:n])\nif sente == sente[::-1]:\n if sente[0:nt] == sente[0:nt][::-1]:\n #print(sente[0:nt])\n \n if sente[nb-1:n]==sente[nb-1:n][::-1]:\n #print(sente[nb-1:n])\n\n print('Yes')\n ... | ['Runtime Error', 'Accepted'] | ['s736074374', 's575612805'] | [2940.0, 3064.0] | [17.0, 18.0] | [391, 413] |
p02730 | u811000506 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S = str(input())\nT = S[::-1]\nN = len(S)\nR = S[:(N-1)//2]\nL = S[N+3//2:]\n\nif S==T and N==R:\n print("Yes")\nelse:\n print("No")', 'S = str(input())\nReverse_S = S[::-1]\nN = len(S)\nR = S[:(N-1)//2]\nReverse_R = R[::-1]\nL = S[N+3//2:]\nReverse_L = L[::-1]\n\nif S==Reverse_S and R==Reverse_R and L==Reverse... | ['Wrong Answer', 'Accepted'] | ['s075673656', 's018587946'] | [2940.0, 3060.0] | [18.0, 18.0] | [129, 211] |
p02730 | u812354010 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s=input()\nmozisuu=len(s)\n\nhantei=0\nfor i in range(len(s)):\n if s[i]==s[mozisuu-i-1]:\n hantei+=1\n\nj=(mozisuu-1)//2\n\nfor i in range(j):\n if s[i]==s[j-i-1]:\n hantei+=1\n\nj=(mozisuu+3)//2\n\nfor i in range(j-1,mozisuu):\n if s[i]==s[j-i-1]:\n hantei+=1\n\nif hantei==3:\n prin... | ['Wrong Answer', 'Accepted'] | ['s870474775', 's043425399'] | [9032.0, 9008.0] | [28.0, 30.0] | [330, 349] |
p02730 | u812587837 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["def isKaibun(s):\n flag = True\n n = 0\n if len(s) > 2:\n if len(s)%2 == 0:\n n = len(s)//2\n else:\n n = (len(s)-1)//2\n for i in range(n):\n if s[i:i+1] != s[len(s)-(i+1):len(s)-i]:\n flag = False\n break\n else:\n ... | ['Wrong Answer', 'Accepted'] | ['s987113867', 's272058247'] | [3064.0, 3064.0] | [18.0, 17.0] | [502, 408] |
p02730 | u813405587 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input()\nN = len(S)\nA = (N - 1) // 2\nB = ((N + 3) // 2)\nif S[0:A] == S[B - 1:N]:\n print('Yes')\nelif:\n print('No')", "S = input()\nN = len(S)\nA = (N-1)//2\nB = ((N+2)//2)\nif S[0:A] == S[B:N]:\n print('Yes')\nelif:\n print('No')", "S = input()\nN = len(S)\nA = (N-1)//2\nB = ((N+2)//2)\nif S[0:A] == [B:N... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s100661544', 's186155414', 's274981308', 's359171121', 's387886130', 's574416675', 's671272826', 's712677007', 's902159596', 's944916203', 's260226906'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [118, 106, 105, 109, 93, 118, 126, 105, 105, 125, 127] |
p02730 | u815931251 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['import math\n\ndef checkKaibun(s):\n ret = True\n length = len(s)\n for i in range(math.floor(length / 2)):\n if s[i] != s[len(s)-1-i]:\n return False\n return ret\n\ns = input()\nret1 = checkKaibun(s)\n#print("{}".format(ret1))\n\nlength = len(s)\ns2 = s[0:(int)((length-1)/2)]\n#print("... | ['Wrong Answer', 'Accepted'] | ['s365967812', 's122475356'] | [3064.0, 3064.0] | [18.0, 17.0] | [521, 558] |
p02730 | u819465503 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["text_ = input()\n\nif text_ != text_[::-1]:\n print('No')\nelif text_[:((len(text_) - 1)//2)] != text_[:((len(text_) - 1)//2)][::-1]:\n print('No')\nelif text_[:((len(text_) + 3) // 2)] != text_[:((len(text_) + 3) // 2)][::-1]:\n print('No')\nelse:\n print('Yes')", "text_ = input()\n\nif text_ != text_[::... | ['Wrong Answer', 'Accepted'] | ['s228493503', 's340149797'] | [3064.0, 3064.0] | [17.0, 17.0] | [266, 262] |
p02730 | u819593641 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s = list(input())\nn = len(s)\n\ndef kaibun(st):\n sta = list()\n for k in range(len(st)//2):\n sta.append(st[k])\n for k in range(len(st)//2):\n if st[-(-len(st)//2)+k] != sta.pop():\n return False\n return True\n\nif kaibun(s) == False:\n print('No')\nelif kaibun(s[:(n-1)//2]) == No:\n print('No')\... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s298462930', 's640390584', 's489682997'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [373, 389, 379] |
p02730 | u821265215 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input()\ns_len = len(s)\n \ndef judge(start=0, end=s_len):\n print(start, end)\n for i in range(start, end):\n print(s[i], s[end-1-i])\n if s[i] == s[end-1-i]:\n continue\n else:\n return 0\n return 1\n \nif judge() and judge(end=(s_len-1)//2) and judge(start=(s_len+3)//2-1):\n print("Yes")... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s865203497', 's895601768', 's354420365'] | [3064.0, 2940.0, 3060.0] | [17.0, 18.0, 18.0] | [324, 291, 276] |
p02730 | u822044226 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input()\nN = len(S)\n\nprint(S[:(N-1)//2])\nprint(S[(N+2)//2:])\n\nif S[:(N-1)//2] == S[(N+2)//2:]:\n print('Yes')\nelse:\n print('No')", "S = input()\nN = len(S)\n\nif S[:(N-1)//2] == S[(N+2)//2:]:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s566890007', 's842140062'] | [3060.0, 2940.0] | [17.0, 17.0] | [132, 91] |
p02730 | u823885866 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["import sys\ns = sys.stdin.readline()\ni = 0\nl = len(s)\nflag = True\nwhile flag and i <= l:\n if s[i] != s[l-1]:\n flag = False\n i += 1\n l -= 1\nl = len(s)\na = s[0:(l-1)/2]\ni = 0\nl = len(a)\nwhile flag and i <= l:\n if a[i] != a[l-1]:\n flag = False\n i += 1\n l -= 1\nb = s[(len(s) + 3)/2 - 1:]\ni =... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s139864423', 's181654465', 's303895236', 's442429122', 's507215228', 's563522848', 's705614078', 's964527788'] | [3064.0, 3064.0, 3064.0, 2940.0, 3188.0, 2940.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 17.0, 17.0, 17.0, 18.0, 18.0] | [435, 408, 437, 297, 441, 464, 298, 450] |
p02730 | u830162518 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input()\nt = s[:(len(s)-1)/2]\nu = s[(len(s)+3)/2-1:]\nif s == s[::-1] and t == t[::-1] and u == u[::-1]:\n print("Yes")\nelse:\n print("No")\n', 's = input()\nt = s[:(len(s)-1)//2]\nu = s[(len(s)+3)//2-1:]\nif s == s[::-1] and t == t[::-1] and u == u[::-1]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s735389783', 's368175166'] | [2940.0, 3060.0] | [17.0, 17.0] | [142, 143] |
p02730 | u830592648 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S=list(input())\n\nres='Yes'\nN=len(S)\n\ndef ispalindrome(s):\n h = len(s) // 2\n if (len(s)==2) & (h==1):\n if s[0]==s[1]:\n return 1\n else: return 0\n else:\n for a, b in zip(s[:h], reversed(s[h+1:])):\n if a != b: return 0\n return 1\n \nif ispalindro... | ['Wrong Answer', 'Accepted'] | ['s469097510', 's409174197'] | [3064.0, 3064.0] | [18.0, 18.0] | [524, 524] |
p02730 | u830881690 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s = list(input())\nn = len(s)\n\ns1 = [s[i] for i in range((n-1)//2)]\ns2 = [s[i] for i in range((n+3)//2-1, n)]\n\ns1r = list(reversed(s1))\ns2r = list(reversed(s2))\n\nif s1 == s1r and s2 == s2r:\n print('Yes')\nelse:\n print('No')\n \nprint(s1)", "s = list(input())\nn = len(s)\n\ns1 = [s[i] for i in range... | ['Wrong Answer', 'Accepted'] | ['s204675821', 's784370859'] | [3064.0, 3064.0] | [17.0, 17.0] | [242, 262] |
p02730 | u831835224 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['def palindrome(word):\n if len(word) <= 1:\n return True\n if word[0] != word[-1]:\n return False\n return palindrome(word[1:-1])\n \nword = input().lower()\nn = len(word) // 2\nissuper = palindrome(word[:n]) and palindrome(word[n+1:])\nprint("Yes" if issuper else "No"))', 'def palindrome(word):\n if len(wo... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s494368623', 's932713704', 's791275443'] | [2940.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0] | [270, 260, 282] |
p02730 | u833436666 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S=input()\nsum="Yes"\nkai=len(S)\nunk=(int(kai)-1)/2\nunk1=(int(kai)+3)/2\nA=S[0:int(unk)]\nB=S[int(unk1):int(kai)]\nfor i in range(kai//2):\n if S[i]!=S[-i-1]:\n sum="No"\nfor i in range(len(A)):\n if A[i]!=A[-i-1]:\n sum="No"\nfor i in range(len(B)):\n if B[i]!=B[-i-1]:\n sum="No"\nprint(sum)', 'S=input... | ['Wrong Answer', 'Accepted'] | ['s836104479', 's988151976'] | [3064.0, 3064.0] | [17.0, 17.0] | [291, 303] |
p02730 | u835924161 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s=input()\nn=len(s)\nfor i in range(n):\n if s[i]!=s[n-1-i]:\n print("No")\n exit()\nharf=int((n-1)/2\nfor i in range(harf):\n if s[i]!=s[harf-1-i]:\n print("No")\n exit()\nfor i in range(harf+1,n):\n if s[i]!=s[n-1-(i-harf-1)]:\n print("No")\n exit()\nprint("Yes")',... | ['Runtime Error', 'Accepted'] | ['s792555235', 's179765623'] | [3064.0, 3060.0] | [17.0, 17.0] | [301, 209] |
p02730 | u836004075 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = str( input() )\n\nn = len( s )\ns_l = s[:(n-1)//2]\ns_r = s[(n+1)//2:]\nprint( s, s_l, s_r )\n\nif s == s[::-1] and s_l == s_l[::-1] and s_r == s_r[::-1]:\n print("Yes")\nelse:\n print("No")', 's = str( input() )\n\nn = len( s )\ns_l = s[:(n-1)//2]\ns_r = s[(n+1)//2:]\n\nif s == s[::-1] and s_l == s_l[::-1]... | ['Wrong Answer', 'Accepted'] | ['s594126714', 's029126052'] | [3060.0, 3060.0] | [17.0, 17.0] | [190, 169] |
p02730 | u837340160 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["def kaibun(s):\n N = len(s)\n\n flag = True\n for i in range(N // 2):\n if s[i] != s[N - i - 1]:\n flag = False\n return flag\n\nstring = input()\nN = len(string)\nif kaibun(string) and kaibun(string[:(N - 3) // 2]) and kaibun(string[(N + 1) // 2:N - 1]):\n print('Yes')\nelse:\n pr... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s176579710', 's558661039', 's601405841'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [314, 295, 310] |
p02730 | u838651937 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input()\n \ndef kaibunn_boolean(s):\n return s == s[::-1]\n \nans = False\n \nif kaibunn_boolean(S) and kaibunn_boolean(S[:(len(S)-1)//2]) and kaibunn_boolean(S[-(len(S)+3)//2:]):\n ans = True\n \nif ans:\n print('Yes')\nelse:\n print('No')\n ", "S = input()\n\ndef kaibunn_boolean(s):\n return s == s[::-1]\n... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s171686322', 's871797320', 's795999502'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [237, 194, 183] |
p02730 | u843433688 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['input_str = input().strip()\n\ndef main():\n N = len(input_str)\n input_str_part1 = input_str[:int((N-1)/2)]\n input_str_part2 = input_str[int((N+3)/2)-1:]\n flag0 = input_str == input_str[::-1]\n flag1 = input_str_part1 == input_str_part1[::-1]\n flag2 = input_str_part2 == input_str_part2[::-1]\n if flag0 * f... | ['Runtime Error', 'Accepted'] | ['s722730916', 's012513848'] | [2940.0, 3188.0] | [17.0, 18.0] | [406, 411] |
p02730 | u846385882 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s=list(input())\n#s=['a','b','a','d','a','b','a']\nL=int((len(s)-1)/2)\nf1=0\nfor i in range(L-1):\n if s[0+i]==s[len(s)-i]:\n else:\n f1+=1\n \nLL=L//2\nf2=0\nif f1==0:\n for j in range(LL-1):\n if s[0+j]==s[len(L)-i]:\n else:\n f2+=1\n\nif f1==0&f2==0:\n print('Yes')\nelse... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s144442303', 's441058167', 's943806570', 's186474848'] | [2940.0, 3064.0, 3064.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [321, 461, 461, 591] |
p02730 | u848647227 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['a = input()\nfor i in range(len(a) // 2):\n if a[i] != b[-(i+1)]:\n print("No")\n exit()\nb = a[0:(len(a) - 1) // 2]\nc = a[(len(a) + 3) // 2 - 1:len(a)]\nfor i in range(len(b) // 2):\n if b[i] != b[-(i+1)]:\n print("No")\n exit()\nfor i in range(len(c) // 2):\n if c[i] != c[-(i+1... | ['Runtime Error', 'Accepted'] | ['s935171435', 's239576948'] | [3064.0, 3064.0] | [18.0, 17.0] | [357, 357] |
p02730 | u849756457 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S = input()\nN = len(S)\n\ndef isp(s):\n n = len(s)\n for i in range(n // 2 - 1):\n if s[i] != s[n - 1 - i]:\n return False\n return True\n\nif isp(S) and isp(S[0:(N - 1) / 3]):\n print("Yes")\nelse:\n print("No")', 'S = input()\nN = len(S)\n \ndef isp(s):\n n = len(s)\n for i in range(n // 2):\n if... | ['Runtime Error', 'Accepted'] | ['s614380287', 's658027714'] | [9056.0, 9016.0] | [28.0, 29.0] | [213, 212] |
p02730 | u851035514 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = list(input())\nN = len(S)\nM = (N-1)//2\nS1 = S[:(N-1)//2]\nS2 = S[(N+3)//2-1:]\nS2.reverse()\nS11 = S1[:M//2]\nS12 = S1[(M+3)//2-1:]\nprint(S11)\nprint(S12)\nS12.reverse()\n\nif S1 == S2 and S11 == S12:\n print('Yes')\nelse:\n print('No')", "S = list(input())\nN = len(S)\nM = (N-1)//2\nS1 = S[:(N-1)//2]\nS... | ['Wrong Answer', 'Accepted'] | ['s697846947', 's257365328'] | [3064.0, 3064.0] | [17.0, 17.0] | [234, 210] |
p02730 | u851125702 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S=input()\nN=len(S)\nF=S[0:(N-1)//2]\nB=S[(N+3)//2-1:N]\nprint(F,B)\nif(F==B):\n l=len(F)\n for i in range(l//2):\n if(F[i]!=F[l-1-i]):\n print("No")\n break\n print("Yes")\nelse:\n print("No")', 'S=input()\nN=len(S)\nF=S[0:(N-1)//2]\nB=S[(N+3)//2-1:N]\n\nif(F==B):\n l=len(... | ['Wrong Answer', 'Accepted'] | ['s508975617', 's584450359'] | [3060.0, 3060.0] | [18.0, 17.0] | [221, 211] |
p02730 | u851319680 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s=input()\n\ndef kai(s):\n if len(s)//2 == 0:\n if s[:int(len(s)/2-1)] == s[int(len(s)/2):]:\n return True\n else:\n return False\n\n else:\n if s[:int((len(s)+1)/2)] == s[int((len(s)+1)/2):]:\n return True\n else:\n return False\n\nif kai(... | ['Wrong Answer', 'Accepted'] | ['s753002019', 's319955861'] | [3064.0, 3064.0] | [17.0, 17.0] | [408, 466] |
p02730 | u854612823 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s = input()\nn = len(s)\n\nn1 = int((n-1)/2)\ns1 = s[0:n1]\ns_rev = s1[::-1]\n \n\nn2 = int((n+3)/2)\ns2 = s[n2-1:n]\ns2_rev = s2[::-1]\n \n\nif s1 == s_rev and s2 == s2_rev:\n print('Yes')\nelif n =< 2:\n print('No')\nelse:\n print('No')", "s = input()\ns_rev = s[::-1]\nn = len(s)\nif n < 3:\n print('No')\n\ne... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s186336102', 's580516495', 's572671662'] | [2940.0, 3064.0, 3064.0] | [17.0, 20.0, 17.0] | [267, 352, 274] |
p02730 | u854992222 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input()\nl = s[:(len(s)-1)//2:]\nr = s[(len(s)+1)//2:]\nif a == b and a == a[::-1]:\n print("Yes")\nelse:\n print("No")', 's = input()\na = s[:(len(s)-1)//2:]\nb = s[(len(s)+1)//2:]\nif a == b and a == a[::-1]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s998824457', 's475092795'] | [3060.0, 2940.0] | [17.0, 17.0] | [125, 125] |
p02730 | u855393458 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s = input()\nl = len(s)\ns1 = s[:(l - 1) // 2]\ns2 = s[(l + 2) // 2:]\nprint(s1, s1[::-1])\nprint(s2, s2[::-1])\nif s == s[::-1] and s1 == s1[::-1] and s2 == s2[::-1]:\n print('Yes')\nelse:\n print('No')", "s = input()\nl = len(s)\ns1 = s[:(l - 1) // 2]\ns2 = s[(l + 2) // 2:]\nif s == s[::-1] and s1 == s1[::-1]... | ['Wrong Answer', 'Accepted'] | ['s583297513', 's460101810'] | [3064.0, 3060.0] | [17.0, 17.0] | [200, 160] |
p02730 | u855665975 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input()\n\ndef kaibun(x):\n N = len(x)\n flag = True\n for i in range(N // 2):\n if S[i] != S[-i - 1] or N < 3:\n flag = False\n return flag\n\ntmp1 = kaibun(S)\ntmp2 = kaibun(S[:(len(S) - 1) // 2])\ntmp3 = kaibun(S[(len(S) + 3) // 2:])\n\nif tmp1 and tmp2 and tmp3:\n print('Yes')... | ['Wrong Answer', 'Accepted'] | ['s299571299', 's766687739'] | [8996.0, 9112.0] | [29.0, 30.0] | [337, 333] |
p02730 | u858464419 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s = input()\ndef is_kaibun(s):\n for i in range(len(s)//2):\n if s[i] != s[-i-1]:\n return False\n return True\nn = len(s)\ns1 = s[:(n-1)/2]\ns2 = s[(n+1)/2:]\nif is_kaibun(s) & is_kaibun(s1) & is_kaibun(s2):\n print('Yes')\nelse:\n print('No')\n", "s = input()\ndef is_kaibun(s):\n for i in range(len(s)/... | ['Runtime Error', 'Accepted'] | ['s127619175', 's607918488'] | [3060.0, 2940.0] | [19.0, 19.0] | [245, 247] |
p02730 | u863370423 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['def pal(s):\n rev = \'\'\n for a in s:\n rev = a + rev\n return s == rev\n\ns = input()\ndef sub(s):\n if pal(s):\n n = len(s)\n if pal(s[0:(n-1)/2]):\n if pal(s[(n+3)/2:n-1]):\n return True\n return False\nif sub(s):\n print("Yes")\nelse:\n print("N... | ['Runtime Error', 'Accepted'] | ['s676536484', 's588339793'] | [9056.0, 9048.0] | [27.0, 29.0] | [302, 390] |
p02730 | u864276028 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input()\nS1 = S[:int((len(s)-1)/2)]\nS2 = S[int((len(s)+3)/2)-1:]\nprint('Yes' if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else 'No')", "S = input()\nS1 = S[:int((len(S)-1)/2)]\nS2 = S[int((len(S)+3)/2)-1:]\nprint('Yes' if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else 'No')"] | ['Runtime Error', 'Accepted'] | ['s378492124', 's975657457'] | [9048.0, 8912.0] | [30.0, 33.0] | [144, 144] |
p02730 | u868628468 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input()\ndef ispalindrome(s):\n for i in range(len(s)//2):\n if s[i] != s[~i]:\n return False\n return True\nprint(ispalindrome(s) and ispalindrome(s[:len(s)//2]) and ispalindrome(s[len(s)//2+1:]))', 's = input()\ndef ispalindrome(s):\n for i in range(len(s)//2):\n if s[i] != s[~... | ['Wrong Answer', 'Accepted'] | ['s352813792', 's670058456'] | [3060.0, 3060.0] | [17.0, 17.0] | [219, 251] |
p02730 | u874644572 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['ans = "Yes"\ns = input()\nif s != s[::-1]: \n ans = "No"\nn = len(s) // 2\nif s[:n] != s[0:n:-1]:\n ans = "No"\nprint(ans)', 'ans = "Yes"\ns = input()\nif s != s[::-1]: \n ans = "No"\nn = len(s) // 2\nif s[:n] != s[n-1::-1]: \n ans = "No"\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s760231640', 's679141388'] | [3060.0, 2940.0] | [17.0, 17.0] | [146, 241] |
p02730 | u875449556 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S = input()\nN = len(S)\na = S[0:(N-1)//2]\nb = S[(N+3)//2-1:]\n\ndef kaibun(l):\n for i in range(len(l)):\n if l[i] != l[len(l)-1-i]:\n return(False)\n return(True)\n\nprint(kaibun(S))\nprint(a)\nprint(kaibun(a))\nprint(b)\nprint(kaibun(b))\n \nif kaibun(S) & kaibun(a) & kaibun(b):\n prin... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s134520824', 's270000428', 's522347333', 's563300205', 's643167028', 's705085660', 's048378049'] | [3064.0, 3060.0, 3060.0, 3064.0, 3060.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0, 17.0, 17.0, 18.0, 18.0] | [343, 261, 272, 272, 273, 260, 252] |
p02730 | u876295560 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s=input()\ndef kaibun(aa) :\n for i in range(len(aa)):\n if aa[i]!=aa[-i-1] :\n return False\n \n return True\n\n\nb=int((len(s)-1)/2)\nc=int((len(s)+3)/2)\nmae=s[:b]\nato=s[c:]\nif kaibun(s) and kaibun(mae) and kaibun(ato) :\n print ('Yes')\nelse :\n print('No')", "s=input()\ndef kaibun(aa) :\n for i... | ['Wrong Answer', 'Accepted'] | ['s763587327', 's231555102'] | [3064.0, 3064.0] | [18.0, 18.0] | [262, 264] |
p02730 | u878212264 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input()\nn = len(s)\nnum = int((n-1)/2)-1\nfor i in range(num):\n if s[i] != s[n-1-i]:\n print("No")\n exit()\n \nnum = int(num /2 -1)\nfor i in range(num):\n if s[i] != s[n-1-i]:\n print("No")\n exit()\n\nnum = int(len(s) * 0.5 - 1.5)\nindex = int((n + 3) /2 )\nfor i in range(num):\n if s[index... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s112647960', 's224743390', 's362431608'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0] | [381, 371, 384] |
p02730 | u878654696 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['def is_palindrome(s):\n if len(s) > 1:\n i = 0\n n = len(s)-1\n while s[i] == s[n]:\n i += 1\n n -= 1\n if i >= n:\n break\n else:\n return False\n return True\n elif len(s) == 1:\n return True\n else:\n ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s462920658', 's495665549', 's560429489', 's955862692'] | [3064.0, 3060.0, 3064.0, 3060.0] | [17.0, 18.0, 17.0, 17.0] | [473, 341, 430, 428] |
p02730 | u880850253 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['\ns = input()\nn = len(s)\ns2 = s[:(n-1)//2]\ns3 = s[(n+3)//2-1:]\nn2 = len(s2)\nn3 = len(s3)\nf = True\n\nprint(s2)\nprint(s3)\n\nfor i in range(n//2):\n# print(s[i])\n# print(s[n-(i+1)])\n if s[i] != s[n-(i+1)]:\n f = False\n break\n\nfor i in range(n2//2):\n# print(s[i])\n# print(s[n-(... | ['Wrong Answer', 'Accepted'] | ['s150022911', 's978755835'] | [3064.0, 3064.0] | [19.0, 17.0] | [541, 526] |
p02730 | u884323674 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S = input()\nS_rvs = S[::-1]\nN = len(S)\nleft = int((N-1)/2-1)\nright = int((N+3)/2-1)\n\nif S == S_rvs and S[:left] == S_rvs[right:] and S[right:] == S_rvs[:left]:\n print("Yes")\nelse:\n print("No")', 'S = input()\nS_rvs = S[::-1]\nN = len(S)\n\nif N >= 7 and S == S_rvs and S[:(N-1)/2] == S_rvs[(N+3)/2:] and... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s438945850', 's499033414', 's930275116', 's387504441'] | [3060.0, 3060.0, 3064.0, 3060.0] | [18.0, 17.0, 17.0, 18.0] | [198, 174, 295, 196] |
p02730 | u884339744 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['st=input()\nn=len(st)\nif(n%2==0):\n\tprint("No")\n\texit(0)\nif(st==st[::-1]):\n\ts1=""\n\tfor i in range((n-1)//2+1):\n\t\ts1+=st[i]\n\ts2=""\n\tfor i in range((n+3)//2,n):\n\t\ts2+=st[i]\n\tif(s1==s1[::-1] and s2==s2[::-1]):\n\t\tprint("Yes")\n\telse:\n\t\tprint("No")\nelse:\n\tprint("No")', 'st=input()\nn=len(st)... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s842796746', 's875594570', 's348487685'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [259, 223, 259] |
p02730 | u884601206 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["l=list(input())\ndef kaibun(c):\n d=c[::-1]\n if c = d:\n return 0\n else:\n return 1\na=kaibun(l)\nm=l[:int((len(l)-1)/2)]\nn=l[int((len(l)+1)/2):]\n\nb=kaibun(m)\nc=kaibun(n)\n\nif a+b+c==0:\n print('Yes')\nelse:\n print('No')\n ", "l=list(input())\ndef kaibun(c):\n d=c[::-1]\n if c == d:\n return 0... | ['Runtime Error', 'Accepted'] | ['s559592598', 's771744326'] | [2940.0, 3060.0] | [17.0, 17.0] | [224, 225] |
p02730 | u892305365 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input()\nc = int((len(s) - 1)/2)\nans = (list(s) == list(reversed(s) and list(s[:c]) == list(reversed(s[:c])) and list(s[(c+1):]) == list(reversed(s[(c+1):])))\nprint(["No", "Yes"][ans])', 's = input()\nc = int((len(s) - 1)/2)\nans = (list(s) == list(reversed(s)) and list(s[:c]) == list(reversed(s[:c])) and list(... | ['Runtime Error', 'Accepted'] | ['s871458366', 's549211464'] | [8852.0, 8948.0] | [26.0, 30.0] | [187, 188] |
p02730 | u894934980 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['def check_kaibun(s):\n center_idx = len(s) // 2\n if s[:center_idx] == s[center_idx + 1 :][::-1]:\n return True\n else:\n return False\n\n\nS = input()\nidx = len(S) // 2\nprint(S, S[:idx], S[idx + 1 :])\nif check_kaibun(S) and check_kaibun(S[:idx]) and check_kaibun(S[idx + 1 :]):\n print("Y... | ['Wrong Answer', 'Accepted'] | ['s461765492', 's636896761'] | [3060.0, 3060.0] | [17.0, 17.0] | [332, 240] |
p02730 | u904331908 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['kaibunkai = input()\nn = len(kaibunkai)\nzenhan = kaibunkai[:(n-1)//2]\nkouhan = kaibunkai[(n+3)//2-1:]\nprint(zenhan,kouhan)\n\n\ndef kaibun_desuka(bun):\n s = len(bun)\n for x in range(s//2):\n if bun[x] != bun[-x-1]:\n return False\n return True\n\nif kaibun_desuka(kaibunkai) and kaibun_desuka(zenhan) a... | ['Wrong Answer', 'Accepted'] | ['s040538220', 's791990450'] | [9004.0, 8920.0] | [28.0, 29.0] | [376, 355] |
p02730 | u907403674 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['import sys\na= str(input())\nkaibun = list(a)\nn = int(len(kaibun))\nanswer = "No"\nstrongn1 = int((n-1)/2)\nstrongn2 = int((n+3)/2)\nfor i in reversed(range((int((n+1)/2)),n)):\n if kaibun[i] == kaibun[n-i-1]:\n answer = "Yes"\n else:\n answer = "No"\n print(answer)\n sys.exit()\nfo... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s331841754', 's534505338', 's705114645', 's739792816', 's700218250'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0, 18.0] | [666, 631, 621, 637, 679] |
p02730 | u908505367 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['akacaka\nS = []\nS_reverse = []\nS_first = []\nS_first_reverse = []\nS_last = []\nS_last_reverse = []\n\nS = list(input())\nS_reverse = S.copy()\nS_reverse.reverse()\nS_first = S[:len(S)//2]\nS_last = S[(len(S)+1)//2:]\nS_first_reverse = S_first.copy()\nS_first_reverse.reverse()\nS_last_reverse = S_last.copy()\nS_las... | ['Runtime Error', 'Accepted'] | ['s429753258', 's852958415'] | [3064.0, 3064.0] | [17.0, 17.0] | [459, 451] |
p02730 | u911612592 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = input()\nn = len(s)\n\nsa = s[:(n - 1) // 2]\nsb = s[(n + 1) // 2:]\n\nif s == s[::-1] and a == a[::-1] and b == b[::-1]:\n print("Yes")\n \nelse:\n print("No")\n', 's = input()\nn = len(s)\n\nsa = s[:(n-1) // 2]\nsb = s[(n + 1) // 2:]\n\nif s == s[::-1] and a == a[::-1] and b == b[::-1]:\n print("Yes")\n \n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s355333701', 's367491426', 's581773379'] | [2940.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0] | [158, 155, 162] |
p02730 | u912115033 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s = input()\nn = len(s)\nfor i in range(n//4):\n if s[i] != s[n//2-1]:\n print('NO')\n break\nelse:\n if s[:n//2] == s[n//2+1:]:\n print('YES')\n else:\n print('NO')\n", "s = input()\nn = len(s)\nfor i in range(n//4):\n if s[i] != s[n//2-1-i]:\n print('No')\n brea... | ['Wrong Answer', 'Accepted'] | ['s749089981', 's736646276'] | [2940.0, 2940.0] | [17.0, 17.0] | [193, 195] |
p02730 | u912650255 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input()\nN = len(S)\nif (S == S[::-1]) and (S[0:(N-1)//2] == S[0:(N-1)//2+1:-1]) and (S[(N+3)//2-1:] == S[(N+3)//2-1::-1]):\n print('Yes')\nelse:\n print('No')", "S = input()\nN = len(S)\nif (S == S[::-1]) and (S[0:(N-1)//2] == S[0:(N-1)//2:-1]) and (S[(N+3)//2-1:] == S[(N+3)//2-1::-1]):\n print('Yes')\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s144634526', 's466152934', 's372527435'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 19.0] | [164, 164, 167] |
p02730 | u913662443 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input().strip('\\n')\nS1=S[:(len(S)-1)//2]\nS2=S[(len(S)-1)//2+1:]\nflag=True\nfor i in range(len(S)//2//2):\n print(S1[i]+S1[-i-1]+S2[i]+S2[-i-1])\n if S1[i]!=S2[-i-1] or S1[i]!=S1[-i-1] or S2[i]!=S2[-i-1]:\n flag=False\nprint('Yes' if flag else 'No')", "S = input().strip('\\n')\nS1=S[:(len(S)-1)//2... | ['Wrong Answer', 'Accepted'] | ['s534272960', 's939329144'] | [3064.0, 3064.0] | [17.0, 18.0] | [260, 283] |
p02730 | u915879510 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['def isPalindrome(s):\n print(s)\n n=len(s)\n i=0\n while(i<=(n-1)/2):\n if s[i]==s[-(i+1)]:\n i+=1\n else:\n return False\n return True\n\ns=input()\nn=len(s)\n\nleft = s[:(n-1)//2]\nright = s[(n+3)//2-1:]\n\nif isPalindrome(left) and isPalindrome(right):\n if left==right:\n print("Yes")\n e... | ['Wrong Answer', 'Accepted'] | ['s720841775', 's027859315'] | [3064.0, 3064.0] | [17.0, 17.0] | [339, 332] |
p02730 | u919681556 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['num=str(input())\ntemp=num\nrev=0\nwhile(num>0):\n dig=num%10\n rev=rev*10+dig\n num=num//10\nif(temp==rev):\n print("Yes")\nelse:\n print("No")', 'x = "malayalam"\nw = "" \nfor i in x: \n w = i + w \n if (x==w): print("YES")\n else: print("NO")', 'x = input()\nw = "" \nfor i in x: \n w = i... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s139558692', 's148168549', 's198303470', 's552268876', 's612752210'] | [3060.0, 2940.0, 2940.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 18.0, 19.0] | [149, 101, 85, 239, 257] |
p02730 | u920204936 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S = input()\nn = len(S)\nisKaibun = True\nfor i in range(n//2):\n if(S[i] != S[n-i-1] or S[i] != S[n//2-i-1] or S[n//2+i+a1] != S[n//2-i-1]):\n isKaibun = False\n break\nif(isKaibun):\n print("Yes")\nelse:\n print("No")', 'S = input()\nn = len(S)\nisKaibun = True\nfor i in range(n//2):\n if(... | ['Runtime Error', 'Accepted'] | ['s569628130', 's234610885'] | [3060.0, 3060.0] | [18.0, 17.0] | [232, 231] |
p02730 | u922172470 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["str = input()\nn = len(str)\nstr_list = list(str)\n\nfor i in range(0,n//2):\n if str_list[i] != str_list[n//2-i-1]:\n print('No')\n return\n\nfor j in range(n//2+1,n):\n if str_list[i] != str_list[-i-1]:\n print('No')\n return\n\nprint('Yes')", "str = input()\nn = len(str)\nstr_list... | ['Runtime Error', 'Accepted'] | ['s293227203', 's665348536'] | [3060.0, 3064.0] | [18.0, 17.0] | [263, 318] |
p02730 | u923270446 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s = list(input())\nn = len(s)\ns1 = s[0:(n-1)//2]\ns2 = s[(n+3)//2-1:n]\nprint(s,s1,s2)\nS = []\nS1 = []\nS2 = []\ni = -1\nj = -1\nk = -1\nwhile i >= n * -1:\n S.append(s[i])\n\n i -= 1\nwhile j >= len(s1) * -1:\n S1.append(s1[j])\n j -= 1\nwhile k >= len(s2) * -1:\n S2.append(s2[k])\n k -= 1\nif s ... | ['Wrong Answer', 'Accepted'] | ['s395565702', 's784722202'] | [3064.0, 3064.0] | [17.0, 17.0] | [367, 353] |
p02730 | u925658709 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["import xgboost as xgb\nfrom sklearn.model_selection import GridSearchCV\nimport math\nimport pandas as pd\nimport numpy as np\nimport matplotlib\nimport matplotlib.pyplot as plt\nimport seaborn as sns # pip install seaborn\nimport re\nimport statsmodels.api as sm\nimport statsmodels.formula.api as smf\nfrom sklearn.... | ['Runtime Error', 'Accepted'] | ['s818113021', 's847995750'] | [3064.0, 3064.0] | [18.0, 18.0] | [660, 357] |
p02730 | u929996201 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['string = input()\nmid = len(s)//2\n\ngnirts = reversed(string)\nprint(gnirts)\nif(string != gnirts or string[:mid-1] != gnirts[mid+1:] or string[mid+1:] != gnirts[:mid-1]):\n print("No")\n exit()\nprint("Yes")', 'string = input()\nmid = len(string)//2\n\ngnirts = string[::-1]\nif(string != gnirts or string[:mid] !=... | ['Runtime Error', 'Accepted'] | ['s917690823', 's599356457'] | [9024.0, 9048.0] | [22.0, 28.0] | [203, 186] |
p02730 | u931394483 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['import math\ns = str(input())\nm = (len(s) - 1) / 2\nc = True\nfor i in range(math.floor(m / 2)):\n if s[i] != s[int(m-1-i)]:\n c = False\nfor i in range(math.floor(m / 2)):\n if s[int(m+1+i)] != s[int(len(s)-1-i)]:\n c = False\nfor i in range(math.floor(m)):\n if s[i] != s[int(math.floor(len(s... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s637189368', 's676239942', 's525762575'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [377, 377, 379] |
p02730 | u932868243 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s=input()\nn=len(s)\nif s[:(n-1)/2-1]==s[:(n-1)/2-1][::-1] and s==s[::-1]:\n print('Yes')\nelse:\n print('No')", "s=input()\nn=len(s)\nif s[:(n-1)//2]==s[:(n-1)//2][::-1] and s==s[::-1]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s092653973', 's845126527'] | [2940.0, 2940.0] | [17.0, 18.0] | [107, 105] |
p02730 | u932937501 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S=input()\nn=len(S)\nflag=0\nS1=S[0:(n-1)//2-1]\nS2=S[(n+3)//2+1:]\nif S1==S1[::-1] and S2==S2[::-1]:\n pass\nelse:\n flag=1\nprint('Yes' if flag==0 else 'No')", "S=input()\nn=len(S)\nflag=0\nS1=S[0:(n-1)//2]\nS2=S[(n+2)//2:]\nif S1==S1[::-1] and S2==S2[::-1] and S==S[::-1]:\n pass\nelse:\n flag=1\nprint(... | ['Wrong Answer', 'Accepted'] | ['s605918884', 's809243622'] | [3060.0, 3060.0] | [17.0, 17.0] | [156, 167] |
p02730 | u935558307 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["import math\nimport sys\n\ns = input()\nn= len(s)\n\n\n\nend = n\nfor i in range(end):\n head = s[i]\n tail = s[end-i-1]\n if head != tail:\n print('No')\n sys.exit()\n \n\nend = int((n-1)/2)\nfor i in range(end):\n head = s[i]\n tail = s[end-i-1]\n if head != tail:\n print('No')\n sys.exit()\n\n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s674925063', 's704550306', 's809445922', 's130971772'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0, 19.0] | [568, 568, 577, 581] |
p02730 | u936285815 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["s =input()\nl = len(s)\ns = list(s)\nrevs=s[::-1]\n\n\n\nif s[int((l-1)/2):] == s[:int((l-1)/2)] and s[:int((l+3)/2)] == revs[int((l+3)/2):] and s == revs:\n print('Yes')\nelse: \n print('No')\n", "s =input()\nl = len(s)\ns = list(s)\nrevs=s[::-1]\n\n\n\nif s[:int((l-1)/2)] == revs[-int((l-1)/2):] and s[int((l+... | ['Wrong Answer', 'Accepted'] | ['s527937176', 's705107292'] | [2940.0, 2940.0] | [17.0, 17.0] | [189, 194] |
p02730 | u938051273 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['import math\n\ndef jds(strin):\n js = 0\n newSt = strin[::-1]\n if strin == newSt:\n js +=1\n return js\n \na = input()\njud = 0\n\nleee = len(a)\n\nif leee % 2 == 0:\n b = a[:math.ceil((len(a) - 1) / 2)]\n c = a[math.floor((len(a) + 1) / 2):]\nelse:\n b = a[:int((len(a) - 1) / 2)]\n c ... | ['Wrong Answer', 'Accepted'] | ['s281866530', 's553723420'] | [3064.0, 3064.0] | [17.0, 17.0] | [425, 426] |
p02730 | u938227748 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["def checkKaibun(str):\n if len(str) % 2 == 1:\n return False\n for i in range(int((len(str) - 1) / 2)):\n if str[i] != str[-i - 1]:\n return False\n return True\n \ns = input()\nn = len(s)\nc2e = int((n - 1) / 2)\nc3s = int((n + 3) / 2) - 1\nif not checkKaibun(s):\n print('No')\neli... | ['Wrong Answer', 'Accepted'] | ['s285157648', 's882272173'] | [3064.0, 3064.0] | [17.0, 17.0] | [420, 384] |
p02730 | u938718404 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['s=input()\nsl=list(reversed(s))\nns="".join(list(reversed(s)))\nk=(len(s)-1)/2\nt=s[:k]\ntl=list(reversed(t))\nnt="".join(list(reversed(t)))\nn=(len(s)+3)/2\nr=s[n-1:len(s)]\nrl=list(reversed(r))\nnr="".join(rl)\nif s==ns and t==nt and r==nr:\n print("Yes")\nelse:\n print("No")', 's=input()\nsl=list(reversed(s)... | ['Runtime Error', 'Accepted'] | ['s210142347', 's488158997'] | [3064.0, 3064.0] | [18.0, 17.0] | [270, 280] |
p02730 | u939026953 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['S = input()\nN = len(S)\nA = int((N - 1) / 2)\nB = int((A - 1) / 2)\nX = 0\n\nfor i in range(A):\n if S[i] != S[-i-1]:\n X += 1\n\nif N == 5:\n if S[0] != S[1]:\n X += 1\n\nif N >= 7:\n for i in range(B):\n \tif S[i] != S[A-1]:\n \tX += 1\n \nif X == 0:\n print("Yes")\nelse:\n print("No")', 'S = i... | ['Runtime Error', 'Accepted'] | ['s592109308', 's281565330'] | [2940.0, 3064.0] | [17.0, 17.0] | [285, 289] |
p02730 | u939633554 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ['L = int(input())/3\nprint(L**3)', 's = input()\nif s == s[::-1]:\n flag = True\nelse:\n flag = False\nN = len(s)\nif flag:\n new = s[0:int((N-1)/2)]\n if new == new[::-1]:\n flag = True\n else: flag = False\n\nif flag:\n new = s[int((N+2)/2):N]\n if new == new[::-1]:\n flag = True\n... | ['Runtime Error', 'Accepted'] | ['s902544992', 's442229508'] | [2940.0, 3064.0] | [17.0, 17.0] | [30, 346] |
p02730 | u940533000 | 2,000 | 1,048,576 | A string S of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * S is a palindrome. * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome. * The string consisting of the (N+3)/2-st through N-th... | ["S = input()\nN = len(S)\n\ntmp1, tmp2 = [], []\nflag = 0\nfor i in range(int((N-1)/2)):\n tmp1.append(S[i])\nfor i in range(int((N+3)/2)):\n tmp2.append(S[-1-i])\n#print(tmp1, tmp2)\nif tmp1 == tmp2:\n flag = 1\n \nif flag == 1:\n print('Yes')\nelse:\n print('No')", "S = input()\nN = len(S)\n\ntmp1, tmp2 = [], ... | ['Wrong Answer', 'Accepted'] | ['s302463661', 's174135917'] | [3064.0, 3188.0] | [18.0, 20.0] | [254, 255] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.