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 | u234189749 | 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())\n\nc = 0\nans = 0\n\nfor i in S:\n if i=='A' or i=='C' or i=='G' or i=='T':\n c += 1\n if ans < c:\n ans = c\n else:\n c = 0\n\nprint(ans)", "S = list(input())\nL = ['A','C','G','T']\nc = 0\nans = 0\n\nfor i in S:\n if i in L:\n c += 1\n ans = max(a... | ['Runtime Error', 'Accepted'] | ['s316132616', 's015111104'] | [2940.0, 2940.0] | [17.0, 17.0] | [177, 158] |
p03086 | u235376569 | 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+="b"\nprint(S)\nans=0\nnow=0\nl=[i for i in "ACGT"]\n\nfor i in range(len(S)):\n if S[i] in l:\n now+=1\n else:\n ans=max(ans,now)\n now=0\n\nprint(ans)', 's=input()\ncnt=0\nans=0\nlit=["A","C","G","T"]\nfor i in range(len(s)):\n if s[i] in lit:\n cnt+=1\n else:\n ans=max(cnt,ans)\n ... | ['Wrong Answer', 'Accepted'] | ['s422814242', 's715707719'] | [3060.0, 3060.0] | [17.0, 19.0] | [162, 163] |
p03086 | u236823931 | 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 s = input()\n ss = all_part_string(s)\n o = [e for e in ss if contains_only(e, "ACGT")]\n print(0 if len(sorted(o, key=len, reverse=True)) == 0 else len(sorted(o, key=len, reverse=True)[0]))', 'def all_part_string(s):\n r = range(len(s))\n return [s[i:j+1] for i in r f... | ['Runtime Error', 'Accepted'] | ['s042183634', 's593216218'] | [3060.0, 3064.0] | [17.0, 18.0] | [227, 446] |
p03086 | u239316561 | 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()\nstart = 0\nmax = 0\ncount = 0\nfor i in range(len(S)):\n print(count,max)\n if(S[i] != "A")&(S[i] != "T")&(S[i] != "G")&(S[i] != "C"):\n if max < count:\n max = count\n count = 0\n else:\n count = count + 1\nif ((S[i] == "A")|(S[i] == "T")|(S[i] == "G")|(S[i] == "... | ['Wrong Answer', 'Accepted'] | ['s906953685', 's030779503'] | [3064.0, 3064.0] | [17.0, 17.0] | [352, 331] |
p03086 | u243002383 | 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()\npat = r'[ATCG]+'\nparts = re.findall(pat,S)\nprint 0 if len(parts)==0 else max([len(part) for part in parts])", "import re\n\nS=input()\npat = r'[ATCG]+'\nparts = re.findall(pat,S)\nif len(parts)==0:\n print(0) \nelse:\n print(max([len(part) for part in parts]))"] | ['Runtime Error', 'Accepted'] | ['s071092502', 's927980649'] | [2940.0, 3188.0] | [17.0, 20.0] | [128, 143] |
p03086 | u243572357 | 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`. | ["judge = ['A','G', 'C', 'T']\nstring_list = [i in judge for i in input()]\nstring = ''.join(string_list).split('False')\nprint(max([i.count('True') for i in string]))\n", "count = 0\ncounter = 0\nfor i in input():\n if i in ['A', 'G', 'C', 'T']:\n counter += 1\n count = max(count, counter)\n else:\n counter... | ['Runtime Error', 'Accepted'] | ['s662315943', 's653745592'] | [2940.0, 2940.0] | [18.0, 17.0] | [163, 157] |
p03086 | u244836567 | 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()\nb=0\nc=0\nfor i in range(len(a)):\n if a[i]=="A" or a[i]=="C" or a[i]=="G" or a[i]=="T":\n b=b+1\n if a[i]!="A" and a[i]!="C" or a[i]!="G" or a[i]!="T":\n b=0\n if c<b:\n c=b\nprint(c)', 'a=input()\nb=0\nc=0\nfor i in range(len(a)):\n if a[i]=="A" or a[i]=="C" or a[i]=="G" or a[i]=="T":\n b... | ['Wrong Answer', 'Accepted'] | ['s650454543', 's143109344'] | [9092.0, 9120.0] | [29.0, 26.0] | [197, 203] |
p03086 | u247830763 | 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())\nmx = 0\nfor i in range(n):\n for j in range(i+1,n+1):\n cnt = j-i-1\n p = 0\n for k in list(s[i:j]):\n if k in ["A","C","G","T"]:\n p += 1\n if p == cnt:\n if p > mx:\n mx = p\nprint(mx)', 's = str(input())\nmx = 0\nf... | ['Runtime Error', 'Accepted'] | ['s169516735', 's767087244'] | [8976.0, 9116.0] | [23.0, 26.0] | [275, 284] |
p03086 | u249447366 | 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()\nl = re.findall('[ACGT]*', s)\nprint(l)", "import re\n\ns = input()\nl = re.findall('[ACGT]*', s)\nprint(len(max(l,key=len)))"] | ['Wrong Answer', 'Accepted'] | ['s966880489', 's728704388'] | [3188.0, 3188.0] | [19.0, 19.0] | [60, 78] |
p03086 | u250061066 | 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`. | ["L = ['A','C','G','T']\nS = list(input()) \nS = ['1' if ((i in L) == True) else '0' for i in S]\nS = ''.join(S_list)\nS = S.split('0')\nS = [len(i) for i in S]\nprint(max(S))", "L = ['A','C','G','T']\nS = list(input()) \nS = ['1' if ((i in L) == True) else '0' for i in S]\nS = ''.join(S)\nS = S.split('0')\nS = [len(i)... | ['Runtime Error', 'Accepted'] | ['s812807523', 's288733171'] | [3060.0, 3060.0] | [17.0, 17.0] | [167, 162] |
p03086 | u252828980 | 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())\nN = len(S)\nli = []\nagct = ["A","G","C","T"] \nans=0\nfor i in range(N):\n if S[i] in agct:\n li.append(1)\n else:\n li.append(0)\n\nfrom itertools import groupby\n\ndst = [sum(1 for r in s) for t, s in groupby(li, key=lambda x: x == 1)]\nprint(max(dst))', 's = input()\nL = "... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s044060406', 's086290248', 's518200021'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [282, 198, 301] |
p03086 | u252964975 | 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())\nmax_count = 0\ncount = 0\nfor i in range(len(S)):\n if S[i] == 'A' or S[i] == 'AT' or S[i] == 'G' or S[i] == 'C':\n count = count + 1\n if count > max_count:\n max_count = count\n else:\n count = 0\nprint(count)", "S=str(input())\nmax_count = 0\ncount = 0\nfor i in range(len(S)):\n if... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s421837409', 's950120337', 's058258755'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [233, 238, 237] |
p03086 | u259861571 | 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()\na = 0\nb = 0\nfor i in len(s):\n if i in 'ATGC':\n ans += 1\n else:\n b = max(a, b)\n a = 0\nprint(max(a, b))", "s = input()\na = 0\nb = 0\nfor i in len(s):\n if i in 'ATGC':\n a += 1\n else:\n b = max(a, b)\n a = 0\nprint(max(a, b))", "s = input()\na... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s883096974', 's946031012', 's213869458'] | [2940.0, 3188.0, 2940.0] | [17.0, 19.0, 17.0] | [140, 138, 133] |
p03086 | u263188345 | 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_l = 0\ntemp_l = 0\n\nfor s in S:\n if s == 'A' or s=='G' or s=='C' or s=='T':\n temp_l += 1\n \n else:\n \tmax_l = max(max_l, temp_l)\n temp_l = 0\n\nprint(max_l)\n", "S = input()\nmax_l = 0\ntemp_l = 0\n\nfor s in S:\n if s == 'A' or s=='G' or s=='C' or s=='T':\n ... | ['Runtime Error', 'Accepted'] | ['s545432046', 's859243836'] | [2940.0, 2940.0] | [17.0, 18.0] | [199, 191] |
p03086 | u265401619 | 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\ncount_list=[]\nseq=["A","T","G","C"]\nfor base in ref:\n if base in seq:\n count +=1\n else:\n count_list.append(count)\n count = 0\n count_list.append(count)\nprint(max(count_list))', "s = input()\nlist0 = ['A', 'C', 'G', 'T']\nlist1 = []\nfrag = 0\nfor i in s:\n if... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s040165423', 's583182458', 's948192976'] | [3060.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0] | [221, 201, 219] |
p03086 | u266171694 | 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\ncount = 0\n\nfor i in range(len(s)):\n if s[i] in ['A', 'C', 'G', 'T']:\n count += 1\n else:\n if count > max:\n max = count\n count = 0\n\nprint(max(max, count))\n", "s = input()\nmax_count = 0\ncount = 0\n\nfor i in range(len(s)):\n if s[i] in ['A',... | ['Runtime Error', 'Accepted'] | ['s600132984', 's611719696'] | [2940.0, 2940.0] | [17.0, 17.0] | [215, 239] |
p03086 | u266569040 | 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())\nst = [0]*len(S)\nstring = "ACGT"\nfor i in range(len(S)):\n if S[i] in string:\n st[i] += 1\n\nst_1 = [1]*len(S)\n\ncount = []\ntemp = 0\n\nfor i in range(len(st)):\n if st[i] == st_1[i]:\n temp += 1\n else:\n count.append(temp)\n temp = 0\n if i+1 == len(st)... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s407172290', 's979676163', 's635930342'] | [3064.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0] | [398, 364, 399] |
p03086 | u268884249 | 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 = ""\nc = ""\nfor i in range(len(a)):\n if(a[i] == "A" or a[i] == "G" or a[i] == "T" or a[i] == "C"):\n b += a[i]\n else:\n if(len(b)>len(c)):\n c = b\n b = ""\nprint(c)', 'a = list(input())\nb = ""\nc = ""\nfor i in range(len(a)):\n if(a[i] == "A" or a[i] == "G" or a[i] == "T"... | ['Wrong Answer', 'Accepted'] | ['s935642518', 's167265332'] | [3060.0, 3060.0] | [17.0, 17.0] | [198, 203] |
p03086 | u272525952 | 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=int(input())\ncount=0\nfor i in range(1,n+1):\n if i%2==1:\n yakusuu=0\n for j in range(1,int((i**0.5)//1)+1):\n if i%j==0:\n if j**2==i:\n yakusuu+=1\n else:\n yakusuu+=2\n if yakusuu==8:\n count+=1\np... | ['Runtime Error', 'Accepted'] | ['s319215712', 's582294497'] | [3060.0, 3064.0] | [18.0, 17.0] | [316, 242] |
p03086 | u273010357 | 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)\nACGT = []\nothers = 'BDEFHIJKLMNOPQRSUVWXYZ'\nfor i in range(N):\n fl = True\n for j in range(i+1,N+1):\n tmp_S = S[i:j]\n M = len(tmp_S)\n for k in range(M):\n if tmp_S[k] in others:\n fl = False\n if fl==False:\n break\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s128072161', 's548649112', 's968347909'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [430, 430, 418] |
p03086 | u276250981 | 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())\nc,max = 0,0\nfor i in range(0,len(s)):\n if s[i] in "ATCG":\n c=1\n for j in range(i,len(s)-1):\n if s[j] in "ATCG":\n if c!=1:\n c+=1\n else:\n break\n if max < c:\n max=c \nprint(max) ', 's = list(input())\nc,max = 0,0\nfor i in range(0,len(s)):\n ... | ['Wrong Answer', 'Accepted'] | ['s458779695', 's202552197'] | [3060.0, 3060.0] | [17.0, 17.0] | [241, 239] |
p03086 | u277641173 | 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()\nle=len(s)\nlis=[]\nfor i in range(0,le):\n if s[i]!="A" and s[i]!="" and s[i]!="T" and s[i]!="G":\n lis.append(i)\nlo=0\nfor j in range(0,len(lis)-1):\n if lis[j+1]-lis[j]-1>=lo:\n lo=lis[j+1]-lis[j]-1\nprint(lo)', 's=input()\nle=len(s)\nlis=[]\nfor i in range(0,le):\n if s[i]!="A" and s[i]!="C" a... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s155108561', 's376906399', 's462610198', 's513949588', 's737692126', 's761946884', 's954227570', 's221465294'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 18.0, 19.0] | [221, 288, 287, 325, 287, 299, 299, 330] |
p03086 | u283520984 | 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=[]\nfor i in range(n):\n cnt=0\n for j in range(j,n):\n if S[j]=='A' or S[j]=='C' or S[j]=='G' or S[j]=='T':\n cnt+=1\n ans.append(cnt)\nprint(max(ans))", 'S=input()\nH=[]\nM=len(S)\nan=[]\nj=0\nfor i in range(M):\n\tif S[i]=="A":\n\telif S[i]==\'C\':\n\telif S[i]==\'G\':\n\telif S... | ['Runtime Error', 'Runtime Error', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s159644452', 's301492614', 's466492219', 's622024157', 's252068141'] | [3060.0, 2940.0, 2940.0, 3060.0, 2940.0] | [19.0, 17.0, 2104.0, 2104.0, 17.0] | [179, 234, 167, 164, 147] |
p03086 | u285891772 | 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, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\nfrom operator import itemgette... | ['Wrong Answer', 'Accepted'] | ['s979467336', 's160041695'] | [22100.0, 13008.0] | [337.0, 163.0] | [1061, 1062] |
p03086 | u287132915 | 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\nmax_L = 0\n\nfor i in len(S):\n s = S[i]\n TF = any(['A'==s, 'C'==s, 'G'==s, 'T'==s])\n if TF:\n L += 1\n elif L >= max_L:\n max_L = L\n L = 0\n\nprint(max_L)", "S = input()\nL = 0\nmax_L = 0\n \nfor i in range(len(S)):\n s = S[i]\n TF = any(['A' in s, 'C' in s, 'G' in s, 'T' in s])... | ['Runtime Error', 'Accepted'] | ['s805118455', 's180161419'] | [3060.0, 3060.0] | [17.0, 18.0] | [178, 231] |
p03086 | u294385082 | 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\nlenmax = 0\n \nfor i in s:\n if i in "ACGT":\n l += 1\n else:\n lenmax = max(lenmax,l)\n l = 0\nlenmax = max(lenmax,l)\nprint(lenmaax)', 's = input()\nl = 0\nlenmax = 0\n\nfor i in s:\n if i in "ACGT":\n l += 1\n else:\n lenmax = max(lenmax,l)\n l = 0\nprint(l)', 's = input()... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s326006709', 's545878987', 's218992089'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [154, 124, 153] |
p03086 | u295294832 | 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=0\nb=0\nfor i in range(len(N)):\n\tif N[i] == 'A' or N[i] == 'T' or N[i] == 'C' or N[i] == 'G' :\n\t\ta+=1\n\telse: \n\t\tif a > b: b = a\n\t\ta=0\n\nprint(b)\n", "N = input()\na=0\nb=0\nfor i in range(len(N)):\n\tif N[i] == 'A' or N[i] == 'T' or N[i] == 'C' or N[i] == 'G' :\n\t\ta+=1\n\telse: \n\t\tif a > b:... | ['Runtime Error', 'Accepted'] | ['s734595175', 's499179017'] | [2940.0, 2940.0] | [17.0, 17.0] | [147, 166] |
p03086 | u297667660 | 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\ns = input()\nn = len(s)\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)", "#B\ns = 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:... | ['Runtime Error', 'Accepted'] | ['s773632195', 's855332835'] | [2940.0, 3060.0] | [17.0, 18.0] | [174, 182] |
p03086 | u297757054 | 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 main():\n *S, = input()\n count = 0\n max = 0\n for i in S:\n print(i)\n if i == "A" or i == "C" or i == "G" or i == "T":\n count += 1\n else:\n if max < count:\n max = count\n count = 0\n print(max)\nmain()\n', 'def main():\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s100196561', 's483736020', 's463434980'] | [2940.0, 2940.0, 3188.0] | [18.0, 17.0, 18.0] | [283, 277, 293] |
p03086 | u302292660 | 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\ncnt_list = []\nfor i in range(len(s)):\n if s[i] == "A" or "C" or "G" or "T":\n cnt +=1\n else:\n cnt_list.append(cnt)\n cnt = 0\nprint(max(cnt_list))\n ', 's = input()\nacgt = ["A","C","G","T"]\ncnt = 0\ncnt_list = []\nfor i in range(len(s)):\n if s[i] in acgt:\n cnt +=1\n... | ['Runtime Error', 'Accepted'] | ['s315492387', 's229276009'] | [2940.0, 3060.0] | [17.0, 18.0] | [177, 254] |
p03086 | u305018585 | 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 \nS = input()\n\np = re.compile('[ATCG]+')\nf = p.finditer\n\ncandidate = [i.span()[1]- i.span()[0] for i in f]\nif candidate == [] :\n print(0)\nelse :\n print(max(candidate))", "import re \nS = input()\n \np = re.compile('[ATCG]+')\nf = p.finditer(S)\n \ncandidate = [i.span()[1]- i.span()[0] for i i... | ['Runtime Error', 'Accepted'] | ['s243739053', 's487304413'] | [3188.0, 3188.0] | [19.0, 19.0] | [182, 187] |
p03086 | u305366205 | 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`. | ['result = 0\ncnt = 0\nb = list(input())\nfor str in b:\n if b == "A" or b == "T" or b == "C" or b == "G":\n cnt += 1\n else:\n result = max(result,cnt)\n cnt = 0\n', 'result = 0\ncnt = 0\nb = list(input())\nfor str in b:\n if str == "A" or b == "T" or b == "C" or b == "G":\n cnt +=... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s347960210', 's794004265', 's391498990'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [180, 182, 202] |
p03086 | u309457741 | 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()\nagct = ['A','G','C','T']\ncount = 0\nmax_count = 0\nfor i in len(S):\n if S[i] in agct:\n count += 1\n else:\n max_count = max(count,max_count)\nprint(max_count)", 'L = ["A","T","C","G"]\nS = input()\nS += "B"\ncount = 0\nmaxcount = 0\nfor i in S:\n if i in L:\n count += 1\n else:\n maxco... | ['Runtime Error', 'Accepted'] | ['s888105603', 's992121121'] | [2940.0, 3064.0] | [18.0, 17.0] | [173, 178] |
p03086 | u314089899 | 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`. | ["#122c\nN,Q = map(int, input().split())\nS = str(input())\n\nfor _ in range(Q):\n l,r = map(int, input().split())\n print(S[l-1:r].count('AC'))", 'S = list(input())\nACGT = set(["A","C","G","T"])\nans = 0\nacgt_length = 0\n\nfor i in range(len(S)):\n if S[i] in ACGT:\n acgt_length += 1\n else:\n ans = ma... | ['Runtime Error', 'Accepted'] | ['s906480651', 's416878354'] | [2940.0, 3060.0] | [17.0, 17.0] | [142, 239] |
p03086 | u314825579 | 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\nactg_list=[]\nfor i in range(len(S)):\n for j in range(i+1,len(S)+1):\n slen=len(S[i:j])\n temp=0\n for s in S[i:j] :\n if s=='A' or s=='C' or s=='G' or s== 'T':\n temp+=1 \n if temp==slen:\n atcg_list.append(slen)\n \nprint(max(atcg_list))", "S=input()\n \nacgt_li... | ['Runtime Error', 'Accepted'] | ['s028735955', 's201523268'] | [9040.0, 9080.0] | [30.0, 27.0] | [280, 282] |
p03086 | u317779196 | 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())\nn = len(s)\n\nans = 0\nfor i in range(n):\n for j in range(i,n):\n \n \n \n if all('ACGT'.count(c) == 1 for c in s[i:j+1]):\n ans = max(ans, j-1+1)\nprint(ans)\n", "s = str(input())\nn = len(s)\n\nans = 0\nfor i in range(n):\n for j in range(i,n):\n ... | ['Wrong Answer', 'Accepted'] | ['s911314948', 's324554172'] | [2940.0, 3060.0] | [17.0, 17.0] | [399, 398] |
p03086 | u318427318 | 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\ninput=sys.stdin.readline\n\ndef main():\n strings = input()\n answers=[]\n counter=0\n\n for string in strings:\n if "A" in string or "C" in string or "G" in string or "T" in string:\n counter+=1\n else:\n answers.append(counter)\n ... | ['Wrong Answer', 'Accepted'] | ['s575967905', 's004056038'] | [9012.0, 8992.0] | [27.0, 27.0] | [343, 381] |
p03086 | u322297639 | 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 = list(input())\nn = len(s_list)\ndic = {"A", "C", "G", "T"}\nans = 0\ntmp_ans = 0\nfor i in range(n):\n for j in range(i, n):\n print(s_list[i], s_list[j], tmp_ans, ans)\n if s_list[j] in dic:\n tmp_ans += 1\n else:\n ans = max(ans, tmp_ans)\n tmp_ans =... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s248022875', 's381396901', 's495313995'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [402, 347, 376] |
p03086 | u325264482 | 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\nalp = 'ACGT'\n\ncnt = []\n\nfor i in range(0, N):\n for j in range(i, N+1):\n tmp = S[i:j]\n flg = 0\n for a in alp:\n if a in tmp:\n flg = 1\n if flg:\n cnt.append(len(tmp))\n\nprint(max(cnt))\n", "S = input()\nN = len(S)\... | ['Runtime Error', 'Accepted'] | ['s383403391', 's930021200'] | [3060.0, 2940.0] | [17.0, 17.0] | [272, 201] |
p03086 | u329036729 | 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\nma = 0\nfor i in range(len(s)):\n for j in range(0,len(s)-i+1):\n sbstr = s[i:i+j+1]\n print(i,j,sbstr)\n is_good = True\n for c in sbstr:\n if c not in "AGCT":\n is_good = False\n break\n if is_good:\n if (len(sb... | ['Wrong Answer', 'Accepted'] | ['s565301270', 's328407956'] | [3060.0, 2940.0] | [17.0, 17.0] | [361, 360] |
p03086 | u329407311 | 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 = list(S)\n\nans = 0\narr = []\nfor i in range(len(List)):\n if List[i] == "A" or List[i] == "C" or List[i] == "G" or List[i] == "T":\n ans += 1\n else:\n arr.appned(ans)\n ans = 0\n \nprint(max(arr))', 'S = input()\nList = list(S)\n\nans = 0\narr = []\nfor i in range(len(List)):\n if... | ['Runtime Error', 'Accepted'] | ['s046795692', 's492763832'] | [3064.0, 3060.0] | [17.0, 18.0] | [220, 238] |
p03086 | u331128419 | 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 = 0\nfor i in range(len(S)-1):\n for j in range(i+1, len(S)+1):\n count = 0\n print(S[i:j])\n for char in S[i:j]:\n if char == 'A' or char == 'C' or char == 'G' or char == 'T':\n count += 1\n else:\n count = 0\n ... | ['Wrong Answer', 'Accepted'] | ['s273914856', 's719238830'] | [3060.0, 3064.0] | [17.0, 17.0] | [375, 492] |
p03086 | u331381193 | 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\nif s=='A': \n\tres='T'\nelse:\n\tif s=='T':\n\t\tres='A'\n\telse:\n\t\tif s=='G':\n\t\t\tres='C'\n\t\telse:\n\t\t\tres='G'\n\nprint(res)", "s=input()\n\nn=len(s)\nac=[0]*(n+1)\n\nfor i in range(n):\n\tif s[i]=='A' or s[i]=='T' or s[i]=='G' or s[i]=='C':\n\t\tac[i+1]=ac[i]+1\n\nprint(max(ac))"] | ['Wrong Answer', 'Accepted'] | ['s130836992', 's015521885'] | [2940.0, 3060.0] | [19.0, 17.0] | [121, 140] |
p03086 | u331997680 | 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())\nfor i in range(len(N)+1):\n if N[i] in'ACGT':\n N[i] += 1\n N[i+1] = N[i]\n else:\n N[i] = 0\nprint(max(N))\n", "N = list(input)\nfor i in range(len(N)):\n if N[i] in'ACGT':\n N[i] += 1\n N[i+1] = N[i]\nprint(max(N))", "N = list(input())\nN.appnd('Z')\nfor i in range(len(N)-1):\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s123427024', 's479391736', 's672440103', 's747039472', 's931003838', 's742239561'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0, 17.0, 18.0] | [131, 105, 144, 142, 128, 153] |
p03086 | u337080722 | 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_acgt_len = 0\n\nfor i in range(len(s)):\n current_str = s[i:]\n\n for j in reversed(range(1, len(current_str))):\n print('searching: {}'.format(current_str[:j]))\n acgt_count = 0\n acgt_count += current_str[:j].count('A')\n acgt_count += current_str[:j].count('G')\n ... | ['Wrong Answer', 'Accepted'] | ['s422082453', 's851120188'] | [3064.0, 3064.0] | [17.0, 17.0] | [529, 477] |
p03086 | u337851472 | 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`. | ['enki = {"A":"T", "C":"G", "G":"C", "T":"A"}\nprint(enki[str(input())])\n', 'S = input()\ncount = 0\nans = 0\nfor s in S:\n if s in "ACGT":\n count += 1\n else:\n if ans < count:\n ans = count\n count = 0\n if ans < count:\n ans = count\n \nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s645692413', 's323656050'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 217] |
p03086 | u339550873 | 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`. | ["#! /usr/bin/env python3\n# -*- coding: utf-8 -*-\nS = list(input())\nls =[]\ncount = 0\nfor i in range(len(S)):\n \n if S[i] == 'A' or 'T' or 'C' or'G':\n count += 1\n else:\n ls.append(count)\n count = 0\n\nprint(max(ls))\n\n", "#! /usr/bin/env python3\n# -*- coding: utf-8 -*-\nS = list... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s438957774', 's662254152', 's156323418'] | [3060.0, 3060.0, 2940.0] | [17.0, 19.0, 17.0] | [241, 217, 275] |
p03086 | u347452770 | 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`. | ['str = input()\nn = lent(str)\ncounter = []\nmax = 0\nfor i in range(n):\n counter[i] = 0\n\nfor i in range(n):\n if str[i] == "A" or "T" or "C" or "G":\n counter[i] ++\n \n \nfor i in range(n):\n if counter[i] > max:\n max = counter[i]\n \nprint(max)', "str = list(input())\nn = len(str)\nmax = 0\ncounte... | ['Runtime Error', 'Accepted'] | ['s952061586', 's399870381'] | [3064.0, 3064.0] | [17.0, 18.0] | [248, 373] |
p03086 | u347600233 | 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\nmax_cnt = 0\nfor i in s:\n if i in ['A', 'T', 'C', 'G']:\n cnt += 1\n else:\n cnt = 0\n max_cnt = max(max_cnt, cnt)\nprint(cnt)", "s = input()\ncnt = 0\nmax_cnt = 0\nfor i in s:\n if i in ['A', 'T', 'C', 'G']:\n cnt += 1\n else:\n cnt = 0\n max_cnt =... | ['Wrong Answer', 'Accepted'] | ['s734322813', 's013561718'] | [2940.0, 2940.0] | [17.0, 17.0] | [163, 167] |
p03086 | u353652911 | 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)\nat=["A","T","G","C"]\nans=[-1]\nfor i in range(n):\n if s[i] not in at:\n ans.append(i)#-ans[-1])\nm=len(ans)\nans2=[]\nfor j in range(m-1):\n ans2.append(ans[j+1]-ans[j])\nprint(ans) \nprint(max(ans2)-1)', 's=input()\nn=len(s)\nat=["A","T","G","C"]\nans=[-1]\nfor i in range(n-1):... | ['Runtime Error', 'Accepted'] | ['s210747677', 's288298414'] | [3064.0, 3064.0] | [17.0, 18.0] | [229, 376] |
p03086 | u357751375 | 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 = int(input())\nl = list(map(int,input().split()))\nl.sort(reverse = True)\n\nif l[0] < sum(l[1:n]):\n print('Yes')\nelse:\n print('No')", "s = input()\nacgt = ['A','C','G','T']\nans = 0\np = 0\nfor i in range(len(s)):\n if s[i] in acgt:\n p += 1\n else:\n ans = max(ans,p)\n p = 0\n... | ['Runtime Error', 'Accepted'] | ['s850015394', 's562728128'] | [9168.0, 8996.0] | [23.0, 23.0] | [137, 177] |
p03086 | u360094607 | 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 = max(\n len(m.group()) for m in re.findall('[AGCT]+', s),\n default=0\n)\n\nprint(ans)\n", "import re\n\ns = input()\nans = max(\n len(m.group()) for m in re.findall('[AGCT]+'),\n default=0\n)\n\nprint(ans)\n", "import re\n\ns = input()\nans = max(\n map(len, re.findall('... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s088161784', 's242392376', 's375112262'] | [2940.0, 2940.0, 3188.0] | [17.0, 17.0, 19.0] | [116, 113, 101] |
p03086 | u363259080 | 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()\n2 N = len(S)\n3 ans = 0\n4 for i in range(N):\n5 for j in range(i, N):\n6 if all('ACGT'.count(c) == 1 for c in S[i : j + 1]):\n7 ans = max(ans, j - i + 1)\n8 print(ans)\n", "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... | ['Runtime Error', 'Accepted'] | ['s169241334', 's434952037'] | [2940.0, 2940.0] | [17.0, 17.0] | [175, 167] |
p03086 | u365228085 | 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_filter = ['A', 'C', 'G', 'T']\n\nstr_length = 0\nstr_lengths = []\nfor s in S:\n if s in ACGT_filter:\n print(s)\n str_length += 1\n else:\n str_lengths.append(str_length)\n str_length = 0\n\nprint(max(str_lengths))", "ACGT_filter = ['A', 'C', 'G', 'T']\n\nans... | ['Runtime Error', 'Accepted'] | ['s129134087', 's424308622'] | [3060.0, 2940.0] | [17.0, 18.0] | [260, 173] |
p03086 | u365491796 | 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`. | ["#ABC122B\nS = input()\nSC= S.replace('C','A')\nSCG = SC.replace('G','A')\nSCGT = SCG.replace('T','A')\nans = 0\nwk = 0\nprint(SCGT)\nfor i in range(int(len(S))):\n if SCGT[i:i+1] == 'A':\n wk += 1\n else:\n if wk >= ans:\n ans = wk\n wk =0\n \nprint(ans)", "#ABC122B\nS = i... | ['Wrong Answer', 'Accepted'] | ['s393177141', 's380288081'] | [3064.0, 3064.0] | [17.0, 17.0] | [283, 290] |
p03086 | u366269356 | 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 = sys.stdin.readline \n\ns = input().replace("\\n","")\n\nans = 0\n\nfor i in range(len(s)):\n cnt = 0\n for j in range(i,len(s)):\n print(len(s),i)\n print(s[j:])\n print(s[j])\n if s[j] == \'A\' or s[j] == \'C\' or s[j] == \'G\' or s[j] == \'T\':\n cnt ... | ['Wrong Answer', 'Accepted'] | ['s259190261', 's149478964'] | [3064.0, 3064.0] | [18.0, 17.0] | [543, 551] |
p03086 | u366959492 | 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=list(s)\nm=0\nfor i in range(len(l)):\n if l[i]!="A" and l[i]!="T" and l[i]!="C" and l[i]!="G":\n l[i]="."\n\nprint(l)\nss="".join(l)\nll=ss.split(".")\nlll=[0]\nfor i in ll:\n lll.append(len(i))\nprint(max(lll))\n', 's=input()\nl=list(s)\nm=0\nfor i in range(len(l)):\n if l[i]!="A" and l... | ['Wrong Answer', 'Accepted'] | ['s191047833', 's483728823'] | [3064.0, 3064.0] | [17.0, 17.0] | [226, 216] |
p03086 | u367117210 | 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())\n\nacgt = ['']\nwhile len(s) != 0:\n\tif s[0] == 'A' or s[0] == 'C' or s[0] == 'G' or s[0] == 'T':\n\t\tacgt[-1] += s.pop(0)\n\telse:\n\t\ts.pop(0)\n\t\tacgt.append('')\n\tprint(acgt)\n\nprint(max([len(e) for e in acgt]))", "s = list(input())\n\nacgt = ['']\nwhile len(s) != 0:\n\tif s[0] == 'A' or s... | ['Wrong Answer', 'Accepted'] | ['s198977226', 's878446066'] | [3060.0, 3060.0] | [17.0, 17.0] | [219, 206] |
p03086 | u368016155 | 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\nACGT = set('A','C','G','T')\nfor i in range(1,len(S+1)):\n j = 1\n while j*i <= S:\n if set(S[j:j*i]) <= ACGT:\n ans = len(S[j:j*i])\n j += 1\nprint (ans)", "S = input()\n\nans = 0\nACGT = set('A','C','G','T')\nfor i in range(1,len(S+1)):\n j = 1\n while j*i <= len(S):\n if s... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s001887072', 's181525414', 's390287271', 's649596317', 's905503689'] | [2940.0, 3064.0, 3060.0, 3064.0, 3060.0] | [18.0, 18.0, 18.0, 17.0, 17.0] | [181, 186, 174, 276, 232] |
p03086 | u368796742 | 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`. | ['l = list(input())\nans = []\nans.append(0)\ncount = 0\nfor i in range(len(l)):\n if l[i] == ("A" or "G" or "T" or "C"):\n count += 1\n else:\n ans.append(count)\n count = 0\n \nprint(max(ans)))\n ', 'l = list(input())\nans = []\nans.append(0)\ncount = 0\nfor i in range(len(l)):\n if l[i] == "A" or l[... | ['Runtime Error', 'Accepted'] | ['s156672399', 's336109154'] | [2940.0, 3060.0] | [17.0, 17.0] | [199, 242] |
p03086 | u371385198 | 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 = sys,sydin.readline\n\nS = input().strip()\na = ['A', 'T', 'G', 'C']\n\nans = 0\nj = []\nfor i in range(len(S)):\n j = i\n count = 0\n while True:\n if j >= len(S):\n break\n if S[j] in a:\n count += 1\n j += 1\n else:\n ans = max(ans, count)\n break\n \nprint(... | ['Runtime Error', 'Accepted'] | ['s135858519', 's601259162'] | [3064.0, 3064.0] | [17.0, 17.0] | [301, 299] |
p03086 | u374829922 | 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`. | ["str = input()\nmaxans = []\nans = []\n\nfor j in range(0,len(str)):\n for i in range(j,len(str)):\n print(str[i])\n if str[i] == 'A' or str[i] == 'C' or str[i] == 'G' or str[i] == 'T':\n ans.append(str[i])\n else:\n break\n if len(ans) >= len(maxans):\n maxans = ans\n ans = []\n \nprint(... | ['Wrong Answer', 'Accepted'] | ['s180945622', 's675624440'] | [3064.0, 3060.0] | [18.0, 18.0] | [329, 297] |
p03086 | u375282392 | 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\ndef chk(s):\n\tif s in 'ACGT':\n\t\treturn 1\n\telse:\n\t\treturn 0\nc = 0\nfor i in s:\n\tc += chk(s)\n\nprint(c)", "s = input()\n\nc = 0\nm = 0\nfor i in s:\n\tif s in 'ACGT':\n\t\tc += 1\n\t\tm = max(c,m)\n else:\n\t\tc = 0\n\nprint(m)", "s = input()\n\nc = 0\nm = 0\nfor i in s:\n\tif i in 'ACGT'... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s319027223', 's774631300', 's206226033'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [111, 105, 102] |
p03086 | u378691508 | 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()\ntemp=0\nans=0\ntar="ACGT"\nfor ch in s:\n if ch in tar:\n temp+=1\n else:\n if ans=<temp:\n ans=temp\n temp=0\n\nprint(ans)\n\n\n', 's=str(input())\ntemp=0\nans=0\ntar="ACGT"\nfor ch in s:\n if ch is tar:\n temp+=1\n else:\n temp=0\n if ans<temp:\n ans=temp\nprint(ans)', 's=... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s659891390', 's977748644', 's938730263'] | [8888.0, 9072.0, 9084.0] | [27.0, 31.0, 25.0] | [141, 141, 141] |
p03086 | u379959788 | 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\nlst = []\nfor i in range(0, len(S)):\n for k in range(0, len(S)):\n if i > k:\n pass\n else:\n lst.append(S[i:k+1])\nlst.append("")\nlst_AGCT = []\nfor i in range(len(lst)):\n if "B" in lst[i] or "D" in lst[i] or "E" in lst[i] or "F" in lst[i] or "H" in lst[i] ... | ['Wrong Answer', 'Accepted'] | ['s695851677', 's658451305'] | [3064.0, 3064.0] | [17.0, 17.0] | [725, 730] |
p03086 | u381713448 | 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`. | ['word = input()\nprint(len(word.("QWERYUIOPSDFHJKLZXVBNM")))', 'word = input()\nnum = [0]\nindex = 0\nfor i in word:\n if i.strip("ATCG") == "":\n num[index] += 1\n else:\n index += 1\n num.append(0)\nprint(max(num))'] | ['Runtime Error', 'Accepted'] | ['s933825813', 's847629187'] | [2940.0, 3060.0] | [17.0, 17.0] | [58, 154] |
p03086 | u383450070 | 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 = str(input())\nlength = len(moji)\nmojilst = list(moji)\nans = 0\ntemp = []\nfor i in range(length):\n if str(mojilst[i]) == "A" or str(mojilst[i]) == "G" or str(mojilst[i]) == "C" or str(mojilst[i]) == "T":\n temp.append(str(mojilst[i]))\n else:\n if len(ans) < len(temp):\n ans = len(temp)\n te... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s146428332', 's281719322', 's620188408'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [325, 377, 362] |
p03086 | u384476576 | 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 = 0\nfor i in range(len(S), 0, -1):\n for j in range(len(S) - i + 1):\n for k, s in enumerate(S[j:i + j]):\n print(S[j:i + j])\n if not s in acgt:\n break\n if k == len(S[j:i + j]) - 1:\n ans = len(S... | ['Wrong Answer', 'Accepted'] | ['s555179344', 's046320739'] | [3064.0, 3064.0] | [18.0, 18.0] | [431, 401] |
p03086 | u386249594 | 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`. | ["T = list(map(str,input()))\nprint(T)\n\ncount = 0\nflag1 = 0\nlist_count = []\nfor i in T:\n if i == 'A' or i == 'T' or i == 'G' or i == 'C':\n flag1 = 1\n count = count +1\n elif flag1 ==1:\n list_count.append(count)\n flag = 0\n count = 0\nlist_count.append(count)\nprint(max... | ['Wrong Answer', 'Accepted'] | ['s068522051', 's094656665'] | [3060.0, 3060.0] | [17.0, 17.0] | [317, 308] |
p03086 | u391675400 | 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\nresult = ""\nresult_old = ""\n\n\n\ncount = 0\nfor i in range(int(len(s))):\n if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":\n result = result +s[i]\n count += 1\n else:\n if int(len(result_old)) <= int(len(result)):\n print("result_old=",result_old)\... | ['Wrong Answer', 'Accepted'] | ['s072193936', 's903190071'] | [3064.0, 2940.0] | [17.0, 18.0] | [635, 153] |
p03086 | u392319141 | 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`. | ['<?php\n\n$s = trim(fgets(STDIN));\n$count = [0];\n\n$replace = preg_replace(\'/[^ACGT]/\',\',\',$s);\n$matchs = array_filter(explode(\',\',$replace));\n\nforeach ($matchs as $m) {\n $count[] = strlen($m);\n}\n\nprint(max($count) . "\\n");', "S = input()\nT = set(list('AGCT'))\n\nans = 0\nfor l in range(len(S)):\n ... | ['Runtime Error', 'Accepted'] | ['s254497411', 's517930372'] | [2940.0, 3060.0] | [17.0, 19.0] | [222, 182] |
p03086 | u392938961 | 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`. | ['https://atcoder.jp/contests/abc128/tasks/abc128_a', 'Str = list(input())\ntmp = 0\nmaxLen = 0\n\nfor s in Str:\n if s in "ACGT":\n tmp += 1\n maxLen = max(maxLen, tmp)\n else:\n tmp = 0\n\n\nprint(maxLen)'] | ['Runtime Error', 'Accepted'] | ['s987061982', 's906854545'] | [2940.0, 3060.0] | [17.0, 17.0] | [49, 166] |
p03086 | u403331159 | 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\nfor i in s:\n if i in ["A","T","C","G"]:\n cnt+=1\n else:\n ans=max(ans,cnt)\n cnt=0\nprint(ans)', 's=input()\ns+="Z"\nans=0\ncnt=0\nfor i in s:\n if i in ["A","T","C","G"]:\n cnt+=1\n else:\n ans=max(ans,cnt)\n cnt=0\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s727905116', 's900090863'] | [3060.0, 3060.0] | [19.0, 19.0] | [133, 146] |
p03086 | u404710939 | 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()\nmaxlen = 0\nl = 0\nfor s in S:\n if s in ["A", "T", "G", "C"]:\n l += 0\n else:\n if l > maxlen:\n maxlen = l\n l = 0\nif l > maxlen:\n maxlen = l\nprint(maxlen)', 'S = input()\nmaxlen = 0\nl = 0\nfor s in S:\n if s in ["A", "T", "G", "C"]:\n l += 1\... | ['Wrong Answer', 'Accepted'] | ['s077900446', 's586539497'] | [2940.0, 3060.0] | [18.0, 17.0] | [207, 207] |
p03086 | u409064224 | 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\nl = ["A","C","G","T"]\nres = 0\n\nfor i in range(len(s)):\n #print(i)\n tmp = 0\n print(s[i:])\n for j in s[i:]:\n if j in l:\n tmp += 1\n else:\n res = max(res,tmp)\n #print(res)\n break\n else:\n res = max(res,tmp)\nelse:... | ['Wrong Answer', 'Accepted'] | ['s023643382', 's235285571'] | [3060.0, 2940.0] | [17.0, 17.0] | [316, 317] |
p03086 | u413165887 | 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())\n\nresult = [0]\ni = 0\nwhile i < len(s):\n counter = 0\n while i + counter < len(s):\n if s[i+counter] == 'A' or s[i+counter] == 'T' or s[i+counter] == 'G' or s[i+counter] == 'C':\n counter += 1\n else:\n result.append(counter)\n i += counter +1\n... | ['Wrong Answer', 'Accepted'] | ['s482581615', 's239929614'] | [3060.0, 3064.0] | [2104.0, 17.0] | [319, 390] |
p03086 | u415325136 | 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']\ncnt, ans = 0\nfor i in range(len(s)):\n if s[i] in acgt:\n cnt += 1\n if ans <= cnt:\n ans = cnt\n else:\n cnt = 0\nprint(ans)\n", "s = str(input())\ncnt, ans = 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 ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s048411297', 's581139679', 's768250747', 's226589810'] | [2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 19.0, 18.0, 17.0] | [181, 195, 180, 185] |
p03086 | u416397108 | 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`. | ["str = input()\nmax = 0\ncount = 0\nfor chr in str:\n if chr == 'A' or chr == 'C' or chr == 'G' or chr == 'T':\n count += 1\n \tif count > max:\n max = count\n else:\n \tcount = 0\nprint({}.format(max))\n", "str = input()\nmax = 0\ncount = 0\nfor chr in str:\n\tif chr == 'A' or chr == 'C' or chr == 'G' or... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s227509604', 's263107646', 's306436689', 's431281309', 's861480458', 's905805967', 's001375115'] | [2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [203, 207, 192, 206, 204, 200, 227] |
p03086 | u425019904 | 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_len = 0\nfor i in range(len(S)):\n for j in range(i+1, len(S)):\n s = S[i:j]\n s = s.replace('A', '.')\n s = s.replace('T', '.')\n s = s.replace('G', '.')\n s = s.replace('C', '.')\n flag = True\n for ss in s:\n if ss != '.':\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s038946023', 's890706118', 's633026811'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [447, 447, 424] |
p03086 | u425762225 | 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)\nl = []\nfor i in range(N):\n for j in range(i,N):\n s = S[i:j]\n if s.strip("ACGT") == "":\n l.append(s)\n\nm = sorted(l, key=len)\nprint(m[-1])', 'S = input()\nN = len(S)\nl = []\nfor i in range(N):\n for j in range(i,N):\n s = S[i:j]\n if s.strip("A C G T") == "":\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s329430373', 's827429571', 's942551825'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0] | [171, 175, 237] |
p03086 | u426108351 | 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()\natcg = ['A', 'C', 'T', 'G']\nans = 0\ncount = 0\nfor i in range(S):\n if S[i] in atcg:\n count += 1\n ans = max(count, ans)\n else:\n count = 0\nprint(ans)", "S = input()\natcg = ['A', 'C', 'T', 'G']\nans = 0\ncount = 0\nfor i in range(len(S)):\n if S[i] in atcg:\n count += 1\n ans = ma... | ['Runtime Error', 'Accepted'] | ['s989039989', 's341441322'] | [3060.0, 3060.0] | [17.0, 18.0] | [169, 174] |
p03086 | u430928274 | 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\ncount = 0\nfor x in S :\n if x in "ATGC" :\n count += 1\n else :\n max = max(max, count)\n count = 0\nmax = max(max, count)\nprint(max)\n', 'S = input()\nmax = 0\ncount = 0\nfor x in S :\n if x in "ATGC" :\n count += 1\n else :\n max = max(max, coun... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s448976448', 's669241807', 's738216278'] | [9004.0, 8880.0, 8972.0] | [23.0, 24.0, 27.0] | [175, 175, 169] |
p03086 | u432356156 | 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 is_ATCG(str):\n for i in range(len(str)):\n chr=str[i]\n if(not(chr=='A' or chr=='T' or chr == 'C' or chr=='G')):\n return 0\n return 1\n\ni_str=input()\nmax_len=0\nlen_str=len(i_str)\n\nfor i in range(len_str): \n for j in range(i,len_str): \n strA=i_str[i:j+1:1]\n ... | ['Wrong Answer', 'Accepted'] | ['s124134998', 's445240227'] | [3064.0, 3060.0] | [17.0, 17.0] | [559, 519] |
p03086 | u434872492 | 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(N):\n if all('ATGC'.count(c) == 1 for c in S[i:j + 1]:\n ans = max(ans,j-i+1)\n \nprint(ans)", "S = input()\nN = len(S)\nans = 0\nfor i in range(N):\n for j in range(i,N):\n if all('ATGC'.count(c) == 1 for c in S[i:j+1])... | ['Runtime Error', 'Accepted'] | ['s236989171', 's422927020'] | [2940.0, 3060.0] | [18.0, 17.0] | [178, 183] |
p03086 | u437723389 | 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\nAGCT = ['A','G','C','T']\nAGCT_list = []\n\ni = 0\nwhile i < len(S):\n print('i=',i)\n if S[i] in AGCT:\n k = 1\n agct_tmp = S[i]\n if i+k < len(S):\n while S[i+k] in AGCT:\n #print('k=', k)\n #print('i+k=',i+k)\n agct_t... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s116453702', 's341451556', 's121933399'] | [9064.0, 8948.0, 9008.0] | [25.0, 27.0, 28.0] | [610, 546, 611] |
p03086 | u440161695 | 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())\nA=[0]*10\nc=0\nfor i in range(10):\n if S[i]=="A" or S[i]=="G" or S[i]=="C" or S[i]=="T":\n A[c]+=1\n else:\n c+=1\nprint(max(A))', 'S=list(input())\nA=[0]*10\nc=0\nfor i in range(len(S)):\n if S[i]=="A" or S[i]=="G" or S[i]=="C" or S[i]=="T":\n A[c]+=1\n else:\n c+=1\nprint(max(A))\n... | ['Runtime Error', 'Accepted'] | ['s459055878', 's557489160'] | [3064.0, 2940.0] | [18.0, 17.0] | [146, 151] |
p03086 | u441320782 | 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`. | ['T = input()+"Z" #T=ATCODERZ\nx=["A","C","G","T"]\ncount=0\nstock=[]\n\nfor i in range(len(T)):\n if T[i] in x:\n count += 1\n print(T[i])\n else:\n stock.append(count)\n count = 0\n\nprint(stock[-1])\n', 'T = input()+"Z" #T=ATCODERZ\nx=["A","C","G","T"]\ncount=0\nstock=[]\n\nfor i in range(len(T)):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s534242616', 's940216732', 's145536075'] | [2940.0, 2940.0, 3060.0] | [17.0, 19.0, 17.0] | [202, 186, 165] |
p03086 | u448655578 | 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`. | ["words = ''\nw = []\nflag = []\nS = list(input())\nfor i in range(len(S)):\n if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':\n flag.append('True')\n else:\n flag.append('False')\nprint(S)\nprint(flag)\n\nfor j in range(len(S)):\n if flag[j] == 'True':\n \twords += S[j]\n elif flag[j] == 'False'... | ['Runtime Error', 'Accepted'] | ['s545137869', 's347768997'] | [3064.0, 3060.0] | [17.0, 18.0] | [358, 211] |
p03086 | u448720391 | 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 = []\ncount.append(0)\nx = ["A","T","G","C"]\nc = 0\nfor i in range(len(s)):\n if (s[i] in x) == True:\n c += 1\n else:\n count.append(c)\n c = 0\ncount.append(c)\nprint(count)', 's = list(input())\ncount = [0]\nx = ["A","T","G","C"]\nc = 0\nfor i in range(len(s)):\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s536017694', 's915426104', 's822755636'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 19.0] | [216, 201, 195] |
p03086 | u453526259 | 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\nc_max = 0\ncnt = 0\n\nfor i in S:\n if i == "A" or "C" or "G" or "T":\n cnt +=1\n else:\n c_max = max(c_max, cnt)\n cnt = 0\n\nprint(c_max)\n', 'S = input()\n\nc_max = 0\ncnt = 0\n\nfor i in S:\n if i == "A" or i == "C" or i == "G" or i == "T":\n cnt +=1\n c... | ['Wrong Answer', 'Accepted'] | ['s344113746', 's151764868'] | [2940.0, 2940.0] | [17.0, 17.0] | [170, 218] |
p03086 | u453630968 | 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`. | ['count = 0\ntmp = 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 tmp += 1\n else: \n tmp = 0\n count = max(tmp,count)\nprint(count)', 's = input()\ncount = 0\ntmp = 0\nfor i in range(len(s)):\n if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i... | ['Runtime Error', 'Accepted'] | ['s341240834', 's712455500'] | [9068.0, 9104.0] | [22.0, 26.0] | [193, 205] |
p03086 | u454735747 | 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 \nif 'ACGT' in S:\n len('ACGT')\n ", "S = input()\ncount = 0\nmaxcount = 0\nT = ['A','C','G','T']\n \nfor a in S:\n if a in T:\n count = count + 1\n else:\n maxcount = max(count,maxcount)\n count = 0\n \nprint(max(count,maxcount))"] | ['Wrong Answer', 'Accepted'] | ['s144610373', 's313845478'] | [2940.0, 3060.0] | [17.0, 18.0] | [53, 192] |
p03086 | u455317716 | 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`. | ['ans = 0\nans_tmp = 0\ns = input()\nfor i in range(len(s)):\n ans_tmp = 0\n for s_bubun in s[i:]:\n if s_bubun in ("A","T","G","C"):\n ans_tmp +=1\n else:\n break\n ans = max(ans_tmp,ans)\n print(ans)\nprint(ans)', 'ans = 0\nans_tmp = 0\ns = input()\nfor i in range(len(s... | ['Wrong Answer', 'Accepted'] | ['s938519849', 's392969955'] | [3060.0, 3060.0] | [17.0, 19.0] | [247, 232] |
p03086 | u459752408 | 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\nans= 0\nfor i in range(l):\n if S[i] in ["A" ,"C" ,"G","T"]:\n count +=1\n else:\n ans = count\n count=0\n\nprint(max(ans,count))\n', 'S = input()\nl = len(S)\ncount=0\nans= 0\nfor i in range(l):\n if S[i] in ["A" ,"C" ,"G","T"]:\n count +=1\n else:\n count=0\n an... | ['Wrong Answer', 'Accepted'] | ['s079407450', 's057101613'] | [2940.0, 3060.0] | [17.0, 19.0] | [164, 158] |
p03086 | u463655976 | 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,Q=map(int,input().split())\nS=input()\nL=[tuple(map(int, input().split())) for _ in range(Q)]\nprint("\\n".join([str(len(S[nS-1:nE])-len(S[nS-1:nE].replace("AC", "|"))) for nS, nE in L]))\n', 'S=input()\n\nc=m=0\nfor x in S:\n #print((m,c,x,"ACGT".find(x)))\n if "ACGT".find(x)<0:\n m = max(m, c)\n c = 0\n ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s156871929', 's790119861', 's374692071'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [186, 132, 141] |
p03086 | u466331465 | 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\ncnt = 0\nfor i in range(len(S)):\n if S[i] == "A" or S[i] =="G" or S[i] =="C" orS[i] =="T":\n cnt += 1\n else:\n ans = max(ans,cnt)\n cnt = 0\nprint(ans)', 'S = input()\nans = 0\ncnt = 0\nfor i in range(len(S)):\n if S[i] == "A" or S[i] =="G" or S[i] =="C" or S[i] =="T":\n cnt += ... | ['Runtime Error', 'Accepted'] | ['s124243611', 's836413677'] | [2940.0, 2940.0] | [17.0, 17.0] | [177, 189] |
p03086 | u468240161 | 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())\nprint(S)\nc=0\nmax=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 c+=1\n if c>max :\n max=c\n else :\n c=0\n \nprint(max)\n\n", "S=list(input())\n\nc=0\nmax=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 ... | ['Wrong Answer', 'Accepted'] | ['s638493328', 's015626399'] | [2940.0, 3060.0] | [18.0, 17.0] | [184, 174] |
p03086 | u471642439 | 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())\n\ncount = 0\nresult = []\n\nfor i in range(len(S)):\n if S[i] == "A" or "C" or "G" or "T":\n count += 1\n else:\n result.append(count)\n count = 0\n\nmax = result[0]\n \nfor j in range(len(result)):\n if max < result[j]:\n max = result[j]\n\nprint(max)', ' S = input()\n\ncount = 0\... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s437120842', 's894390458', 's604483648'] | [3064.0, 2940.0, 3064.0] | [17.0, 18.0, 17.0] | [270, 303, 409] |
p03086 | u472696272 | 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())\nkey = ['A','T','G','C']\n\ncount = 0\nans = 0\nfor i in range(n):\n if s[i] in key: count += 1\n else: count = 0\n ans = max(ans,count)\nprint(ans)\n", "s = list(input())\nkey = ['A','T','G','C']\n\ncount = 0\nans = 0\nfor i in range(len(s)):\n if s[i] in key: count += 1\n else: count = 0\n a... | ['Runtime Error', 'Accepted'] | ['s714586737', 's305853509'] | [3068.0, 2940.0] | [18.0, 17.0] | [161, 166] |
p03086 | u477977638 | 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=0\nans=0\nlis=["ATCG"]\n\nfor i in range(len(s)):\n if s[i] in lis:\n cnt+=1\n ans=max(ans,cnt):\n else:\n cnt=0\nprint(ans)', 's=list(input())\ncnt=0\nans=0\nlis=list("ATCG")\n\nfor i in s:\n if s[i] in lis:\n cnt+=1\n ans=max(ans,cnt)\n else:\n cnt=0\nprint(ans)', 's=list(... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s285136851', 's426759707', 's567846376', 's384298687'] | [2940.0, 2940.0, 2940.0, 3060.0] | [18.0, 18.0, 17.0, 17.0] | [145, 136, 144, 449] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.