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 | u553855746 | 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\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**6)\n\n\n############ ---- Input Functions ---- ############\ndef in_int():\n return (int(input()))\n\n\ndef in_list():\n return (list(map(int, input().split())))\n\n\ndef in_str():\n s = input()\n return (list(s[:len(s) - 1]))\n\n\ndef in_i... | ['Wrong Answer', 'Accepted'] | ['s628302405', 's862556975'] | [3064.0, 3064.0] | [18.0, 17.0] | [662, 662] |
p02730 | u554129261 | 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\n\ndef reverse(text):\n return text == ''.join(list(reversed(text)))\n\n\nN = len(s)\n\nif reverse(s) and reverse(s[:(N-1)/2]) and reverse(s[(N+3)/2 - 1:]):\n print('Yes')\nelse:\n print('No')", "s = input()\n\n\ndef reverse(text):\n return text == ''.join(list(reversed(text)))\n\n\nN = len(... | ['Runtime Error', 'Accepted'] | ['s871488093', 's966944470'] | [3060.0, 3060.0] | [18.0, 18.0] | [203, 213] |
p02730 | u556672233 | 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\n\ndef f(s):\n n = len(s)\n if n % 2 == 0:\n return s[:n // 2] == s[n // 2:]\n else:\n return s[:n // 2] == s[n // 2 + 1:]\n\n\nif f(s) and f(s[:(n - 1)//2 + 1]) and f(s[(n + 3) // 2 - 1:]):\n print('Yes')\nelse:\n print('No')\n", "s = input()\nn = len(s)\n\n\nde... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s288789311', 's593764531', 's272810460'] | [2940.0, 3060.0, 3060.0] | [19.0, 18.0, 17.0] | [267, 303, 307] |
p02730 | u559250296 | 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 copy\nS = list(input())\nN = len(S)\nReS = copy.copy(S)\no = 1\nfor i in S:\n ReS[N-o] = i\n o += 1\nif S == reversed(S):\n print("Yes")\nif S == ReS:\n if S[0:int((N-1)/2)] == ReS[int((N+1)/2): N]:\n if S[int(N+1/2): N] == ReS[0:int((N-1)/2)]:\n print("Yes")\n else:\n ... | ['Wrong Answer', 'Accepted'] | ['s744805205', 's122107026'] | [3444.0, 3444.0] | [27.0, 22.0] | [378, 380] |
p02730 | u563838154 | 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 n%2==0:\n print("No")\nelse:\n a = s[:int((n-1)/2)]\n b = s[int((n+1)/2):]\n x = a[::-1]\n y = b[::-1]\n print(a)\n print(b)\n\n l = (n+1)/4\n # print(l)\n c = 0\n for i in range(int(l)):\n if (a[i]!=x[i])or (b[i]!=y[i]):\n print("No"... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s006870752', 's012241284', 's004914486'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [373, 372, 462] |
p02730 | u569117803 | 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 = "Yes"\nhalf = int((n -1) / 2)\nhalf2 = int((n+2)/2)\na = s[:half]\na_2 = s[half+1:n]\na_2 = a_2[::-1]\nprint(a, a_2)\nif a != a_2:\n ans = "No"\nelse:\n if (len(a)%2) == 0:\n a_half = int(len(a)/2)\n a_3 = a[0:a_half]\n a_4 = a[a_half:len(a)]\n a_4 = a_... | ['Wrong Answer', 'Accepted'] | ['s867888896', 's049853222'] | [3064.0, 3064.0] | [17.0, 18.0] | [925, 867] |
p02730 | u570944601 | 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();print("YNeos"[S==S[::-1]and S.endswith(S[:len(S)//2])::2])', 'S = input()\nN = len(S)\nisPal = lambda s: s == s[::-1]\nprint("Yes" if isPal(S[:(N-1)//2]) and isPal(S[(N-1)//2:]) else "No")', 'S=input();print("YNeos"[S!=S[::-1]or 1-S.endswith(S[:len(S)//2])::2])'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s334327683', 's648259316', 's135168968'] | [3060.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [68, 123, 69] |
p02730 | u574565611 | 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 = map(str,input().split())\nN = int(len(S))\nS_a = S[:(N-1)//2]\nS_b = S[(N+1)//2:]\n\nif S == S[::-1] and S_a == S_a[::-1] and S_b == S_b[::-1]:\n print("Yes")\nelse:\n print("No")', 'S = input()\nN = int(len(S))\nS_a = S[:(N-1)//2]\nS_b = S[(N+3)//2:]\n#print(S)\nif S == S[::-1] and S_a == S_a[::-1] and S_b... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s484409700', 's716277595', 's794028113'] | [3060.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0] | [181, 173, 173] |
p02730 | u578647703 | 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 copy import copy\n\nS = input()\nSlist = []\npar = []\nrap = []\n\nfor s in S:\n Slist.append(s)\n\nif len(Slist)==3:\n if Slist==list(reversed(Slist)):\n print("Yes")\n else:\n print("No")\nelse:\n par = copy(Slist)\n rap = copy(Slist)\n rap = list(reversed(rap))\n print(par)\... | ['Wrong Answer', 'Accepted'] | ['s240398551', 's792922400'] | [3444.0, 3444.0] | [22.0, 22.0] | [903, 789] |
p02730 | u580697892 | 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... | ['# coding: utf-8\nS = input()\ndef check(S):\n ret = True\n for i in range(len(S)//2):\n if S[i] != S[-i-1]:\n ret = False\n return ret\nif len(S) == 3:\n if S[0] != S[-1]:\n print("No")\n else:\n print("Yes")\n exit()\nflag = True\nif not check(S):\n flag = False\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s482992486', 's522824258', 's976471968'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0] | [431, 331, 431] |
p02730 | u581603131 | 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... | ['akasaka', "S = list(str(input()))\nN = len(S)\na = 0\nnewS = list(reversed(S))\nif S == newS:\n a += 1\n\nleft = []\nfor i in range(0,int((N-1)/2)): \n left += S[i]\nnewleft = list(reversed(left))\nif left == newleft:\n a += 1\n\nright = []\nfor i in range(0,int((N-1)/2)): \n right += S[-i-1]\nnewrigh... | ['Runtime Error', 'Accepted'] | ['s877050018', 's130685031'] | [2940.0, 3064.0] | [17.0, 17.0] | [7, 469] |
p02730 | u583507988 | 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\nm = []\nfor i in s:\n m.append(i)\nn = len(s)\nn1 = int((n-1)/2)\nn2 = int((n+3)/2)\n\nfor i in range(n1):\n if m[i] != m[n-1-i]:\n print('No')\n break\n else:\n if m[i] != m[n1-1-i]:\n print('No')\n break\n else:\n if m[n2-1+i] != m[n-1-i]:\n print('No')\n b... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s619563271', 's676166392', 's887273088', 's211970329'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 18.0] | [335, 333, 333, 377] |
p02730 | u586244382 | 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... | ['# coding: utf-8\n# Your code here!\ns = input()\ns1 = s[::-1]\nl=len(s)\nprint(l)\ncheck = 0\nif(s==s1):\n if(s[0:int((l-1)/2)] == s1[0:int((l-1)/2)]):\n if(s[int((l+3)/2):l] == s[int((l+3)/2):l]):\n print("Yes")\n check =1\nif(check ==0):\n print("No")\n\n', '# coding: utf-8\n# You... | ['Wrong Answer', 'Accepted'] | ['s343649527', 's918535676'] | [3064.0, 3064.0] | [17.0, 18.0] | [277, 274] |
p02730 | u592035627 | 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 = list(input())\nA1 = reversed(A)\n\nB = A[0:(len(A)-1)/2-1]\nB1 = reversed(B)\n\nC = A[(len(A)+3)/2-1:-1]\nC1 = reversed(C)\n\nif A == A1 and B == B1 and C == C1:\n print("Yes")\nelse:\n print("No")', 'A = list(input())\nA1 = list(reversed(A))\n#print((len(A)-1)/2-1)\n \nB = A[:(len(A)-1)//2]\nB1 = list(reve... | ['Runtime Error', 'Accepted'] | ['s248348332', 's517053935'] | [3064.0, 3064.0] | [17.0, 17.0] | [195, 236] |
p02730 | u595375942 | 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)\nN1 = (N-1)//2\nN2 = (N+3)//2\n\nfor s1, s2 in zip(S, S[::-1]):\n if s1 != s2:\n print('No')\n exit()\n else:\n continue\n\nfor s1, s2 in zip(S[0:N1+1], S[N1+1:0:-1]):\n if s1 != s2:\n print('No')\n exit()\n else:\n continue\n\nfor s1, s2 i... | ['Wrong Answer', 'Accepted'] | ['s482889807', 's086940414'] | [3064.0, 3064.0] | [18.0, 17.0] | [423, 421] |
p02730 | u595952233 | 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)\ndef is_kai(s):\n for i in range(int(len(s)/2)):\n if s[i] != s[-i-1]:\n return False\n return True\nif is_kai(s) and is_kai(s[:int((n-1)/2)]) and is_kai(s[int((n+3)/2):]):\n print('Yes')\nelse:\n print('No')", "s = input()\nn = len(s)\ndef is_kai(s):\n for... | ['Wrong Answer', 'Accepted'] | ['s599060395', 's742469933'] | [3060.0, 3060.0] | [17.0, 17.0] | [256, 225] |
p02730 | u597455618 | 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)\nfs = s[:(n-1)//2]\nes = s[(n+3)//2-1:]\nprint((n-1)//2, (n+3)//2-1)\nif s == s[::-1] and fs == fs[::-1] and es == es[::-1]:\n print("Yes")\nelse:\n print("No")', 's = input()\nn = len(s)\nfs = s[:(n-1)//2]\nes = s[(n+3)//2-1:]\nif s == s[::-1] and fs == fs[::-1] and es == es[::-1]:\n ... | ['Wrong Answer', 'Accepted'] | ['s419571108', 's564739359'] | [3060.0, 3060.0] | [17.0, 17.0] | [182, 154] |
p02730 | u597626771 | 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)\ni = 0\n\nif S[:int((l-1)/2)] == S[int((l+1)/2)]:\n while i < (l-1)/2:\n if S[i] != S[-i-1]:\n print('No')\n break\n i = i + 1\n else:\n print('Yes')\nelse:\n print('No')\n ", "S = input()\nl = len(S)\ni = 0\n\nwhile i < (l-1)/2:\n if S... | ['Wrong Answer', 'Accepted'] | ['s007703311', 's236682335'] | [3060.0, 3060.0] | [17.0, 17.0] | [238, 179] |
p02730 | u600261652 | 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()\nFi = S[:N--1//2]\nSe = S[N+3/2:N+1]\nSS = S[::-1]\nFiFi = Fi[::-1]\nSeSe = Se[::-1]\nprint("Yes" if S == SS and Fi == FiFi and Se == SeSe else "No")', 'S = input()\nN = len(S)\nFi = S[:N--1//2]\nSe = S[N+3/2:N+1]\nSS = S[::-1]\nFiFi = Fi[::-1]\nSeSe = Se[::-1]\nprint("Yes" if S == SS and Fi == FiFi and S... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s151329485', 's200058107', 's341901556', 's882840574', 's648130011'] | [3060.0, 3064.0, 3060.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0, 17.0, 18.0] | [155, 166, 150, 154, 141] |
p02730 | u602188782 | 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... | ['# -*- coding: utf-8 -*-\ndef Palindrome(S):\n if len(S)==1:\n return "Yes"\n for i in range(int((len(S)-1)/2)):\n if S[i]==S[len(S)-i-1]:\n YorN="Yes"\n else:\n YorN="No"\n break\n return YorN\nS = input()\nSl = list(S)\nleft = right = "No"\nif Palindrome... | ['Runtime Error', 'Accepted'] | ['s464686369', 's030373329'] | [3064.0, 3064.0] | [17.0, 18.0] | [548, 547] |
p02730 | u602773379 | 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)\n\ns1=S[:(N-1)/2]\ns2=S[(N+3)/2:]\n\nif s1==s2:\n\tprint("Yes")\nelse:\n\tprint("No")', 'S = str(input())\n\nN=len(S)\n\ns1=S[:int((N-1)/2)]\ns2=S[int((N+3)/2-1):]\n\nprint(s1,s2)\nif s1==s2:\n\tprint("Yes")\nelse:\n\tprint("No")', 'S = str(input())\n\nN=len(S)\n\ns1=S[:int((N-1)/2)]\ns2=... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s334638065', 's846619846', 's888165339'] | [2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0] | [102, 127, 153] |
p02730 | u606146341 | 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 = int(input())\nn = len(s)\ns1 = s[0:(n-1)//2]\ns2 = s[(n +2)//2:n]\nif s == s[::-1] and s1 == s1[::-1] and s2 == s2[::-1]:\n print('Yes')\nelse:\n print('No')", "s = str(input())\nn = len(s)\ns1 = s[0:n//2]\ns2 = s[(n+2)//2:n]\nif s == s[::-1] and s1 == s1[::-1] and s2 == s2[::-1]:\n print('Yes')\nelse:\n... | ['Runtime Error', 'Accepted'] | ['s067511732', 's285481091'] | [3060.0, 3060.0] | [18.0, 18.0] | [160, 155] |
p02730 | u607074939 | 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(str(input()))\nn = len(s)\nN = int((n-1)/2)\nM = int((n+3)/2)\nl = []\nm = []\nfor i in range(N):\n l.append(s[i])\nfor i in range (M-1,N):\n m.append(s[i])\na = ''.join(l)\nb = ''.join(m)\nl.reverse()\nm.reverse()\nA = ''.join(l)\nB = ''.join(m)\nif (a==A and b==B and a == b):\n print('Yes')\nelse:... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s078287887', 's652421168', 's817854342'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 19.0] | [316, 364, 380] |
p02730 | u607729897 | 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] == S[N-((N-1)//2)::-1]:\n print('Yes')\nelse:\n print('No')\n", "S = input()\nN = len(S)\nif S[:(N−1)/2] == S[N-((N−1)/2)::-1]:\n print('Yes')\nelse:\n print('No')", "def kaibun(s):\n if s == s[::-1]:\n flg = True\n else:\n flg = False\n return flg\n\nS = input()\... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s552591113', 's788594766', 's571647322'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 18.0] | [98, 99, 288] |
p02730 | u608241985 | 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(r):\n if r == r[::-1]:\n return True\n\n\ndef main():\n s = input()\n n = len(s)\n print("Yes" if check(s) and check(s[:(n-1)//2])\n and check(s[((n-1)//2) + 1:]) else "No")\n\n\nif __name__ == "__main__":\n main()'] | ['Wrong Answer', 'Accepted'] | ['s776302488', 's239924882'] | [9084.0, 9064.0] | [30.0, 27.0] | [1, 242] |
p02730 | u609093494 | 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[:(n-1)//2-1]\nb = s[-(n+3)//2:]\n\nt = s[::-1]\nc = t[:(n-1)//2-1]\nd = t[-(n+3)//2:]\nif (a==d) and (b==c) :\n if(a==b):\n print('Yes')\nelse:\n print('No')\n", "s = input()\nn = len(s)\na = s[:(n-1)/2-1]\nb = s[-(n+3)/2:]\nlang:reverse.py\nt = s[::-1]\nc = t[:(n-1)/2-1]\nd = t[-(n+... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s554899313', 's756594230', 's768082904', 's830755871', 's037432408'] | [2940.0, 2940.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [180, 188, 189, 184, 187] |
p02730 | u612635771 | 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)\na = s[:(l-1)/2]\nb = len(a)\nprint("Yes" if s[:(l-1)/2] == s[(l+1)/2:] and a[:(b-1)/2] == a[(b+1)/2:] else "No")', 's = input()\nl = len(s)\na = s[0:(l-1)//2]\nb = len(a)\nprint("Yes" if s == s[::-1] and a == a[::-1] else "No")'] | ['Runtime Error', 'Accepted'] | ['s184921548', 's120609855'] | [9056.0, 9020.0] | [28.0, 30.0] | [133, 107] |
p02730 | u612895604 | 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 check_kai(arr):\n len_a = len(arr)\n check_len = int(math.ceil(len_a/2))\n lef = arr[0:check_len]\n arr.reverse()\n rig = arr[0:check_len]\n if lef == rig:\n return True\n else:\n return False\n\n\ninput = list(input())\nN = len(input)\n\nif check_kai(input) and c... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s292356898', 's547369726', 's017918998'] | [3064.0, 3064.0, 3188.0] | [17.0, 19.0, 19.0] | [413, 411, 411] |
p02730 | u613350811 | 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)\nzen = S[:int((N-1)/2)]\nkou = S[int((N+3)/2)-1:]\nif S = S[::-1] and zen == zen[::-1] and kou == kou[::-1]:\n print("Yes")\nelse:\n print("No")', 'S = input()\nN = len(S)\nzen = S[:int((N-1)/2)]\nkou = S[int((N+3)/2)-1:]\nif zen == zen[::-1] and kou == kou[::-1]\n print("Yes")\nelse:... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s461808078', 's807480423', 's030460859'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [167, 150, 168] |
p02730 | u614628638 | 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 = list(input())\na_re = reversed(a)\n\n\nif a == a_re:\n if len(a) % 2 == 0:\n b = a[0:len(a)]\n b_re = a_re[0:len(a)]\n b_re = reversed(b_re)\n if b == b_re:\n print('Yes')\n else:\n print('No')\n else:\n b = a[0:int(len(a)/2)]\n b_re = a_re[0:int(len(a))]\n b_re = reversed... | ['Wrong Answer', 'Accepted'] | ['s600642010', 's021040377'] | [3064.0, 3064.0] | [17.0, 17.0] | [393, 410] |
p02730 | u617037231 | 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 = input()\ndef is_palindrome(S):\n P = S[::-1]\n print(P)\n if S == P:\n return True\n return False\nif is_palindrome(S):\n N = len(S)\n if is_palindrome(S[0:(N-1)//2]) and is_palindrome(S[(N+3)//2-1:N]):\n print('Yes')\n sys.exit(0)\nprint('No')", "import sys\nS = input()\ndef is_palindr... | ['Wrong Answer', 'Accepted'] | ['s131559429', 's792556522'] | [3060.0, 3060.0] | [18.0, 17.0] | [262, 251] |
p02730 | u617718239 | 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()\nend = (len(s)-1)//2\nstart = (len(s)+3)//2\nif s[0:end] == s[end-1::-1]:\n if s[start-1::] == s[-1:start-2:-1]:\n if s[0::] == s[::-1]\n print("Yes")\n else:\n print("No")\n else:\n print("No")\nelse:\n print("No")', 's = input()\nend = (len(s)-1)//2\ns... | ['Runtime Error', 'Accepted'] | ['s118512425', 's380317918'] | [2940.0, 3064.0] | [17.0, 17.0] | [267, 268] |
p02730 | u618101737 | 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 solve(s):\n s = list(s)\n n = len(s)\n ans = check_palindrome(s) & check_palindrome(s[0:int(((n-1)//2))]) & check_palindrome(s[0:int(((n+3)//2))])\n return "Yes" if ans else "No"\n\n\ndef check_palindrome(st):\n a = list(st)\n b = list(reversed(st))\n return a == b\n\n\n\n\ns = str(input())\n# n, m = [int(... | ['Wrong Answer', 'Accepted'] | ['s102727972', 's519259070'] | [3060.0, 3060.0] | [17.0, 18.0] | [350, 350] |
p02730 | u619398783 | 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)\noutput = 'Yes'\nif n == 3:\n if s[:1] != s[2:]:\n output = 'No'\nelse:\n if s[:n%2] != s[n%2+2:]:\n output = 'No'\n else:\n if s[:n%4] != s[n-n%4:]:\n output = 'No'\nprint(output)\n", "s = input()\ndef kai(l):\n n = len(l)\n output = 'Yes'\n for i in range(n//2):\n if l... | ['Wrong Answer', 'Accepted'] | ['s375639606', 's002948605'] | [2940.0, 3064.0] | [18.0, 17.0] | [210, 253] |
p02730 | u620282458 | 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)\ns1=s[:n//2]\ns2=s[n//2+1:]\ntest =True\nif(s!=s[::-1]):\n\ttest=False\nif (s1!=s1[::-1]):\n\ttest=False\nif(s2!=s2[::-1]):\n\ttest=False\nif(test==True):\n\tprint("YES")\nelse:\n\tprint("NO")', 's=input()\nn=len(s)\ns1=s[:n//2]\ns2=s[n//2+1:]\ntest =True\nif(s!=s[::-1]):\n\ttest=False\nif (s1!=s1... | ['Wrong Answer', 'Accepted'] | ['s057345153', 's257908866'] | [3064.0, 3064.0] | [17.0, 17.0] | [193, 193] |
p02730 | u622847899 | 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 judge_palindrome(x):\n\tfor i in range(len(x)//2):\n\t\tif x[i]!=x[-i-1]:\n\t\t\treturn False\n\treturn True\n\nif judge_palindrome(s) and judge_palindrome(s[:int((len(s)-1)/2)]) and judge_palindrome(s[int((len(s)+3)/2):]):\n\tprint('Yes')\nelse:\n\tprint('No')", "s=input()\n\ndef judge_palindrome(x)... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s357994400', 's699506475', 's825158134', 's946520050', 's825972099'] | [3060.0, 3064.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 18.0, 17.0] | [258, 346, 233, 294, 253] |
p02730 | u623601489 | 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[-1 - i]:\n print("No")\n exit()\nif s[:(n + 1) // 2] == s[(n + 3) // 2:]:\n print("Yes")\nelse:\n print("No")\n', 's = input()\nn = len(s)\nfor i in range(n):\n if s[i] != s[-1 - i]:\n print("No")\n exit()\nif s[:(n - 1... | ['Wrong Answer', 'Accepted'] | ['s995363447', 's467657971'] | [3064.0, 3188.0] | [17.0, 18.0] | [183, 183] |
p02730 | u624613992 | 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\ns_norm = list(s)\ns_rev = reversed(s)\nif s_norm == s_rev:\n s_len = len(s)\n second = (s_len -1)/2\n s_new = s_norm[0:second]\n s_new_rev = reversed(s_new)\n if s_new == s_new_rev:\n third = (s_len +3)/2\n s_last = s_norm[third:s_len+1]\n s_last_rev = reversed(s_new... | ['Wrong Answer', 'Accepted'] | ['s794505778', 's942707735'] | [3064.0, 3064.0] | [18.0, 18.0] | [457, 491] |
p02730 | u626228246 | 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)-1)//2\nM = (len(S)+3)//2\ncount = 0\n\nif S[::-1] == S:\n if S[:N] == S[::-N]:\n if S[:M] == S[::-M]:\n count += 1\nprint("Yes" if count == 1 else "No")', 'S = input()\nN = (len(S)-1)//2\nM = (len(S)+3)//2\ncount = 0\n\nif S[::-1] == S:\n if S[:N] == S[:N][::-1]:\n if S[:M] == S[... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s220877878', 's642112122', 's732068058', 's749435383'] | [3060.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [177, 186, 186, 193] |
p02730 | u626881915 | 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)\nmae = (n-1)//2\nusiro = (n+3)//2\n\nfor i in range(mae):\n if s[i] != s[mae-1-i]:\n print("No")\n exit()\n \nfor i in range(usiro-1, n):\n if s[i] != s[n-1+usiro-i]:\n print("No")\n exit()\nprint("Yes")', 's = input()\nn = len(s)\nmae = (n-1)//2\nusiro = (n+3)//2\n\nfor i in ... | ['Runtime Error', 'Accepted'] | ['s806129620', 's135208526'] | [3064.0, 3060.0] | [17.0, 18.0] | [230, 257] |
p02730 | u629540524 | 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()\nx = len(s) // 2 + 1\nb = s[:len(s) // 2 + 1]\nc = s[len(s) // 2:]\n\nif b == b[::-1] and c == c[::-1]:\n print('Yes')\nelse:\n print('No')", 'S = input()\nN = len(S)\nS1 = S[0:(N-1)//2]\nS2 = S[(N+3)//2-1:N+1]\nprint("Yes" S1 == S1[::-1] and S2 == S2[::-1] else "No")', "s = input()\na = s[:len(s) ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s364048998', 's406585304', 's395149458'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [149, 122, 146] |
p02730 | u634282234 | 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:int((N-1)/2)]\nb=S[int((N+3)/2-1):int((N))]\n\nc=list(a)\nd=sorted(c,reverse=True)\n\ne=list(b)\nf=sorted(e,reverse=True)\n\nif a==b and c==d and e==f:\n print('Yes')\nelse:\n print('No') \n", "S = input()\nN = len(S)\na=S[0:int((N-1)/2)]\nb=S[int((N+3)/2-1):int((N))]\n\nc=list(... | ['Wrong Answer', 'Accepted'] | ['s106807839', 's432425801'] | [3064.0, 3064.0] | [17.0, 17.0] | [214, 204] |
p02730 | u636665812 | 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 judge(s):\n inv_str = s[::-1]\n print(inv_str)\n if(s == inv_str):\n return 0\n else:\n return 1\n\nx = str(input())\nlen = len(x)\nx1 = x[:int((len-1)/2)]\nx2 = x[int((len+3)/2-1):]\n\nif(judge(x1)==0 and judge(x2)==0):\n print("Yes")\nelse:\n print("No")', 'def judge(s):\n inv... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s058425064', 's346503910', 's984221907'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [276, 292, 294] |
p02730 | u638801031 | 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 bisect import *\nfrom collections import *\nfrom itertools import *\nimport functools\nimport sys\nimport math\nfrom decimal import *\nfrom copy import *\nfrom heapq import *\nfrom fractions import *\ngetcontext().prec = 30\nMAX = sys.maxsize\nMAXN = 50010\nMOD = 10**9+7\nspf = [i for i in range(MAXN)]\nspf[0]=s... | ['Wrong Answer', 'Accepted'] | ['s933569795', 's711203797'] | [7320.0, 7188.0] | [43.0, 42.0] | [1417, 1419] |
p02730 | u640922335 | 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='Yes'\nif N==3:\n S[0]!=S[2]:\n ans='No'\nelse:\n if int((N-1)/2)%2==1:\n for i in range((N-3)//4):\n if S[i] != S[((N-3)//2)-i] or S[((N+1)//2)+i] != S[N-i-1]:\n ans='No'\n else:\n for i in range((N-1)//4):\n if S[i] != S[((N-3)//2... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s273038221', 's867024475', 's963953509'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [379, 374, 376] |
p02730 | u641393644 | 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 check(s):\n if len(s) == 1 or len(s) == 0:\n return True\n if s[0]!=s[-1]:\n return False\n return check(s[1:-1])\n\nmid = len(s)//2\n\nif check(s) and check(s[0:mid]) and check(s[mid:]):\n print("Yes")\nelse:\n print("No")\n', 's = input()\nif s == s.reverse():\n print("Yes")\nelse:\n ... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s028468521', 's157577049', 's847592624', 's882508052', 's179570007'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 17.0] | [240, 67, 130, 91, 242] |
p02730 | u642418876 | 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 x==x[::-1]\nS=str(input())\nN=len(S)\nS1=S[:(N-1)//2]\nS2=S[(N+1)//2:]\nif f(S) and f(S1) and f(S2):\n print('Yes')\nelse:\n print('No')\n ", 'S=input()\nN=len(S)\nX=(int(N)-1)/2\nY=(int(N)+3)/2\nT=S(range(1,X))\nU=S(range(Y,N))\nif str(S)==str(S)[::-1] and str(T)==str(T)[::-1] and str(U)==str(U)[::-1... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s028032007', 's095960208', 's317894383', 's449934810', 's707070341', 's053522025'] | [2940.0, 3064.0, 3060.0, 2940.0, 3064.0, 2940.0] | [18.0, 19.0, 17.0, 17.0, 17.0, 17.0] | [145, 193, 184, 150, 192, 152] |
p02730 | u645538982 | 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,M=map(int,input().split())\na=N\na=a*(N-1)/2\nb=M*(M-1)/2\n\n\n\nprint(int(a+b))\n', 'S=input()\nN=len(S)\n\na=S[0:(int((N-1)/2))]\nb=S[(int((N+3)/2)-1):(N)]\n\nif a==b:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s058613222', 's717582841'] | [2940.0, 2940.0] | [17.0, 17.0] | [76, 117] |
p02730 | u645581835 | 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()\nw = "" \nfor i in x: \n w = i + w \n if (x==w): \n print("Yes")\n\telse:\n \tprint("No")', 'def palindrom(st):\n return st == st[::-1]\nimport math\ns = input()\nl = len(s)\nprint("Yes" if palindrom(s) and palindrom(s[:(l-1)//2]) and palindrom(s[(l+2)//2:]) else "No")'] | ['Runtime Error', 'Accepted'] | ['s125632192', 's296973485'] | [2940.0, 3060.0] | [17.0, 19.0] | [110, 174] |
p02730 | u646412443 | 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()\ndef isPalindrome(string):\n return s == s[::-1]\nif isPalindrome(s) and isPalindrome(s[:len(s)//2]) and isPalindrome(s[len(s)//2+1:]):\n print('Yes')\nelse:\n print('No')\n", "def kaibun(s):\n return s == s[::-1]\ns = input()\nn = len(s)\nif kaibun(s) and kaibun(s[:(n-1)//2]):\n print('Yes'... | ['Runtime Error', 'Accepted'] | ['s710360284', 's511442830'] | [2940.0, 2940.0] | [18.0, 17.0] | [186, 140] |
p02730 | u648144864 | 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)\nl = (n - 1)\nr = (n + 3)\nif s == s[::-1] and s[0:l] == s[0:l][::-1] and s[r-1:n] == s[r-1:n][::-1]:\n print('Yes')\nelse:\n print('No')", "\ns = input()\nn = len(s)\n\nl = (n - 1) // 2\nr = (n + 3) // 2\n\nif s == s[::-1] and s[0:l] == s[0:l][::-1] and s[r-1:n] == s[r-1:n][::-1]:\n ... | ['Wrong Answer', 'Accepted'] | ['s717245987', 's924883884'] | [3060.0, 3060.0] | [17.0, 17.0] | [160, 181] |
p02730 | u651732093 | 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\na=s[::-1]\nprint(a)\n\nmae=(a[0:int((n-1)/2)])\nprint(mae)\n\nmaer=(mae[::-1])\nprint(maer)\n\nato=(a[int((n+2)/2):])\nprint(ato)\n\nator=(ato[::-1])\nprint(ator)\n\nif a==s :\n if mae==maer and ato==ator:\n print("Yes")\n else :\n print("No")\n \n\nelse :\n prin... | ['Wrong Answer', 'Accepted'] | ['s752861402', 's685784174'] | [3064.0, 3188.0] | [17.0, 20.0] | [298, 249] |
p02730 | u652081898 | 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(s: str, n: int):\n return s[:int((n-1)/2)] == s[int((n+1)/2):][::-1]\n\n\ns = input()\nn = len(s)\n\nprint(check(s, n))\nprint(check(s[:int((n-1)/2)], (n-1)/2))\nprint(check(s[int((n+1)/2):], (n-1)/2))\nif check(s, n) and check(s[:int((n-1)/2)], (n-1)/2) and check(s[int((n+1)/2):], (n-1)/2):\n print("... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s575363113', 's908783313', 's497194727'] | [3064.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [334, 133, 144] |
p02730 | u652907854 | 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 checkPal(s):\n w = s\n w[::-1]\n if w==s:\n return True\n return False\ns = input()\nif checkPal(s[:(n//2)]) and checkPal(s) and checkPal(s[(n//2)+1:]:\n print("Yes")\nelse:\n print("No")', 'def checkPal(s):\n if s[::-1]==s:\n return True\n return False\ns = input()\nn = len(s)\nif checkPal(s[:(n//2... | ['Runtime Error', 'Accepted'] | ['s011105509', 's232847344'] | [2940.0, 3060.0] | [18.0, 18.0] | [190, 190] |
p02730 | u658915215 | 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... | ["for i in range(1,n1+1):\n if s[i-1]!=s[-i] or s1[i-1]!=s1[-i]:\n print('No')\n exit()\nprint('Yes')", "s=input()\nn=len(s)\nn1=(n-1)//2\nn2=(n+3)//2\ns1=s[:n1]\ns2=s[n2-1:]\n\nfor i in range(1,n1+1):\n if s[i-1]!=s[-i]:\n print('No')\n exit()\nfor i in range(1,n1//2+1):\n if s1[i-... | ['Runtime Error', 'Accepted'] | ['s659344311', 's782934057'] | [9100.0, 9112.0] | [27.0, 28.0] | [112, 245] |
p02730 | u659302753 | 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 sys import stdin\n\n\ndef check_palindrome(str_):\n if str_ == str_[::-1]:\n return True\n return False\n\ndef get_result(data):\n S = data[0]\n right_idx = int((len(S) - 1) / 2)\n left_idx = int((len(S) + 3) / 2) - 1\n right_S = S[0:right_idx]\n left_S = S[left_idx:]\n if check_pal... | ['Wrong Answer', 'Accepted'] | ['s106384401', 's167294014'] | [3064.0, 3064.0] | [17.0, 18.0] | [543, 556] |
p02730 | u660899380 | 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... | ['wholeString = input()\nfirstSub = wholeString[0:int((len(wholeString)-1)/2)]\nsecondSub = wholeString[int(((len(wholeString)+3)/2)-1):]\n\nif len(wholeString) % 2 == 0 or len(wholeString) < 3 or len(wholeString) > 99:\n print("No")\nif firstSub == firstSub[::-1] and secondSub == secondSub[::-1] and wholString == who... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s096491431', 's844360489', 's447154442'] | [3064.0, 3060.0, 3064.0] | [18.0, 17.0, 18.0] | [362, 222, 363] |
p02730 | u666844906 | 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\nimport sys\nimport math\nflag1 = 0\nflag2 = 0\nflag3 = 0\n\nif S == S[::-1]:\n flag1 = 1\n print(1)\nelse:\n print('No')\n sys.exit()\n\nS1 = S[:(int((len(S) - 1)/2))]\nif S1 == S1[::-1]:\n flag2 = 1\n print(2)\nelse:\n print('No')\n sys.exit()\n\nS2 = S[int((len(S)+3)/2) ... | ['Wrong Answer', 'Accepted'] | ['s538121255', 's634710643'] | [3064.0, 3064.0] | [18.0, 17.0] | [447, 408] |
p02730 | u667084803 | 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[:(N-1)//2]\ns2 = S[(N+3)//2-1:]\n\nif S == S[::-1] and s1 == s1[::-1] and s2 == s2[::-1]:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\ns = str(N)\nn = 0\nfor i in s:\n n += int(i)\n \nif N%n==0:\n print("Yes")\nelse:\n print("No")', 'S = input()\nN = len(S)\ns1 = S[:(N-1)//2]\ns2... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s518762072', 's711680432', 's276130362'] | [3060.0, 2940.0, 3064.0] | [17.0, 18.0, 18.0] | [140, 108, 151] |
p02730 | u668923019 | 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)\nt = s[:(n - 1) // 2]\nu = s[(n + 3) // 2 - 1:]\nprint(t, u)\nif s == s[::-1] and t == t[::-1] and u == u[::-1]:\n print('Yes')\nelse:\n print('No')\n", "s = input()\nn = len(s)\nt = s[:(n - 1) // 2]\nu = s[(n + 3) // 2 - 1:]\nif s == s[::-1] and t == t[::-1] and u == u[::-1]:\n print... | ['Wrong Answer', 'Accepted'] | ['s170542044', 's461480819'] | [2940.0, 2940.0] | [18.0, 18.0] | [171, 159] |
p02730 | u669335047 | 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... | ['ostr = input()\n\nslist = list(ostr)\nlength = len(slist)\nhalf = length // 2\n\nflg1 = True\nflg2 = True\nflg3 = True\n\nlen2 = (length-1)//2\nlist2 = slist[:len2]\nhalf2 = len(list2) // 2\n\nlen3 = ((length+3)//2)-1\nlist3 = slist[len3:]\nhalf3 = len(list3) // 2\n\ndef judge(s, h):\n for i in range(1, h+1):\n ... | ['Wrong Answer', 'Accepted'] | ['s003486584', 's666291928'] | [3064.0, 3064.0] | [17.0, 17.0] | [498, 511] |
p02730 | u669729085 | 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; sys.setrecursionlimit(2147483647); input = sys.stdin.readline\nfrom math import floor, ceil, sqrt, factorial, log\nfrom collections import Counter, defaultdict, deque\nfrom operator import itemgetter\nINF = float('inf'); MOD = 10**9+7\ndef I(): return int(input())\ndef MI(): return map(int, input().split(... | ['Wrong Answer', 'Accepted'] | ['s756457431', 's938129621'] | [3316.0, 3316.0] | [21.0, 22.0] | [1807, 1811] |
p02730 | u669770320 | 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... | ["get = input()\nif get[:int((len(get)-1)/2)] == get[int(((len(get)+3)/2)-1):]:\n print('yes')\nelse:\n print('no')", "\nget = input()\nif get[:int((len(get)-1)/2)] == get[int(((len(get)+3)/2)-1):]:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s230213809', 's490250662'] | [2940.0, 2940.0] | [17.0, 17.0] | [115, 116] |
p02730 | u671889550 | 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[::-1]\nn = len(S)\na = s[:(N - 1) // 2]\nb = t[:(n + 3) // 2]\n\nif s == t and a == a[::-1] and b == b[::-1]:\n print('Yes')\nelse:\n print('No')", "s = input()\nt = s[::-1]\nn = len(s)\na = s[:(N - 1) // 2]\nb = t[:(n + 3) // 2]\n\nif s == t and a == a[::-1] and b == b[::-1]:\n print('Yes... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s264974145', 's310312903', 's537651866', 's848209219'] | [9096.0, 9052.0, 9024.0, 9008.0] | [31.0, 21.0, 30.0, 31.0] | [161, 161, 182, 161] |
p02730 | u674190122 | 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... | ['given = input()\nn = len(given)\nleft, rite = given[:(n - 1)//2], given[(n + 3)//2 - 1:]\nprint(left, rite)\nif given == given[::-1]:\n if left == left[::-1]:\n print("Yes")\n else:\n print("No")\n\n', 'given = input()\nn = len(given)\nleft, rite = given[:n//2], given[n//2+1:]\nprint("Yes" if left... | ['Wrong Answer', 'Accepted'] | ['s683109295', 's474961694'] | [2940.0, 2940.0] | [17.0, 17.0] | [209, 163] |
p02730 | u676359467 | 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.special import comb\n\ngusu, kisu = input().split()\ngusu = int(gusu) \nkisu = int(kisu) \ngusu_num = comb(gusu, 2, exact=True)\nkisu_num = comb(kisu, 2, exact=True)\nprint(gusu_num + kisu_num)', 'seq = input()\nif seq[:int((len(seq) - 1) / 2)] == seq[:int((len(seq) - 1) / 2)][::-1]:\n print()\n if s... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s177911691', 's724829312', 's400939820'] | [13276.0, 3060.0, 3064.0] | [155.0, 17.0, 18.0] | [213, 226, 370] |
p02730 | u677842374 | 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)\nimport sys\na = S[:((l-1)//2)]\n\n\nfor i in range(len(a)//2):\n\n if str(a[i])==str(a[-i]):\n pass\n else:\n print('No')\n sys.exit(0)\n\nb = S[l+3//2:l]\n\nfor j in range(len(b)//2):\n if b[j]==b[-j]:\n pass\n else:\n print('No')\n sys.e... | ['Wrong Answer', 'Accepted'] | ['s666814087', 's605036805'] | [3064.0, 3064.0] | [17.0, 17.0] | [427, 435] |
p02730 | u680144812 | 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 strongPalindrome(S):\n S2 = S[0:(len(S)-1)//2]\n S3 = S[0:(len(S)+3)//2]\n return True if S == S[::-1] and S2 == S2[::-1] and S3 == S3[::-1] else False\n\nS = input()\nprint(strongPalindrome(S))', 'def strongPalindrome(S):\n S2 = S[0:(len(S)-1)//2]\n S3 = S[0:(len(S)+3)//2]\n return "Yes" if S =... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s110525909', 's126156041', 's542096387', 's677900566'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 18.0, 18.0, 17.0] | [201, 201, 200, 202] |
p02730 | u680190333 | 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\ninput = sys.stdin.readline\nS = input()\nSr=''.join(list(reversed(S)))\nN=len(S)\nS1=S[:int((N-1)/2)]\nS1r=''.join(list(reversed(S1)))\nS2=S[int((N+3)/2)-1:]\nS2r=''.join(list(reversed(S2)))\nif S==Sr and S1 ==S1r and S2==S2r:\n print('Yes')\nelse:\n print('No')", "import sys\ninput = sys.stdin.read... | ['Wrong Answer', 'Accepted'] | ['s114492877', 's435008100'] | [3064.0, 3064.0] | [19.0, 18.0] | [268, 276] |
p02730 | u685244071 | 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)\na = (n - 1) // 2\nb = (n + 3) // 2\n\ns_reverse = s[::-1]\n\ns_first = s[:a]\ns_first_reverse = s_first[::-1]\n\ns_second = s[b-1:]\ns_second_reverse = s_second[::-1]\n\nif s == s_reverse and s_first = s_first_reverse and s_second = s_second_reverse:\n print('Yes')\nelse:\n print('No')", ... | ['Runtime Error', 'Accepted'] | ['s300756465', 's643288793'] | [2940.0, 3060.0] | [17.0, 17.0] | [298, 301] |
p02730 | u685684561 | 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())\nimport sys\nt=0\nlista=[]\nfor i in range(99):\n try:\n lista.append(S[i])\n t=t+1\n except IndexError:\n break\nu=t//2\nv=u//2+1\np=1\nfor i in range(v):\n if S[i]==S[u-i-1] and S[u-i+1]==S[u+i+1] and S[u+i+1]==S[t-1-i]:\n p=p*1\n else:\n print ('No')\n sys.exit()\nprint ('Yes')... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s010601657', 's210903056', 's377880849', 's661395391', 's243790129'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 19.0, 18.0, 17.0] | [299, 432, 299, 422, 331] |
p02730 | u686174642 | 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 partpall(s,n):\n\tif s!=s[::-1]:\n\t\treturn False\n\telse:\n\t\treturn True\n\ndef pall(s,n):\n\tif s!=s[::-1]:\n\t\treturn False\n\treturn partpall(s[n//2 +1 :],n) and partpall(s[:n//2 ],n)\n\n\n# s=input("enter:")\ns="akakaka"\n# print("sucess",s,s[::-1])\n# revStr=s[::-1]\nn=len(s)\nprint(n)\nif pall(s,n):\n\... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s058134156', 's121529994', 's148715590', 's676562380', 's365555471'] | [9088.0, 9068.0, 9112.0, 8928.0, 9120.0] | [28.0, 28.0, 23.0, 31.0, 29.0] | [320, 324, 323, 320, 320] |
p02730 | u688587139 | 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)\nleft = S[:(N - 1) // 2 + 1]\nright = S[((N + 3) // 2) - 1:]\n\nif left == left[::-1] and right == right[::-1]:\n print('Yes')\nelse:\n print('No')\n", "S = input()\nN = len(S)\nleft = S[:(N - 1) // 2 + 1]\nright = S[((N + 3) // 2) - 1:]\n\nif left == left[::-1] and right == right[::-1] ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s558584999', 's842289245', 's378285786'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [170, 187, 183] |
p02730 | u692498898 | 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)\nx=(n-1)//2\nwhile i in range(x):\n if s[i]!=s[n-1-i] or s[i]!=s[x-1-i]:\n print('No')\n break \nelse:\n print('Yes')", "s=input()\nn=len(s)\nx=(n-1)//2\nwhile i<x:\n if s[i]!=s[n-1-i] or s[i]!=s[x-1-i]:\n print('No')\n break \n i=i+1\nelse:\n print('Yes')", "s=input()\nn=len(s)\n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s216406484', 's858219385', 's603351645'] | [3064.0, 3064.0, 3060.0] | [18.0, 18.0, 18.0] | [137, 135, 139] |
p02730 | u692687119 | 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)\nkai = []\nkai2 = []\nkai3 = []\n\nfor i in range(N):\n kai.append(S[i])\n\nfor i in range(1, ((N - 1) / 2 + 1)):\n kai2.append(S[i])\n\nfor i in range(((N + 3) / 2), N + 1):\n kai3.append(S[i])\n\nrev = kai.reverse\nrev2 = kai2.reverse\nrev3 = kai3.reverse\n\nif kai == rev:\n if kai2 = re... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s193602939', 's882977198', 's182074852'] | [3064.0, 3064.0, 3064.0] | [19.0, 17.0, 17.0] | [412, 415, 591] |
p02730 | u697422981 | 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[1:(l+1)/2]\nS2=S[(l+3)/2::]\nif S==S[::] and S1==S1[::-1] and S2==S2[::-1]:\n print("Yes")\nelse:\n print("No")', 'S=input()\nl=len(S)\nS1=S[1:int((l+1)/2)]\nS2=S[int((l+3)/2)::]\nif S==S[::] and S1==S1[::-1] and S2==S2[::-1]:\n print("Yes")\nelse:\n print("No")', 'S=input()\nl=len(S)\nS... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s044438367', 's056247876', 's911822588'] | [3060.0, 3060.0, 2940.0] | [18.0, 17.0, 18.0] | [132, 142, 146] |
p02730 | u698460655 | 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)\nflag = True\nif N == 3: flag = False\nfor i in range((N-1)//4):\n if S[i] == S[(N-1)//2-1] and S[(N+3)//2-1] == S[N-1-i]:\n print(S[i],S[(N-1)//2-1] ,S[(N+3)//2-1],S[N-1-i])\n continue\n else:\n flag = False\n break\n\nprint("Yes" if flag else "No")', '... | ['Wrong Answer', 'Accepted'] | ['s986038787', 's504226632'] | [3064.0, 3064.0] | [17.0, 24.0] | [302, 312] |
p02730 | u699944218 | 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\na = (N-1)/2\nb = (N+3)/2\nsl = list(S)\nslr = reversed(sl)\nasl = sl[0:a]\naslr = reversed(asl)\nbsl = sl[b:N]\nbslr = reversed(bsl)\nfor i in range(N):\n if sl[i] != slr[i]:\n flag += 1\nfor i in range(0,a-1):\n if asl[i] != aslr[i]:\n flag += 1\nfor i in range(b-1,N):\n i... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s272114001', 's437856065', 's726847573', 's376974777'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 24.0, 18.0] | [383, 348, 385, 410] |
p02730 | u700929101 | 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)\nprint(n)\nng_list = [4*i+1 for i in range(1,25)]\nprint(ng_list)\ni = 0\n\nif n in ng_list:\n print("No")\nelse:\n county = 0\n if n == 3:\n if s[0] == s[2]:\n print("Yes")\n else:\n print("No")\n else:\n for i in range(int((n-1)/4))... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s323958582', 's706612348', 's415691035'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0] | [553, 461, 100] |
p02730 | u701318346 | 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())\nS_len = len(S)\nS_reverse = list(S[::-1])\n\nans = 'Yes'\n\n\nif S == S_reverse:\n pass\nelse:\n ans = 'No'\n\n\nS_2 = S[0:(S_len - 1) // 2]\nS_2_reverse = S_2[::-1]\nif S_2 == S_2_reverse:\n pass\nelse:\n ans = 'No'\n\n\nS_3 = S[0:(S_len + 3) // 2]\nS_3_reverse = S_3[::-1]\nif S_3 == S... | ['Wrong Answer', 'Accepted'] | ['s375310835', 's874705508'] | [3064.0, 3064.0] | [17.0, 18.0] | [396, 399] |
p02730 | u703528810 | 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 c1(S):\n N=len(S)\n if S[:N//2] == S[N:N//2:-1]:\n return True\n else:\n return False\nS=input()\nN=len(S)\nSS=S[:(N-1)//2]\nSSS=S[(N+3)//2-1:]\nprint(SS,SSS[::-1])\nif SS==SSS[::-1] and c1(SS):\n print("Yes")\nelse:\n print("No")', 'S=input()\nN=len(S)\nS1=S[:(N-1)//2]\nS2=S[(N+1)//2... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s495216526', 's559526713', 's579205380', 's839269729'] | [3064.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [249, 130, 421, 117] |
p02730 | u707808519 | 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 palind(LIST, N):\n for i in range(N):\n if LIST[i] != LIST[-1-i]:\n return False\n return True\n\nS = list(input())\nn = len(S)\nprint(S)\nflag = palind(S, n)\n\nfront = S[:((n+1)//2-1)]\nrear = S[((n+3)//2-1):]\nn = len(front)\nflag = palind(front, n)\nflag = palind(rear, n)\n\nif flag ==... | ['Wrong Answer', 'Accepted'] | ['s938078288', 's682776729'] | [3064.0, 3064.0] | [17.0, 17.0] | [346, 290] |
p02730 | u711686772 | 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[0:(n-1)/2]\ns2 = s[(n+3)/2-1:]\n\nif (s1 == s1[::-1] and s2 == s2[::-1]):\n\tprint("Yes")\nelse:\n \tprint("No")\n ', 's = input(\'\')\nn = len(s)\ns1 = s[0:(n-1)//2]\ns2 = s[(n+3)//2-1:]\n\nif (s == s[::-1] and s1 == s1[::-1] and s2 == s2[::-1]):\n\tprint("Yes")\nelse:\n \tprint("No")\n ... | ['Runtime Error', 'Accepted'] | ['s166647426', 's706983453'] | [2940.0, 2940.0] | [18.0, 17.0] | [131, 162] |
p02730 | u711693740 | 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 (N+1)%4 == 0:\n if S == S[::-1]:\n if S[:int((N-1)/2)+1] == S[:int((N-1)/2)+1:-1]:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\nelse:\n print('No')", "S = input()\nN = len(S)\nif (N-1)%4 == 0:\n if S == S[::-1]:\n if S[:int((N-1)/2)]... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s488048234', 's964203718', 's397734508'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [215, 211, 120] |
p02730 | u713914478 | 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 f(x):\n\treturn x == x[::-1]\nS = input()\n\n\nl1 = (len(S)-1)//2\nl2 = (len(S)+3)//2\n\nS1 = S[:l1]\nS2 = S[l2-1:]\n\n\nprint(S1,S2)\nif f(S) and f(S1) and f(S2):\n\tprint("Yes")\nelse:\n\tprint("No")', 'S = input()\nl = len(S)\n\nS1 = S[0:(l-1)//2]\nS2 = S[(l+3)//2]\n\ndef Kaibun(Str):\n\treturn Str == Str[::... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s182950439', 's189764971', 's278538794', 's583457596', 's618577648', 's655073907', 's697317652', 's870184716', 's884129525', 's936075202', 's770201995'] | [3060.0, 2940.0, 3060.0, 2940.0, 3060.0, 3060.0, 3064.0, 3060.0, 3060.0, 3060.0, 3064.0] | [17.0, 17.0, 18.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [187, 184, 168, 181, 181, 175, 187, 171, 156, 177, 172] |
p02730 | u715350216 | 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\ndef is_pal(s):\n print(s,'s')\n i,j=0,len(s)-1\n while i<=j:\n if s[i]==s[j]:\n i+=1\n j-=1\n else:\n return False\n return True\ns=sys.stdin.readline()[:-1]\nn=len(s)\nif n%2!=0:\n if is_pal(s[:n//2]) and is_pal(s[n//2+1:]) and is_pal(s):\n ... | ['Wrong Answer', 'Accepted'] | ['s811722513', 's261219921'] | [3064.0, 3060.0] | [17.0, 18.0] | [373, 374] |
p02730 | u718411265 | 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)\nS1=S[:(N-1)//2]\nS2=S[(N+1)//2:]\nif S==S[::-1] and S1=S1[::-1] and S2==S2[::-1]:\n print("Yes")\nelse:\n print("No")', 'S=input()\nN=len(S)\nS1=S[:(N-1)//2]\nS2=S[(N+3)//2:]\nif S==S[::-1] and S1==S1[::-1] and S2==S2[::-1]:\n print("Yes")\nelse:\n print("No")', 'S=input()\nN=len(S)\nS1=S[:(N... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s094202358', 's421561683', 's969920592', 's984069317', 's989584999'] | [2940.0, 3060.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 21.0, 17.0, 18.0] | [133, 134, 133, 136, 134] |
p02730 | u723711163 | 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... | ['# 1. S is Palindrome\n# 2. S[1, (N-1)//2]\n# 3. S[(N+3)//2, N]\n\ndef is_palindrome(str):\n i, j = 0, len(str)-1\n while i != j:\n if str[i] != str[j]:\n return False\n i += 1\n j -= 1\n\n return True\n\ns = input()\nn = len(s)\nprint(is_palindrome(s) and is_palindrome(s[0:((n-1)//2)]) and is_palindr... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s233700773', 's495264465', 's996037772'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [323, 279, 292] |
p02730 | u726154863 | 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)\nc=int((N-1)/2)\na=S[:c]\nb=S[::c]\nprint(a)\nprint(a[::-1])\nprint(b)\nprint(b[::-1])\nif a==a[::-1] and b==b[::-1]:\n print('Yes')\nelse:\n print('No')", "S=input()\nN=len(S)\nc=int((N-1)/2)\na=S[:c]\nb=S[::c]\nif a==a[::-1] and b==b[::-1] and S==S[::-1]:\n print('Yes')\nelse:\n prin... | ['Wrong Answer', 'Accepted'] | ['s444206471', 's350715410'] | [3064.0, 3060.0] | [17.0, 19.0] | [167, 134] |
p02730 | u726902498 | 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)\nB = S[:((N-1)/2)]\nC = S[((N+3)/2):]\nif S == S[-1]:\n if S[:((N-1)/2)] == B[-1]:\n if C[-1] == S[((N+3)/2):]:\n print("Yes")\n else:\n print("No")\n else:\n print("No")\nelse:\n print("No")', 'S = str(input())\nN = int(len(... | ['Runtime Error', 'Accepted'] | ['s122823288', 's542323681'] | [3064.0, 3064.0] | [17.0, 17.0] | [271, 263] |
p02730 | u727148417 | 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)\nforw = S[:int((N-1)/2)]\n\n\nback = S[int((N+3)/2)-1:]\nprint(forw, back)\n\nif forw == forw[::-1] and back == back[::-1]:\n print("Yes")\nelse:\n print("No")', '# -*- coding: utf-8 -*-\n"""\nCreated on Sun Mar 22 21:21:55 2020\n\n@author: azikausy\n"""\n\n\nS = input()\nN = len(S... | ['Wrong Answer', 'Accepted'] | ['s232577318', 's426664533'] | [3060.0, 3060.0] | [17.0, 21.0] | [184, 264] |
p02730 | u729119068 | 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-1]\nU=S[(len(S)+3)//2-1:]\nif S==S[::-1]:\n if T==T[::-1]:\n if U==U[::-1]:\n print('Yes')\n else:print('No')\n else:print('No')\nelse:print('No')", "N,M=map(int,input().split())\nprint(N*(N-1)//2+M*(M-1)//2)\n\nS=input()\nT=S[:(len(S)-1)//2-1]\nU=S[(len(S)... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s074120731', 's260699557', 's908779330'] | [8936.0, 9088.0, 9136.0] | [30.0, 22.0, 29.0] | [198, 258, 196] |
p02730 | u729133443 | 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();print('YNeos'[s[:2]!=s[-2:]::2])", "s=input();print(' YNeos'[s[:5]in s[2:]::2])", "s=input();print('YNeos'[s[:4]!=s[-4:]::2])", 'def main():\n h,*s=open(0)\n h,w,k=map(int,h.split())\n s=[list(map(int,t[:w]))for t in s]\n m=9e9\n for i in range(1<<h-1):\n t,v,l=[],0,1\n for j in range(h):\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s098070440', 's104030091', 's168984106', 's751986795', 's858237094'] | [2940.0, 2940.0, 2940.0, 3064.0, 2940.0] | [18.0, 17.0, 17.0, 18.0, 17.0] | [42, 43, 42, 576, 54] |
p02730 | u730710086 | 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... | ["# -*- coding: <encoding name> -*-\n\ns = input()\ns_former = s[:(n - 1) / 2 + 1]\ns_latter = s[(n + 3) / 2 + 1:]\nprint('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1])\n", "# -*- coding: <encoding name> -*-\n\ns = input()\ns_former = s[:(len(s) - 1) / 2]\ns_latter = s[(len(s) + 3)... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s203872396', 's285256608', 's363793645', 's815699731', 's720792331'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 17.0] | [200, 216, 210, 220, 218] |
p02730 | u732230060 | 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\nrs = s[::-1]\nq1 = 0\nif s == rs:\n q1 = 1\n\n\nn = len(s)\nh = int((n-1)/2)\ns1 = s[:h:]\nrs1 = s[::-1]\nq2 = 0\nif (s1 == rs1):\n q2 = 1\n\n\nn = len(s)\nh = int((n+2)/2)\ns2 = s[h::]\nrs2 = s2[::-1]\nq3 = 0\nif (s2 == rs2):\n q3 = 1\nif q1 == 1 and q2 == 1 and q3 ==1:\n print("Yes")\nelse:\n pr... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s319798465', 's924908827', 's684019514'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [582, 698, 714] |
p02730 | u732390946 | 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... | ['# -*- coding: utf-8 -*-\nstr = input()\ns = list(str)\nn = len(s)\n\n\ndef is_kaibun(kaibun):\n for i in range(len(kaibun) // 2):\n if kaibun[i] != kaibun[-i - 1]:\n return False\n return True\n\n\nif is_kaibun(str):\n before = int((n-1)/2)\n later = int((n+3)/2)\n str_before = str[0:... | ['Wrong Answer', 'Accepted'] | ['s667493358', 's017028879'] | [3060.0, 3064.0] | [17.0, 17.0] | [441, 542] |
p02730 | u733132703 | 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)\n\n\n\na = S[0:(N-1)//2-1]\nb = S[0:(N-1)//2-1:-1]\n\nc = S[(N+3)//2-1:N-1]\nd = S[(N+3)//2-1:N-1:-1]\n\ne = S[:N-1]\nf = S[:N-1:-1]\n\nif a == b and c ==d and e == f:\n print('Yes')\n \nelse:\n print('No')", "S = input()\nN = len(S)\n\n\n\na = S[0:(N-1)//2]\nb = a[::-1]\n\nc = S[(N+3)//2... | ['Wrong Answer', 'Accepted'] | ['s499793092', 's584966375'] | [3064.0, 3060.0] | [17.0, 18.0] | [216, 181] |
p02730 | u734529045 | 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 return s == s[::-1]\n \ns = input()\nn = len(s)\nres = isPalindrome(s) and isPalindrome(s[:n//2+1]) and isPalindrome(s[n//2+2:])\nprint(res)', 'def isPalindrome(s):\n return s == s[::-1]\n \ns = input()\nn = len(s)\nres = isPalindrome(s) and isPalindrome(s[:n//2+1]) and isPalindrome(s[n//2+... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s054732715', 's542346646', 's976101296', 's133507515'] | [2940.0, 3064.0, 2940.0, 3064.0] | [17.0, 18.0, 17.0, 17.0] | [159, 178, 147, 176] |
p02730 | u737756998 | 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()\nprint(s)\nn = len(s)\nprint(n)\nprint(s[:int(n//2)])\nprint(s[int(n//2)+1:])\nif s[:int(n//2)-1] == s[int(n//2)+1:]:\n print("Yes")\nelse:\n print("No")\n', 's = input()\nn = len(s)\nif s[:int(n//2)] == s[int(n//2)+1:]:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s796109693', 's368333403'] | [3060.0, 3064.0] | [17.0, 17.0] | [159, 95] |
p02730 | u737968367 | 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... | ['count=0\ns=input()\nlen_s=len(s)\ncenter=int((len_s-1)/2+1)\ns_former=s[0:center-1]\ns_leter=s[center:]\nif(s==reversed(s)):\n pass\nelse:\n count=+1\nif(s_former==reversed(s_former)):\n pass\nelse:\n count=+1\nif(s_leter==reversed(s_leter)):\n pass\nelse:\n count=+1 \nif(count==0):\n print("Y... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s403436233', 's969489160', 's514522334'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0] | [325, 527, 486] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.