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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03086 | u483885886 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["a = input()\nnum=0\nb=[]\nfor i in a:\n \u3000\u3000\u3000\u3000if i in 'ATGC':\n \u3000\u3000\u3000\u3000\u3000\u3000\u3000num+=1\n \u3000\u3000\u3000\u3000else:\n \u3000\u3000\u3000\u3000\u3000\u3000\u3000b.append(num)\n \u3000\u3000\u3000\u3000\u3000\u3000\u3000num=0\nprint(max(b))\n ", 'a = input()\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s191398431', 's261540587', 's687918885', 's996446535', 's889334546'] | [2940.0, 3060.0, 2940.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0, 19.0, 17.0] | [205, 135, 118, 121, 122] |
p03086 | u484948364 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = list(input())\nacgt = ['A', 'C', 'G', 'T']\n\nwlist=[]\nanswer=[]\nfor word in S:\n if word in acgt:\n wlist.append(word)\n else:\n print(wlist)\n answer.append(len(wlist))\n wlist=[]\n\nprint(max(answer))", "S = list(input())\nacgt = ['A', 'C', 'G', 'T']\n\nc=0\nans=0\nfor word ... | ['Runtime Error', 'Accepted'] | ['s019646281', 's456398766'] | [3060.0, 2940.0] | [17.0, 17.0] | [230, 140] |
p03086 | u485301559 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['# -*- coding: utf-8 -*-\n"""\nCreated on Fri Apr 5 14:11:52 2019\n\n@author: adachi-lab\n"""\n\ninput_code = str(input(\'入力;\'))\nL1 = len(input_code)\n\nlist_3 = []\nfor w in range(L1):\n list_3.append(w)\n\n\nx = 0\nfor i in range(L1):\n code = input_code[i]\n if code == \'A\' or code == \'C\' or code == ... | ['Runtime Error', 'Accepted'] | ['s924624343', 's207375500'] | [3188.0, 3064.0] | [19.0, 18.0] | [765, 557] |
p03086 | u486448566 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\ncount = 0\nmax_count = 0\nfor c in s:\n if c in ['A','C','G','T']:\n count = 0\n else:\n count += 1\n if max_count < count:\n max_count = count\nprint(max_count)\n", "s = input()\ncount = 0\nmax_count = 0\nfor c in s:\n if c in ['A','C','D','T']:\n count = 0\n else:\n count += 1\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s219574217', 's775556425', 's510345602'] | [8940.0, 8988.0, 9008.0] | [26.0, 26.0, 29.0] | [181, 180, 202] |
p03086 | u492737043 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s=input()\nS=[s[i] for i in range(len(s))]\nA={'A','C','G','T'}\nB=[S[i] in A for i in range(len(S))]\nmax_length=0\n\nfor i in range(len(B)):\n if B[i]==1:\n count_length=1\n count=i\n max_length=count_length\n while (count+1)<len(B) and B[count+1]==1:\n count_length=1+count_length\n count=1+c... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s360618968', 's779501497', 's851748296', 's443434891'] | [8996.0, 9044.0, 9028.0, 9032.0] | [31.0, 29.0, 26.0, 27.0] | [380, 404, 393, 384] |
p03086 | u499259667 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = input()\nml = 0\nnc = 0\nfor c in s:\n if c in "ACGT": \n nc += 1\n else:\n ml = max(ml, nc)\n nc = 0\n', 's = input()\nml = 0\nnc = 0\nfor c in s:\n if c in "ACGT": \n nc += 1\n else:\n ml = max(ml, nc)\n nc = 0\nml = max(ml, nc)\nprint(ml)\n'] | ['Wrong Answer', 'Accepted'] | ['s297173153', 's626242193'] | [2940.0, 2940.0] | [17.0, 19.0] | [125, 152] |
p03086 | u499317876 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\ns = len(S)\nL = []\ntemp = 0\nfor i in range(s):\n if S[i]=='A' or S[i]=='T' or S[i]=='G' or S[i]=='C':\n if temp ==0:\n temp=1\n else:\n temp*=10\n L.append(temp)\n else:\n temp = 0\nL.append(0) \nif L[-1]==0:\n P=0\nelse:\n P = le... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s052958366', 's644506642', 's233467266'] | [3060.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0] | [324, 326, 389] |
p03086 | u503228842 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['wlist = list(input())\nwlength = 0\n\nfor w in wlist:\n if not w in ["A","T","G","C"]:\n tmp = 0\n continue\n\n else:\n tmp += 1\n if tmp >= wlength:\n wlength = tmp\nprint(wlength)\n\n\n', 'wlist = list(input())\nwlength = 0\ntmp = 0\nfor w in wlist:\n if not w in ["A"... | ['Runtime Error', 'Accepted'] | ['s336242379', 's184334324'] | [2940.0, 2940.0] | [17.0, 18.0] | [217, 221] |
p03086 | u506910932 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["def checkACGT(s):\n ss = ''.join(s)\n check = ss.replace('A', '').replace('C', '')\\\n .replace('G','').replace('T', '')\n if len(check) == 0:\n print(ss)\n return True\n\n else:\n return False\n\n\ns = input()\nans = 0\nfor i in range(len(s)):\n for j in range(i, len(s)):\n ... | ['Wrong Answer', 'Accepted'] | ['s120748843', 's646622379'] | [9028.0, 9080.0] | [27.0, 28.0] | [416, 402] |
p03086 | u508273185 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s =input()\nl =len(s)\ncount=0\nfor i in range(l):\n x =s[i]\n if x =='A' or x =='C' or x =='G' or x =='T':\n count +=1\n for j in range(i+1, l):\n x =s[j]\n if x =='A' or x =='C' or x =='G' or x =='T':\n count +=1\n else:\n break\n\np... | ['Wrong Answer', 'Accepted'] | ['s447996478', 's855884253'] | [2940.0, 2940.0] | [17.0, 18.0] | [316, 202] |
p03086 | u509405951 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\n \nnum = 0\ncount = 0\nlis = ["A", "G", "C", "T"]\nfor s in S:\n if s not in lis:\n \tcount += 1\n else:\n if num < count:\n num = count\n count = 0\nprint(num)', 'S = input()\n \ncount = [0]\ncounter = 0\n \nfor i in S:\n if i == "A" or i == "C" or i == "G" or i == "T":\n counter += 1\... | ['Wrong Answer', 'Accepted'] | ['s097511682', 's970676722'] | [2940.0, 2940.0] | [17.0, 17.0] | [174, 188] |
p03086 | u514383727 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = input()\nans = 0\ntmp = 0\nfor c in s:\n print(c)\n if c in "ACGT":\n tmp += 1\n else:\n ans = max(ans, tmp)\n tmp = 0\nans = max(ans, tmp)\nprint(ans)\n', 's = input()\nans = 0\ntmp = 0\nfor c in s:\n if c in "ACGT":\n tmp += 1\n else:\n ans = max(ans, tmp)\n ... | ['Wrong Answer', 'Accepted'] | ['s434815321', 's471577536'] | [2940.0, 2940.0] | [17.0, 17.0] | [175, 162] |
p03086 | u515128734 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['lngs = input()\n\nACGT = ["A", "C", "G", "T"]\nout_list = []\nout_list_long = []\n\nfor lng in lngs:\n if lng in ACGT:\n out_list += lng\n else:\n if len(out_list) > len(out_list_long):\n out_list_long = out_list\n out_list = []\n \n \nout = \'\'.join(out_list_long)\npr... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s265773616', 's400230096', 's497398486'] | [9048.0, 9004.0, 9040.0] | [24.0, 27.0, 26.0] | [308, 154, 407] |
p03086 | u515740713 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["import sys\nimport itertools\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nS = read()\ncount=0\ncnt_max=0\nfor i in range(len(S)):\n if S[i] in ['A', 'C', 'G', 'T']:\n count +=1\n else:\n cnt_max = max(cnt_max,count)\n count=0\nprint(cnt_max)\n... | ['Wrong Answer', 'Accepted'] | ['s421348994', 's772329676'] | [3188.0, 3064.0] | [19.0, 19.0] | [305, 318] |
p03086 | u516613126 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = list(input())\ncount = 0\nm = 0\nfor i in range(len(s)):\n if s[i] == "A" or s[i] == "T" or s[i] == "C" or s[i] == "G":\n count += 1\n else:\n if m >count:\n m = count\n count == 0\nprint(m)', 's = list(input())\ncount = 0\nm = 0\nfor i in range(len(s)):\n if s[i] == "A" or s[i] == "T" or s[i]... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s293233902', 's449880239', 's746858871'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0] | [203, 229, 262] |
p03086 | u517447467 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['import numpy as np\ninp = input()\nACGT = ["", "A", "C", "G", "T"]\nsentences = [i+j+k+l+m+n+o+p+q+r+s for i in ACGT for j in ACGT for k in ACGT for l in ACGT for m in ACGT for n in ACGT for o in ACGT for p in ACGT for q in ACGT for r in ACGT for s in ACGT]\nlength = [len(sent) for sent in sentences if sent in inp]\n... | ['Time Limit Exceeded', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s006646645', 's382183777', 's564642088', 's899324349'] | [363428.0, 2940.0, 12448.0, 3060.0] | [2132.0, 17.0, 161.0, 19.0] | [334, 191, 222, 194] |
p03086 | u521518741 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\nacgt = {'A', 'C', 'G', 'T'}\nlength = len(S)\nstart = 0\nans = 0\nwhile start < length:\n while S[start] not in acgt:\n start += 1\n right = start\n while right < length and S[right] in acgt:\n right += 1\n ans = max(ans, right - start )\n start = right\nprint(ans)", "S = input()\nacgt = {'A',... | ['Runtime Error', 'Accepted'] | ['s487885441', 's372175212'] | [3064.0, 3064.0] | [18.0, 18.0] | [276, 294] |
p03086 | u521992338 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["b = input()\nc = {'A': 'T', 'T': 'A', 'C': 'G', 'G': 'C'}\nprint (c[b])\n", "S = input()\nN = len(S)\nans = 0\nfor i in range(N):\n for j in range(i, N):\n if all('ACGT'.count(c) == 1 for c in S[i : j + 1]):\n ans = max(ans, j - i + 1)\nprint (ans)\n"] | ['Runtime Error', 'Accepted'] | ['s244715937', 's910712270'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 186] |
p03086 | u523087093 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\n\ntarget = list('ACGT')\n\ncount_list = [0] * len(S)\nfor i in range(len(S)):\n if S[i] in target:\n count_list[i] = 1\n\nmax_length = 0\nfor start in range(len(S)):\n if count_list[start] == 0:\n continue\n for end in range(start, len(S)):\n if count_list[end] == 0:\n ... | ['Wrong Answer', 'Accepted'] | ['s708517830', 's094604915'] | [9024.0, 9116.0] | [29.0, 28.0] | [452, 288] |
p03086 | u529180657 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\nl = 0\nl_max = 0\nfor i in range(len(s)):\n b = S[i]\n if b == 'A' or b == 'C' or b == 'T' or b == 'G':\n l += 1\n else:\n l_max = max(l_max,l)\n l = 0\nprint(l_max)", "s = input()\nl = 0\nl_max = 0\nfor i in range(len(s)):\n b = s[i]\n if b == 'A' or b == 'C' or b == 'T' or b == 'G':\n ... | ['Runtime Error', 'Accepted'] | ['s115188166', 's203672475'] | [3060.0, 3060.0] | [17.0, 17.0] | [180, 201] |
p03086 | u531579566 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = input()\n\nacgt = set("ACGT")\n\nans = 0\n\nfor i in range(len(s)):\n l = 0\n for j in range(i, len(s)):\n print(s[j])\n if s[j] in acgt:\n l += 1\n else:\n ans = max(ans, l)\n break\nans = max(ans, l)\nprint(ans)\n', 's = input()\n\nacgt = set("ACGT")\n... | ['Wrong Answer', 'Accepted'] | ['s201208101', 's052757786'] | [3060.0, 3060.0] | [17.0, 17.0] | [262, 289] |
p03086 | u533885955 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['\nS=str(input())\nSlist=list(S)\nSlen=len(Slist)\nMAX=0\nfor i in range(Slen):\n for j in range(Slen-i-1):\n J=j+i+1\n karis=Slist[i:J+1]\n flag = 0\n print(karis)\n for x in karis:\n if x == "A" or x == "T" or x == "C" or x == "G":\n pass\n e... | ['Wrong Answer', 'Accepted'] | ['s827874474', 's453570584'] | [3064.0, 3064.0] | [17.0, 17.0] | [552, 531] |
p03086 | u534953209 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\ncnt = 0\nans = 0\nfor i in range(len(S)):\n if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt =\nans = max(ans, cnt)\nprint(ans)\n', 'S = input()\ncnt = 0\nans = 0\nfor i in range(len(S)):\n if S[i] == "A" or S[i] == ... | ['Runtime Error', 'Accepted'] | ['s622755360', 's674028027'] | [2940.0, 3060.0] | [17.0, 17.0] | [217, 219] |
p03086 | u539517139 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s=input()\nx=['A','T','C','G']\na=[0]*len(s)\na[0]=1 if s[0] in x\nfor i in range(1,len(s)):\n if s[i] in x:\n a[i]=a[i-1]+1\nprint(max(a))\n \n ", "s=input()\nx=['A','T','C','G']\na=[0]*len(s)\nif s[0] in x:\n a[0]=1\nfor i in range(1,len(s)):\n if s[i] in x:\n a[i]=a[i-1]+1\nprint(max(a))"] | ['Runtime Error', 'Accepted'] | ['s067703259', 's952742980'] | [2940.0, 3060.0] | [17.0, 17.0] | [142, 139] |
p03086 | u539806549 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['a = list(input())\nb = 0\nc = 0\n\nfor i in range(len(a)):\n if a[i] == "A":\n b = b + 1\n elif a[i] == "C":\n b = b + 1\n elif a[i] == "G":\n b = b + 1\n elif a[i] == "T":\n b = b + 1\n else :\n if c < b :\n c = b\n b = 0\n else :\n b = 0\nif c < b :\n c = b\n b = 0\ne... | ['Wrong Answer', 'Accepted'] | ['s178638089', 's941007527'] | [3064.0, 3060.0] | [18.0, 17.0] | [336, 328] |
p03086 | u541921833 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["string = input()\nacgt = ['A', 'C', 'G', 'T']\n\nmax_length_str = ''\ntmp_str = ''\nfor n in string:\n if n in acgt:\n tmp_str += n\n else:\n if len(tmp_str) > len(max_length_str):\n max_length_str = tmp_str\n tmp_str = ''\n\nprint(max_length_str)\n ", "string = input()\nacgt = ['A', 'C', 'G', 'T']... | ['Wrong Answer', 'Accepted'] | ['s523991686', 's202705598'] | [2940.0, 2940.0] | [18.0, 17.0] | [255, 340] |
p03086 | u548093253 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input() + 'n'\nans = 0\nfans = 0\nfor i in range(len(s)):\n if s[i] 'ACGT':\n ans += 1\n elif fans < ans:\n fans = ans\n ans = 0\nprint(fans)\n", "s = input() + 'n'\nans = 0\nfans = 0\nfor i in range(len(s)):\n if s[i] in 'ACGT':\n ans += 1\n elif fans < ans:\n fans ... | ['Runtime Error', 'Accepted'] | ['s923588338', 's114366748'] | [2940.0, 2940.0] | [17.0, 18.0] | [164, 167] |
p03086 | u551437236 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = input()\ns = "ATCHATTTKGTCC"\ncount = 0\nans = 0\nfor i in s:\n if i == "A":\n count += 1\n elif i == "C":\n count += 1\n elif i == "G":\n count += 1\n elif i == "T":\n count += 1\n else:\n if ans <= count:\n ans = count\n count = 0\nprint(ans)\n... | ['Wrong Answer', 'Accepted'] | ['s382834200', 's805841962'] | [2940.0, 2940.0] | [17.0, 17.0] | [300, 178] |
p03086 | u552201227 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s=input()\nn=len(s)\nans=0\nfor i in range(n):\n for i in range(i,n)\n bubun=s[i:j+1]\n flag=True\n for c in bubun:\n if(c not in ['A','G','C','T']):\n flag = False\n if(flag):\n ans = max(ans,len(bubun))\nprint(ans)", "s=input()\nn=len(s)\nans=0\nfor i in range(n):\n for j in range(i,n):\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s041152700', 's169634975', 's175860821', 's185268337', 's638109457', 's945980358', 's993476554', 's281039178'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0] | [220, 270, 276, 222, 221, 252, 270, 244] |
p03086 | u552290152 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\nN = len(S)\ncount = 0\nmax = 0\nfor i in range (N):\n if S[i] == "A" or "T" or "G" or "C":\n count = count + 1\n else:\n if count > max:\n max = count\n count = 0\nif count > max:\n max = count\n \nprint(max)', 'S = input()\nN = len(S)\ncount = 0\nmax = 0\nfor i in range (N):\n if S[i]... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s148875621', 's910068906', 's290212083'] | [3060.0, 3060.0, 3064.0] | [17.0, 18.0, 17.0] | [225, 229, 249] |
p03086 | u554954744 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S="AFA"\nans=0\ncnt=0\nfor s in S:\n if s in "A":\n cnt+=1\n elif s in "C":\n cnt+=1\n elif s in "G":\n cnt+=1\n elif s in "T":\n cnt+=1 \n else:\n cnt=0\n ans=max(ans,cnt)\nprint(ans)', 'S=input()\nans=0\ncnt=0\nfor s in S:\n if s in "A":\n cnt+=1\n ... | ['Wrong Answer', 'Accepted'] | ['s528795473', 's472625563'] | [3064.0, 3060.0] | [17.0, 19.0] | [224, 226] |
p03086 | u555947166 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\ns = s.translate(str.maketrans({'T': 'A', 'G': 'A', 'C': 'A'}))\nprint(s)\ns = list(s)+['END']\n\nif s[0] == 'A':\n counter = 1\nelse:\n counter = 0\n\nans = 0\n\nfor i in range(len(s)):\n if s[i - 1] == s[i] == 'A':\n counter += 1\n else:\n if ans < counter:\n ans = c... | ['Wrong Answer', 'Accepted'] | ['s506977653', 's130329402'] | [3064.0, 3064.0] | [17.0, 17.0] | [405, 396] |
p03086 | u556589653 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['\nS = input()\nk = []\nb = ["A","C","G","T"]\na = 1\n\nfor i in range(len(S)):\n \n \n if S[i] in b:\n if i == len(S)-1:\n k.append(a)\n break\n else:\n \n for j in range(1,len(S)-1):\n if S[i+j] in b:\n if i+j == len(S)-1:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s344172102', 's940732927', 's047811258'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [834, 912, 375] |
p03086 | u556594202 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['print(len(input().replace("A","").replace("G","").replace("C","").replace("T","")))\n', 'S = input()\n\nans=0\nfor i in range(len(S)):\n cnt=0\n for j in range(i,len(S)):\n if S[j] in ["A","C","G","T"]:\n cnt+=1\n else:\n break\n ans = max(ans,cnt)\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s982557611', 's727171589'] | [8864.0, 9088.0] | [29.0, 24.0] | [84, 206] |
p03086 | u556672233 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\ncandidate = 0\n\n\ndef length(s, i, j):\n for c in s[i:j + 1]:\n if c not in 'ACGT':\n return 0\n return len(s[i:j])\n\n\nfor i in range(len(s)):\n for j in range(len(s)):\n candidate = max(candidate, length(s, i, j))\n\nprint(candidate)\n", "s = input()\nstart = 0\ni = ... | ['Wrong Answer', 'Accepted'] | ['s398489688', 's607746774'] | [2940.0, 3060.0] | [17.0, 17.0] | [270, 222] |
p03086 | u556849401 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\nN = len(S)\nans = 0\nfor i in range(N):\n for j in range(i, N):\n if all('ACGT'.count(c) == 1 for c in S[i : j + 1]):\n s = max(ans, j - i + 1)\nprint(ans)", "S = input()\nN = len(S)\nans = 0\nfor i in range(N):\n for j in range(i, N):\n if all('ACGT'.count(c) == 1 for c in... | ['Wrong Answer', 'Accepted'] | ['s654620247', 's561374904'] | [3060.0, 3060.0] | [17.0, 17.0] | [182, 184] |
p03086 | u559961423 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['import sys\n\nb = input()\n\nflg = 0\nn = 0\nnw = []\nfor bi in b:\n if bi == ("A" or "G" or "C" or "T"):\n flg = 1\n n += 1\n else:\n flg = 0\n n = 0\n nw.append(n)\n\nnw.sort(reverse = True)\nprint(nw[0])\n\n\n\n', "import sys\n\nb = input()\n\nflg = 0\nn = 0\nnw = []\nfor bi in... | ['Wrong Answer', 'Accepted'] | ['s953196254', 's448843009'] | [2940.0, 2940.0] | [17.0, 17.0] | [230, 245] |
p03086 | u560708725 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = list(input())\nans = []\nfor mozi in s:\n if(mozi == "A" or mozi == "G" or mozi == "C" or mozi == "T"):\n ans.append(mozi)\n else:\n break\nprint("".join(ans))', 's = list(input())\ncombo = False\ncnt = 0\nans = [0,] \nfor mozi in s:\n if(mozi == "A" or mozi == "G" or mozi == "C" or mozi ... | ['Wrong Answer', 'Accepted'] | ['s240232985', 's092901552'] | [9084.0, 9040.0] | [30.0, 26.0] | [177, 342] |
p03086 | u560867850 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\n\nmax_count = 0\ncount = 0\nfor i in range(len(s)):\n if s[i] in ['A', 'C', 'G', 'T']:\n count += 1\n else:\n if count > max_count:\n max_count = count\n count = 0\n\nprint(max_count)\n", 'import sys\n# input = sys.stdin.readline\n\ndef readlines(n):\n for _ in range(... | ['Wrong Answer', 'Accepted'] | ['s420962525', 's489786829'] | [2940.0, 2940.0] | [18.0, 20.0] | [219, 351] |
p03086 | u565387531 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = str(input())\ncount = 0\ncount_max = 0\nfor i in s:\n if i == 'A' or i == 'T' or i == 'G' or i == 'C':\n count += 1\n else:\n if count_max < count:\n count_max = count\n count = 0\n\ncount_max = count\n\nprint(count_max)", "s = str(input())\n#s = 'ATCODER'\n\ncount = 0\nc... | ['Wrong Answer', 'Accepted'] | ['s790687297', 's470495369'] | [3060.0, 3060.0] | [18.0, 17.0] | [253, 295] |
p03086 | u565901164 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\ncount = 0\nlist = []\n\nfor c in S:\n if c == 'A' or c == 'C' or c == 'G' or c == 'T':\n count+=1\n else:\n list.append(count)\n count = 0\n\nif not list:\n print(0)\nelse\n print(max(list))\n ", "S = input()\ncount = 0\nlist = []\n\nfor c in S:\n if c == 'A' or c == 'C' or c == 'G' ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s214762480', 's619386396', 's845466539', 's157076650'] | [2940.0, 2940.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0, 18.0] | [211, 214, 174, 232] |
p03086 | u569322757 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\nm = 0\nl = 0\nfor c in s:\n if not (c == 'A' or c == 'C' or c == 'G' or c == 'T'):\n m = max(m, l)\n l = 0\n continue\n\n l += 1\n\nprint(l)", "s = input()\nm = 0\nl = 0\nfor c in s:\n if not (c == 'A' or c == 'C' or c == 'G' or c == 'T'):\n m = max(m, l)\n l =... | ['Wrong Answer', 'Accepted'] | ['s377071281', 's062104465'] | [2940.0, 2940.0] | [17.0, 17.0] | [169, 183] |
p03086 | u571395477 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["import sys\n\ndef main():\n S = input()\n l = len(S)\n \n cnt_l = []\n \n for i in range(l):\n cnt = 0\n for j in range(l-i):\n if str(S[i+j]) in ['A', 'C', 'G', 'T']:\n cnt += 1\n else:\n cnt_l.append(cnt)\n\n m = max(cnt_l)\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s017827305', 's089501956', 's222537166', 's753997169'] | [3064.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [395, 446, 322, 259] |
p03086 | u573970531 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s=input()\nans=0\ntmp=0\nacgt="ACGT"\nfor i in s:\n if i in acgt:\n ans=max(ans,tmp)\n tmp=0\n else:\n tmp+=1\nans=max(ans,tmp)\nprint(ans)', 's=input()\nans=0\ntmp=0\nacgt="ACGT"\nfor i in s:\n if i in acgt:\n tmp+=1\n else:\n ans=max(ans,tmp)\n tmp=0\nans=max(ans,tmp)\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s720795719', 's100737549'] | [3060.0, 3060.0] | [19.0, 17.0] | [139, 139] |
p03086 | u578489732 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["# -*- coding: utf-8 -*-\nimport sys\n# ----------------------------------------------------------------\n# Use Solve Function\n\ndef solve(lines):\n S = lines.pop(0)\n c = 0\n res = 0\n for i in S:\n if i in 'AGCT':\n c += 1\n else:\n res = max(res, c)\n c = ... | ['Wrong Answer', 'Accepted'] | ['s433994934', 's365077878'] | [2940.0, 2940.0] | [17.0, 17.0] | [373, 398] |
p03086 | u579699847 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = return sys.stdin.readline().rstrip()\nans,temp = 0,0\nfor x in S:\n if x in 'ACGT':\n temp += 1\n ans = max(ans,temp)\n else:\n temp = 0\nprint(ans)\n", "import itertools,sys\ndef S(): return sys.stdin.readline().rstrip()\nS = S()\nans = 0\nfor i,j in itertools.combinations_with_replace... | ['Runtime Error', 'Accepted'] | ['s420897580', 's918946499'] | [2940.0, 3060.0] | [17.0, 18.0] | [172, 237] |
p03086 | u580004585 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['import re\n\ndata = input().upper()\n\ntext = re.sub(\'[ACGT]+\', "", data)\n\nprint(len(text))\n', "import re\n\ndata = input()\n\nt = re.split('[^ACGT]+', data)\nt.sort(key=len, reverse=True)\nprint(len(t[0]))"] | ['Wrong Answer', 'Accepted'] | ['s881464934', 's069820267'] | [3188.0, 3188.0] | [19.0, 21.0] | [88, 104] |
p03086 | u580199868 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['N=list(input())\nprint(N)\ncount = 0\nScount = 0\n\nfor i in N:\n if i == "A" or i == "C" or i == "G" or i == "T":\n count += 1\n Scount = max(Scount,count)\n else:\n count = 0\n\nprint(Scount)', 'N=list(input())\ncount = 0\nScount = 0\n\nfor i in N:\n if i == "A" or i == "C" or i == "G" or i == "T":\... | ['Wrong Answer', 'Accepted'] | ['s175211168', 's631950720'] | [3060.0, 2940.0] | [17.0, 19.0] | [194, 185] |
p03086 | u580404776 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S=input()\nN=len(S)\nans=0\nd=set(list("AGCT"))\n\nfor i in range(N+1):\n for j in range(N+1):\n s=S[i:j]\n print(s)\n if set(list(s))<=d:\n ans=max(ans,len(s))\n \nprint(ans)', 'S=input()\nN=len(S)\nans=0\nd=set(list("AGCT"))\n\nfor i in range(N+1):\n for j in range(N... | ['Wrong Answer', 'Accepted'] | ['s042313434', 's215949195'] | [3060.0, 3060.0] | [18.0, 17.0] | [209, 192] |
p03086 | u581040514 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = list(input())\nans = 0\ncount = 0\nfor i in len(S):\n if S[i] == 'A' or S[i] == 'C' or S[i] == 'G' or S[i] == 'T':\n count += 1\n else:\n if ans < count:\n ans = count\n else:\n pass\n count = 0\nprint(ans)", "S = list(input())\nans = 0\ncount = 0\nfor i in ... | ['Runtime Error', 'Accepted'] | ['s687246059', 's548820898'] | [2940.0, 3064.0] | [17.0, 19.0] | [254, 308] |
p03086 | u581483013 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['# -*- coding: utf-8 -*-\n"""\nCreated on Sun Mar 24 20:27:19 2019\n\n@author: screamLab\n"""\n\ns = input()\natcg = [\'A\',\'T\',\'C\',\'G\']\nans = 0\nlong = 0\nfor i in range(len(s)):\n if s[i] in atcg:\n if s[i+1] in atcg:\n ans += 1\n else:\n ans += 1\n long = max(long,an... | ['Runtime Error', 'Accepted'] | ['s653532194', 's396552844'] | [3064.0, 3064.0] | [17.0, 17.0] | [349, 416] |
p03086 | u583276018 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\nmax = 0\nfor i in range(len(s)):\n cnt = 0\n for j in range(i, len(s)):\n if(s[j] == 'A' or s[j] == 'C' or s[j] == 'G' or s[j] == 'T'):\n cnt += 1\n else:\n break\n if(max < cnt):\n max = cnt\nprint(cnt)", "s = input()\nmax = 0\nfor i in range(len(s)):\n cnt = 0\n for j in range(i... | ['Wrong Answer', 'Accepted'] | ['s082499190', 's720029929'] | [3064.0, 3060.0] | [17.0, 17.0] | [227, 228] |
p03086 | u586212264 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s=input()\nword=list(s)\ntemp=[]\nscore=[]\nfor i in range(len(word)):\n if word[i]!='A' and word[i]!='C' and word[i]!='G' and word[i]!='T':\n temp.append(i+1)\nif word[0]=='A' or word[0]=='C' or word[0]=='G' or word[0]=='T':\n temp.insert(0,0)\nif word[-1]=='A' or word[-1]=='C' or word[-1]=='G' or word[-1]=='T'... | ['Runtime Error', 'Accepted'] | ['s977457506', 's655440679'] | [3064.0, 2940.0] | [18.0, 18.0] | [523, 173] |
p03086 | u587742016 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\ncount = 0\nlens = []\n\nfor i, _ in enumerate(s):\n for c in s[i:]:\n if c in ['A', 'G', 'C', 'T']:\n count += 1\n \telse:\n break\n lens.append(count)\n count = 0\n \nprint(max(lens))\n ", "s = input()\ncount = 0\nlens = []\n\nfor i, _ in enumerate(s):\n for c in s[i:]:\n if c in ... | ['Runtime Error', 'Accepted'] | ['s491718434', 's068285402'] | [8996.0, 9108.0] | [25.0, 25.0] | [204, 206] |
p03086 | u593567568 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["import itertools\nS = input()\nL = len(S)\n\nans = 0\nfor i,j in itertools.combination(range(L),2):\n ss = S[i:j]\n ok = True\n for s in list(ss):\n if not(s == 'A' or s == 'C' or s == 'G' or s == 'T'):\n ok = False\n break\n \n if ok:\n ans = max(ans,j-i)\n \nprint(ans)\n ... | ['Runtime Error', 'Accepted'] | ['s371350191', 's985017970'] | [3060.0, 3060.0] | [18.0, 18.0] | [319, 322] |
p03086 | u596681540 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["if __name__ == '__main__':\n V = input()\n \n print(V)\n \n flg = 0\n max_v = 0\n for i in V:\n print(i)\n if i == 'A' or i=='T' or i=='G' or i=='C':\n flg += 1\n max_v = max(max_v, flg)\n else:\n flg = 0\n \n print(max_v)", "if __name__ == '__main__':\n V = input()\n \n print(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s130500571', 's983585907', 's496527537'] | [3060.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0] | [244, 245, 246] |
p03086 | u599925824 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = list(input())\nacgt = ['A', 'C', 'G', 'T']\nlengths = []\nl = 0\nfor x in S:\n if x in acgt:\n l += 1\n else:\n lengths.append(l)\n l = 0\n\nif len(lengths)==0:\n lengths.append(l)\n\nprint(lengths)\n", "S = list(input())\nacgt = ['A', 'C', 'G', 'T']\nlengths = []\nl = 0\nfor x in S:\n if x in acgt:\... | ['Wrong Answer', 'Accepted'] | ['s020111804', 's633756763'] | [2940.0, 2940.0] | [18.0, 17.0] | [201, 217] |
p03086 | u607072045 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["moji = ['A', 'C', 'G', 'T']\n#S = 'ATCODER'\nS = 'HATAGAYA'\nmax_len = 0\ntemp = 0\n\nfor s in S:\n if (s == 'A') | (s == 'C') | (s == 'G') | (s == 'T'):\n temp += 1\n else:\n if temp >= max_len:\n max_len = temp\n temp = 0\nprint(max_len)", "S = input()\nmax_len = 0\ntemp = 0\n\... | ['Wrong Answer', 'Accepted'] | ['s071449572', 's181841453'] | [2940.0, 3060.0] | [17.0, 17.0] | [264, 222] |
p03086 | u609814378 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\nans = 0 \nans_lis = [0]\n\nfor i in range(len(S)):\n if S[i] in "ACGT":\n ans = ans + 1\n if i == (len(S)-1):\n ans_lis.append(ans)\n elif S[i] not in ACGT:\n ans_lis.append(ans)\n ans = 0 \n\nprint(max(ans_lis))', "S = input()\n\nlen = 0\n\nans = []\nfor ch i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s192036634', 's568371323', 's593875332', 's762063273', 's423443246'] | [3060.0, 2940.0, 3060.0, 2940.0, 3064.0] | [18.0, 17.0, 17.0, 17.0, 18.0] | [257, 202, 239, 194, 202] |
p03086 | u610473220 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S=input()\nl=len(S)\nnum=0\nfor i in range(l):\n if S[i]==A or S[i]==G or S[i]==C or S[i]==T:\n num+=1\n elif num>ans:\n ans=num\n num=0\n else:\n num=0\nprint(ans)', 'S=input()\nl=len(S)\nnum=0\nfor i in range(l):\n if S[i]=="A" or S[i]=="G" or S[i]=="C" or S[i]=="T":\n num+=1\n elif num>ans:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s013885156', 's161781885', 's478196642', 's306959821'] | [3060.0, 3060.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0, 18.0] | [168, 176, 142, 333] |
p03086 | u614314290 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\nH = re.findall("[ACGT]+", S)\nmax_length = 0\nfor h in H:\n\tif max_length < len(h):\n\t\tmax_length = len(h)\nprint(max_length)', 'import re\nH = re.findall("[ACGT]+", input())\nprint(len(max(H, key=lambda x: len(x))) if H else 0)\n'] | ['Runtime Error', 'Accepted'] | ['s953498644', 's525212518'] | [2940.0, 3188.0] | [17.0, 19.0] | [132, 98] |
p03086 | u617203831 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S=int(input())\nm=0\ncount=0\nfor s in S:\n if s in "A":count+=1\n elif s in "C":count+=1\n elif s in "G":count+=1\n elif s in "T":count+=1\n else:count=0\n m=max(m,count)\nprint(m)', 'S=input()\nm=0\ncount=0\nfor s in S:\n if s in "A":count+=1\n elif s in "C":count+=1\n elif s in "G":count... | ['Runtime Error', 'Accepted'] | ['s496591776', 's462668151'] | [2940.0, 2940.0] | [17.0, 17.0] | [189, 184] |
p03086 | u617225232 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["# -*- coding: utf-8 -*-\n# input\n#a = int(input())\na = input()\n#a, b, c = map(int, input().split())\n#a, b, c = input().split()\no = 0\n#o = []\n\n# calc\nfor i in range(len(a)):\n t = 1\n if a[i] in ('A', 'C', 'G', 'T'):\n for j in range(i+1, len(a)):\n if a[j] in ('A', 'C', 'G', 'T'):\n ... | ['Wrong Answer', 'Accepted'] | ['s068773287', 's880792726'] | [3064.0, 3064.0] | [17.0, 17.0] | [547, 616] |
p03086 | u620846115 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['n = input()\ncount=0\nm = 0\nfor i in n:\n if s =="A" or s == "C" or s == "G" or s== "T" :\n count+=1\n else:\n m =max(m,count)\n count=0\nprint(m)', 'n = input()\ncount=0\nm = 0\nfor s in n:\n if s =="A" or s == "C" or s == "G" or s== "T" :\n count+=1\n m =max(m,count)\n else:\n count=0\nprint(... | ['Runtime Error', 'Accepted'] | ['s216391743', 's324547271'] | [8992.0, 8988.0] | [24.0, 28.0] | [149, 149] |
p03086 | u622847899 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S=input()\nmax=0\nfor i in range(len(S)):\n if S[i]=="A" or S[i]=="T" or S[i]=="C" or S[i]=="G":\n l+=1\n else:\n if max<l:\n max=l\n l=0\nprint(l)', 'S=input()\nmax=0\nfor i in range(len(S)):\n if (S[i]=="A" or S[i]=="T" or S[i]=="C" or S[i]=="G"):\n l+=1\n else:\n if max<l:\n max=l\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s046045933', 's109370586', 's872009915'] | [2940.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0] | [154, 156, 156] |
p03086 | u623687794 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\nS = S + "w"\nm = 0\nn = 0\nlst = []\nfor i in S:\n n += 1\n if i not in "ACGT":\n lst.append(n)\nfor y in range(len(lst)-1):\n if (lst[y+1] - lst[y]) > m:\n m = (lst[y+1] - lst[y])\nprint (m-1)\n \n', 'S = input()\nm = 0\nn = 0\nlst = []\nfor i in range(len(S)):\n n += 1\n if i not in "ACGT":... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s374831048', 's765616447', 's537028700'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [207, 206, 211] |
p03086 | u626228246 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = list(input())\ncnt,ans = [],0\nagct = ["A","G","C","T"]\nfor i in range(len(s)):\n if s[i] in agct:\n cnt += 1\n else:\n ans.append(cnt)\n cnt = 0\nif ans == []:\n ans.append(0)\nprint(max(ans))', 'cnt,ans = 0,[]\nagct = ["A","G","C","T"]\nfor i in range(len(s)):\n if s[i] in ag... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s144940761', 's721365031', 's640453626'] | [9028.0, 9052.0, 9032.0] | [22.0, 23.0, 27.0] | [219, 201, 216] |
p03086 | u626337957 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\n\nlen_s = len(S)\nbases = ('A', 'C,', 'G', 'T')\n\nans = 0\ncnt = 0\n\nfor i in range(len_s):\n if S[i] in bases:\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt = 0\nif cnt > 0:\n ans = max(ans, cnt)\nprint(ans)\n", "S = input()\n\nlen_s = len(S)\nbases = ('A', 'C', 'G', 'T')\n\nans = 0\ncnt ... | ['Wrong Answer', 'Accepted'] | ['s539314076', 's158314414'] | [3060.0, 3060.0] | [17.0, 17.0] | [221, 220] |
p03086 | u631277801 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = ns()\natcg = "ATCG"\n\nans = 0\ntmp = 0\nfor si in s:\n if si in atcg:\n tmp += 1\n else:\n ans = max(ans, tmp)\n tmp = 0\n \nans = max(ans, tmp)\nprint(ans)', 's = ns()\natcg = set(["A", "T", "C", "G"])\n\nans = 0\ntmp = 0\nfor si in s:\n if si in atcg:\n tmp += 1\n else:\n ans = max(ans, t... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s388738477', 's965187152', 's596487342'] | [2940.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0] | [162, 181, 184] |
p03086 | u631907864 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\nl = []\nfor i in S:\n l.append(i)\n\nc = 0\ncnt = []\nfor j in range(len(l)):\n if l[j] == 'A' or l[j] == 'T' or l[j] == 'C' or l[j] == 'G':\n c+=1\n cnt.append(c)\n else:\n cnt.append(c)\n c = 0\n\nprint(cnt)\nprint(max(cnt))\n", "S = input()\nl = []\nfor i in S:\n ... | ['Wrong Answer', 'Accepted'] | ['s890137082', 's498872667'] | [3060.0, 3060.0] | [18.0, 17.0] | [261, 261] |
p03086 | u637593381 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["A = 'ATGC'\n\nS = input()\nleng = 0\n\nfor s in S:\n k = 0\n if s in A:\n k += 1\n else:\n if k > leng:\n leng = k\n \nprint(leng)", "A = 'ATGC'\n \nS = input()\nleng = 0\nk = 0\n \nfor s in S:\n if s in A:\n k += 1\n else:\n if k > leng:\n leng = k\n k = 0\n \nprint(max(k, l... | ['Wrong Answer', 'Accepted'] | ['s619290727', 's214188967'] | [2940.0, 2940.0] | [17.0, 17.0] | [136, 156] |
p03086 | u640922335 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S=input()\nACGT=['A','C','G','T']\nans=[]\nk=0\nwhile k<len(S):\n num=0\n if S[k] in ACGT:\n num=1\n for i in range(1,len(S)-k):\n if S[k+i] in ACGT:\n num+=1\n else:\n break\n ans.append(num)\n k=+num\n\nprint(max(ans))", "S=input()\nACGT=... | ['Time Limit Exceeded', 'Accepted'] | ['s354790903', 's151265724'] | [55960.0, 3064.0] | [2106.0, 17.0] | [282, 311] |
p03086 | u642012866 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\nans = 0\nnow = 0\nfor i in S:\n if i in "ACGT":\n now += 1\n else:\n ans = max(now)\n now = 0\nprint(ans)', 'S = input()\nans = 0\nnow = 0\nfor i in S:\n if i in "ACGT":\n now += 1\n else:\n ans = max(ans,now)\n now = 0\nans = max(ans,now)\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s716496566', 's651794148'] | [2940.0, 2940.0] | [17.0, 17.0] | [120, 143] |
p03086 | u643363950 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\nSlist =\u3000list(S)\n\ni = 0\nmax = 0\nfor s in Slist:\n if s == "A" or "C" or "G" or "T":\n i += 1\n if i >= max:\n max = i\n elif:\n i = 0\n \nprint(max)', 'S = input()\n \ni = 0\nmax = 0\nfor s in S:\n if s == "A" or s=="C" or s=="G" or s=="T":\n i += 1\n if i >= max:\n ... | ['Runtime Error', 'Accepted'] | ['s903945232', 's854259018'] | [2940.0, 3060.0] | [17.0, 18.0] | [172, 160] |
p03086 | u643817184 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\n\nans, s = "", ""\n\nfor c in S:\n if c in [\'A\', \'C\', \'G\', \'T\']:\n s += c\n else:\n ans = s if len(s) > len(ans) else ans\n s = ""\n\nprint(ans)\n', "S = input()\n\nl_max, l = -1, 0\n\nfor c in S:\n if c in ['A', 'C', 'G', 'T']:\n l += 1\n else:\n l_... | ['Wrong Answer', 'Accepted'] | ['s477288211', 's487712603'] | [2940.0, 2940.0] | [18.0, 17.0] | [174, 179] |
p03086 | u645127738 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['a=input()+"o"\nb=["A","T","C","G"]\nans=0\nc=0\nfor i in range(len(a)):\n if a[i] in b\n c+=1\n else:\n if c>ans:\n ans=c\n c=0\nprint(ans)', 'a=input()+"o"\nb=["A","T","C","G"]\nans=0\nc=0\nfor i in range(len(a)):\n if a[i] in b:\n print(i)\n c+=1\n else:\n if c>ans:\n ans=c\n c=0\... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s314992797', 's622698746', 's751628995'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [144, 158, 145] |
p03086 | u648881683 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["import sys\ninput = lambda: sys.stdin.readline().rstrip() \n \ndef resolve():\n S = input()\n acgt = ['A', 'C', 'G', 'T']\n ans = 0\n for l in range(len(S)):\n for r in range(l+1, len(S)+1):\n if S[r-1] not in acgt:\n ans = max(r-1-l, ans)\n break\n \n pr... | ['Wrong Answer', 'Accepted'] | ['s751516505', 's940806362'] | [2940.0, 3060.0] | [18.0, 18.0] | [313, 457] |
p03086 | u652286295 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['def tasu(i):\n global bubun\n if i >= len(string):\n return\n elif string[i] == "A" or string[i] == "C" or string[i] == "G" or string[i] == "T":\n bubun += string[i]\n tasu(i + 1)\n\nstring = input()\n\nlst = [""]\n\nfor i in range(len(string)):\n if string[i] == "A" or string[i] == "... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s375165791', 's795514169', 's683924911'] | [3064.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0] | [458, 431, 190] |
p03086 | u652656291 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\nans = 0\nACGT = 0\nfor i in len(S):\n if S[i]=='A' or S[i]=='G' or A[i]=='C' or A[i]=='T':\n ACGT += 1\n else:\n ans = max(ans,ACGT)\n ACGT = 0\nprint(ans)", "S = input()\nN = len(S)\nans = 0\nfor i in range(N):\nfor j in range(i, N):\nif all('ACGT'.count(c) == 1 for c in S[i : j + 1]):\nprint... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s505492503', 's658916904', 's992848740', 's845891505'] | [3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [170, 160, 171, 176] |
p03086 | u656330453 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s='A'\nclist=['A','C','G','T']\ncount=0\na=[]\nfor i in s:\n if i in clist:\n count+=1\n else:\n a.append(count)\n count=0\na.append(count)\nprint(max(a))", "s = list(input())\nacgt = ['A', 'C', 'G', 'T']\ncnt = 0\nans = 0\nfor i in s:\n if i in acgt:\n cnt += 1\n else:\n cnt = 0\n ans = max(cnt, ... | ['Wrong Answer', 'Accepted'] | ['s705460949', 's104188583'] | [3060.0, 8876.0] | [17.0, 27.0] | [154, 160] |
p03086 | u657875821 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\n\nmax_len = 0\nmemo_len = 0\nflag = True\n\nfor i in range(len(S)):\n if S[i]=="A" or S[i]=="T" or S[i]=="G" or S[i]=="C":\n if flag == True:\n memo_len += 1\n else:\n max_len = memo_len\n memo_len = 1\n flag = True\n else:\n flag = F... | ['Wrong Answer', 'Accepted'] | ['s348241501', 's147785189'] | [3060.0, 3064.0] | [17.0, 17.0] | [332, 408] |
p03086 | u661576386 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["a = input()\n\nb = 'ACGT'\nans =0\nfor i in a:\n print(i)\n now = 0\n for j in a:\n if j in b:\n now += 1\n print(now)\n ans = max(ans,now)\n else:\n now=0\nprint(ans)", "a = input()\n\nb = 'ACGT'\nans =0\nfor i in a:\n now = 0\n for j in a:\n ... | ['Wrong Answer', 'Accepted'] | ['s822288224', 's788936357'] | [3060.0, 2940.0] | [18.0, 17.0] | [220, 184] |
p03086 | u661812507 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S=input()\nflag=0\ncount=0\nbegin=0\nmax_begin=0\nmax_count=0\nfor i in range(len(S)):\n if flag==0:\n \n if S[i]=="A" or S[i]=="T" or S[i]=="C" or S[i]=="G":\n begin=i\n count+=1\n flag=1\n \n else:\n if S[i]=="A" or S[i]=="T" or S[i]=="C" or S[i... | ['Wrong Answer', 'Accepted'] | ['s387457461', 's052436797'] | [3064.0, 3064.0] | [18.0, 18.0] | [514, 552] |
p03086 | u662449766 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["import re\nlen(max(re.sub(r'[^ACGT]', ' ', input()).split()))\n", "len(max(re.sub(r'[^ACGT]', ' ', input()).split()))", "row = input()\nlenght = len(row)\nmax_moji = 0\nfor i in range(lenght):\n if row[i] in 'ACGT':\n moji = 1\n for j in range(i + 1, lenght):\n if row[j] in 'ACGT':\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s574792779', 's603807172', 's069818403'] | [3188.0, 2940.0, 2940.0] | [19.0, 17.0, 17.0] | [61, 50, 366] |
p03086 | u663014688 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\ns = list(s)\nans = 0\nmaxlen = 0\nacgt = []\n\nfor i in range(len(s)):\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':\n acgt.append(s[i])\n ans = len(acgt)\n if ans > maxlen:\n ans = maxlen\n\nprint(ans)\n", "s = input()\nn = len(s)\nans = 0\nfor i in range(n):\... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s160398761', 's255779459', 's690365480', 's896921003'] | [3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [247, 180, 180, 181] |
p03086 | u663438907 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = list(input())\nACGT = ['A','C','G','T']\n\ntans = ''\nans = ''\n\nfor i in range(len(S)):\n if S[i] in ACGT:\n tans = tans + S[i]\n else:\n if len(ans) < len(tans):\n ans = tans\n tans = ''\n\nprint(ans)\n ", "S = list(input())\nACGT = ['A','C','G','T']\n \ntans = 0\nans = 0\n \nfor i in range(le... | ['Wrong Answer', 'Accepted'] | ['s440849990', 's282778361'] | [2940.0, 3060.0] | [18.0, 17.0] | [212, 193] |
p03086 | u664907598 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s =str(input())\nans = 0\naa = []\nfor i in range(1,len(s)):\n if s[i] in ['A', 'C', 'G', 'T']:\n if s[i-1] in ['A', 'C', 'G', 'T']:\n ans += 1\n else:ans = 1\n else:\n aa.append(ans)\n ans = 0\nprint(max(aa))", "s =str(input())\nans = 0\naa = []\nif s[0] in ['A', 'C', 'G'... | ['Runtime Error', 'Accepted'] | ['s540418028', 's329843832'] | [3060.0, 3064.0] | [17.0, 17.0] | [243, 302] |
p03086 | u665038048 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\nlist_atgc = ["A", "C", "G", "T"]\ndemand_list = []\nfor i in range(len(S)):\n if S[i] in list_atgc:\n for j in range(i, len(S)-i):\n if S[j] in list_atgc:\n demand_list.append(S[i:j+1])\nprint(max(demand_list, key=len))', 'S = input()\nlist_atgc = ["A", "C", "G", "T"]\... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s317546440', 's736999915', 's645723338'] | [3060.0, 3060.0, 3064.0] | [18.0, 17.0, 17.0] | [260, 363, 485] |
p03086 | u666964944 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\npre = False\nans = ''\nm = 0\nfor i in s:\n if i==s[0] and i in 'ACGT':\n ans+=i\n pre=True\n continue\n if i in 'ACGT' and pre == True:\n ans+=i\n pre=True\n else:\n pre=False\n m = max(m, len(ans))\n ans=''\nprint(len(ans))", "s = input()\nans = ''\nm = 0\nfor i in s:\n if i... | ['Wrong Answer', 'Accepted'] | ['s582785749', 's136603422'] | [9024.0, 9072.0] | [26.0, 27.0] | [249, 165] |
p03086 | u668503853 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s=input()\nn=len(s)\nlist=["A","C","G","T"]\nnew=[]\na=0\nfor i in range(n):\n if s[i] in list:\n a+=1\n if i == n-1:\n new.append(a)\n if s[i] not in list:\n new.append(a)\n a=0\nprint(new)\n', 's=input()\nn=len(s)\nlist=["A","C","G","T"]\nnew=[]\na=0\nfor i in range(n):\n if s[i] in list:\n a... | ['Wrong Answer', 'Accepted'] | ['s343280086', 's283340675'] | [3060.0, 3064.0] | [17.0, 17.0] | [197, 201] |
p03086 | u670567845 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\nfor i in range(len(S)):\n print(S[i])', 'S = input()\nlistS = []\nfor i in range(len(S)):\n listS.append(S[i])\n \n\ndef check_ACGT(array):\n cnt = 0\n for i, elm in enumerate(array):\n if elm not in ["A", "C", "G", "T"]:\n cnt += 1\n return True if cnt == 0 else False\n\nans = 0\nfor i in ... | ['Wrong Answer', 'Accepted'] | ['s652465095', 's244139690'] | [2940.0, 3064.0] | [17.0, 17.0] | [49, 438] |
p03086 | u672882146 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = str(input())\nsam = ['A','C','G','T']\nbox = []\ncount = 0\nfor i in range(len(S)):\n if i == 0 and S[i] in sam:\n count+=1\n elif i > 0:\n if count == 0 and S[i] in sam:\n count+=1\n elif S[i] in sam and S[i-1] in sam:\n count+=1\n else:\n box.ap... | ['Wrong Answer', 'Accepted'] | ['s830626888', 's869463379'] | [3060.0, 3064.0] | [17.0, 17.0] | [367, 388] |
p03086 | u673338219 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = str(input())\ns += "B"\nl = len(s)\nc = 0\nmx = 0\nfor i in range(l):\n if s[i] in ["A","G","C","T"]:\n c += 1\n else:\n if c > mx:\n mx = c\n c = 0\n else:\n c = 0\n \n ', 's = str(input())\ns += "B"\nl = len(s)\nc = 0\nmx = 0\nfor i in range(l):\n if s[i] in ["A","G","C","T"]:\n... | ['Wrong Answer', 'Accepted'] | ['s332059956', 's574034829'] | [2940.0, 3060.0] | [17.0, 17.0] | [191, 199] |
p03086 | u673625102 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\n\natgc = 'ATGC'\ncount= 0\nmax_count = 0\n\nfor i in range(len(s)):\n if s[i] in atgc:\n print(s[i])\n count += 1\n else:\n if max_count < count:\n max_count = count\n count = 0\nif max_count < count:\n max_count = count\nprint(max_count)", "s = input()\n\n... | ['Wrong Answer', 'Accepted'] | ['s711409419', 's908458180'] | [3060.0, 2940.0] | [18.0, 17.0] | [283, 215] |
p03086 | u674951726 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\n\nACGT = ['A','C','G','T']\n\nnum_list = [0]\nfor i in range(len(S)):\n if S[i] not in ACGT:\n num_list.append(i)\n\nnum_list.append(len(S)+1)\n\ndif_list = []\nfor i in range(len(num_list)-1):\n dif_list.append(num_list[i+1]-num_list[i])\n \nprint(max(dif_list)-1)", "S = input()\n\nACGT = ['A','C'... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s002972925', 's242931051', 's641650359'] | [3064.0, 3064.0, 3064.0] | [19.0, 17.0, 17.0] | [269, 267, 268] |
p03086 | u677523557 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\nN = len(S)\n\n\nAGTC = ['A', 'G', 'T', 'C']\npart_l = []\nfor i in range(N):\n\n if S[i] in AGTC:\n if i == 0:\n part = [S[i]]\n elif S[i-1] in AGTC:\n part.append(S[i])\n else:\n part... | ['Wrong Answer', 'Accepted'] | ['s754098935', 's497434907'] | [3064.0, 3064.0] | [18.0, 18.0] | [674, 660] |
p03086 | u681917640 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = input()\n\nmax_length = 0\nfor i in range(len(S)):\n if S[i] in "ACGT":\n if i == len(S) - 1:\n length = 1\n else:\n for j in range(i+1, len(S)):\n length = j - i + 1\n if S[j] in "ACGT":\n continue\n else:\n break\n\n if length > max_length:\n max_l... | ['Wrong Answer', 'Accepted'] | ['s708326036', 's056590483'] | [3060.0, 3060.0] | [17.0, 17.0] | [335, 343] |
p03086 | u685662874 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s=input()\nmax=0\ncnt=0\nfor _ in s:\n if _ == 'A' or _ == 'G' or _ == 'T' or _ == 'C':\n cnt+=1\n else:\n if max < cnt:\n max = cnt\n cnt=0\n ", "s=input()\nmax=0\ncnt=0\nfor _ in s:\n if _ in ['A','G','T','C']:\n cnt+=1\n if max < cnt:\n max ... | ['Wrong Answer', 'Accepted'] | ['s532503152', 's985645141'] | [2940.0, 2940.0] | [17.0, 17.0] | [179, 158] |
p03086 | u686036872 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['import re\n\nS=input()\nans = sorted((re.findall("[AGCT]*", S)), reverse=True, key=len)\nprint(ans[0])', 'import re\nX=sorted(re.findall("[ACGT]+",input()), len=True)\nprint(len(X[-1]))', 'import re\n\nS=input()\nans = sorted((re.findall("[AGCT]*", S), reverse=True, key=len)\nprint(ans[0])', 'import re\n\nS=input()\n... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s646884533', 's673458428', 's694536008', 's913599200', 's917277335', 's933743433', 's957400185', 's314676610'] | [3188.0, 3188.0, 2940.0, 2940.0, 3188.0, 3188.0, 3188.0, 3188.0] | [19.0, 19.0, 17.0, 17.0, 19.0, 19.0, 19.0, 19.0] | [98, 77, 97, 102, 73, 67, 75, 72] |
p03086 | u686751625 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\nN = len(S)\nans = 0\nfor i in range(N):\nfor j in range(i, N):\nif all('ACGT'.count(c) == 1 for c in S[i : j + 1]):\nans = max(ans, j - i + 1)\nprint(ans)", "S = input()\nN = len(S)\nans = 0\nfor i in range(N):\n\tfor j in range(i, N):\n\t\tif all('ACGT'.count(c) == 1 for c in S[i : j + 1]):\n\t\t\tans =... | ['Runtime Error', 'Accepted'] | ['s956348979', 's600062022'] | [2940.0, 3060.0] | [17.0, 17.0] | [160, 166] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.