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 | u689258494 | 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=[]\nt=0\nc=[0]\nfor s in S:\n x.append(s)\nfor i in range(len(x)):\n if x[i]=="A" or x[i]=="T" or x[i]=="C" or x[i]=="G":\n t+=1\n print(i)\n print(t)\n else:\n c.append(t)\n t=0\n print(i)\n print(t)\nc.append(t)\nprint(max(c))', 'S = input()\nx=[]\nt=0\nc=[0]\nfor s in S:\n x... | ['Wrong Answer', 'Accepted'] | ['s761923054', 's769099103'] | [3064.0, 3064.0] | [17.0, 17.0] | [250, 198] |
p03086 | u690781906 | 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']\ncount = 0\nmax_count = 0\nfor w in S:\n if w in ACGT:\n count += 1\n else:\n if count > max_count:\n max_count += count\nprint(max_count", "S = input()\nACGT = ['A', 'C', 'G', 'T']\ncount = 0\nmax_count = 0\nfor w in S:\n if w in ACGT:\n ... | ['Runtime Error', 'Accepted'] | ['s001200902', 's673697103'] | [2940.0, 2940.0] | [17.0, 17.0] | [199, 222] |
p03086 | u691018832 | 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 = 0\natgc = [0] * len(S)\n\nfor i in S:\n if i == ('A' or 'C' or 'G' or 'T'):\n atgc[n] += 1\n else:\n n += 1\n \nans = min(atgc)\nprint(ans)", "C = input()\nans = 0\nmatch = 0\n\nfor i in C:\n if (('A' in i) or ('C' in i) or \\\n ('G' in i) or ('T' in i)) == 'True'... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s041428111', 's166343212', 's316738581', 's633012722', 's390221913'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 17.0, 18.0, 17.0, 17.0] | [172, 234, 261, 204, 365] |
p03086 | u693933222 | 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\nans = 0\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 for j in range(i+1,len(s)):\n if(s[j] != "A" and s[j] != "C" and s[j] != "G" and s[j] != "T"):\n print("{},{}".format(i,j))\n ans = max(ans,j-i)\... | ['Wrong Answer', 'Accepted'] | ['s767453496', 's309288393'] | [3064.0, 2940.0] | [17.0, 17.0] | [412, 161] |
p03086 | u694536861 | 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']\nsum = 0\nfor i in ACGT:\n sum = S.count(i)\nprint(sum)", "S = input()\nACGT = [ 'A', 'C', 'G', 'T' ]\nlistResult = []\nsum = 0\n\nfor i in S:\n if i in ACGT:\n sum += 1\n else:\n listResult.append(sum)\n sum = 0\nelse:\n listResult.append(sum)\... | ['Wrong Answer', 'Accepted'] | ['s215550453', 's915701752'] | [2940.0, 2940.0] | [18.0, 18.0] | [93, 232] |
p03086 | u694665829 | 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(str(input()))\nA=["A","T","G","C"]\nprint(S)\ncnt=0\nans=[]\nfor (i,s) in enumerate(S):\n if s in A:\n cnt+=1\n else:\n ans.append(cnt)\n cnt=0\nprint(max(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 S[i... | ['Runtime Error', 'Accepted'] | ['s154012780', 's484284438'] | [8892.0, 9052.0] | [33.0, 23.0] | [183, 164] |
p03086 | u697658632 | 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\nl = 0\nfor c in s:\n if c == 'A' || c == 'C' || c == 'G' || c == 'T':\n l += 1\n else:\n ans = max(ans, l)\n l = 0\nans = max(ans, l)\nprint(ans)\n", "s = input()\nans = 0\nl = 0\nfor c in s:\n if c == 'A' or c == 'C' or c == 'G' or c == 'T':\n l += 1\n else:\n ans = max(ans, ... | ['Runtime Error', 'Accepted'] | ['s616797539', 's450697859'] | [2940.0, 2940.0] | [18.0, 17.0] | [169, 169] |
p03086 | u702364978 | 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().strip()\n\nflag = 0\nok_list = ['A', 'T', 'C', 'G']\n\nmax_len = 0\nstart, end, i = 0, 0, 0\n\nwhile i < len(s):\n while s[i] not in ok_list:\n i += 1\n start = i\n\n while s[i] in ok_list:\n i += 1\n end = i\n\n tmp = s[start:end]\n if len(tmp) > max_len:\n max_len ... | ['Runtime Error', 'Accepted'] | ['s625127635', 's312746881'] | [3064.0, 3064.0] | [18.0, 20.0] | [326, 303] |
p03086 | u702582248 | 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=''.join([i if i in ['A', 'C', 'G', 'T'] else ' ' for i in input()])\nprint(max(len, a.split())", "from collections import Counter\nimport sys\n\nsys.setrecursionlimit(10 ** 6)\n\nmod = 1000000007\ninf = int(1e18)\n\ndx = [0, 1, 0, -1]\ndy = [1, 0, -1, 0]\n\n\ndef inverse(a):\n return pow(a, mod - 2, mod)\n\n\nde... | ['Runtime Error', 'Accepted'] | ['s445624542', 's068893865'] | [2940.0, 3316.0] | [17.0, 21.0] | [95, 645] |
p03086 | u704284486 | 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\nsets = {A,T,C,G}\nfor s in S:\n if s in sets:\n cnt += 1\n else:\n ans = max(ans,cnt)\n cnt = 0\nprint(ans)', 'S = input()\ncnt=0\nans = 0\nsets = set([A,T,C,G])\nfor s in S:\n if s in sets:\n cnt += 1\n else:\n ans = max(ans,cnt)\n cnt = 0\nprint(ans)\n', 'S = input... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s887581513', 's977137126', 's573763130'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [137, 143, 165] |
p03086 | u706414019 | 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()\ns = re.split('[ACGT]',S)\nprint(max(map(len,s)))", "import re\nS = input()\ns = re.split('[BDEFHIJKLMNOPQRSUVWXYZ]',S)\nprint(max(map(len,s)))\n"] | ['Wrong Answer', 'Accepted'] | ['s071865061', 's640219046'] | [9804.0, 9932.0] | [34.0, 35.0] | [69, 88] |
p03086 | u707072292 | 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`. | ['\na = [str(i) for i in input()] \nmax=0\nans=0\n\nprint(a)\n\nfor i in range(len(a)):\n if a[i] == "A" or a[i] == "C" or a[i] == "G" or a[i] == "T":\n max=max+1\n else:\n if(ans <= max):\n ans=max\n max=0\n \nprint(ans)', '\na = [str(i) for i in input()] \nmax=0\nans=0... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s613396918', 's880072192', 's542060169'] | [3060.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [274, 349, 334] |
p03086 | u707808519 | 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', 'T', 'C', 'G')\nS = input()\n\nans = [0]\nfor i in range(len(S)):\n if S[i] in l:\n res += 1\n elif res != 0:\n ans.append(res)\n res = 0\n\nprint(max(ans))", "l = ('A', 'T', 'C', 'G')\nS = input()\n\nans = [0]\nres = 0\nfor i in range(len(S)):\n if S[i] in l:\n res += 1... | ['Runtime Error', 'Accepted'] | ['s025142550', 's929540335'] | [9116.0, 9076.0] | [24.0, 28.0] | [182, 206] |
p03086 | u712719923 | 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 for x1 in range(len(s)):\n for x2 in range(x1+1, len(s)):\n for si in s[x1:x2]:\n if si not in ["A", "T", "G", "C"]:\n break\n else:\n if count<x2-x1:\n count = x2-x1\n ... | ['Wrong Answer', 'Accepted'] | ['s750146604', 's947343786'] | [8976.0, 8968.0] | [30.0, 25.0] | [398, 404] |
p03086 | u714378447 | 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(map(str,input()))\nfor i in range(len(s)):\n s[i]='1' if (s[i]=='A' or s[i]=='C' or s[i]=='G' or s[i]=='T') else '0'\nlen(max(''.join(s).split('0'),key=len))", "s=list(map(str,input()))\nfor i in range(len(s)):\n s[i]='1' if (s[i]=='A' or s[i]=='C' or s[i]=='G' or s[i]=='T') else '0'\nprint(len(max(''.jo... | ['Wrong Answer', 'Accepted'] | ['s502599281', 's974547528'] | [2940.0, 3060.0] | [17.0, 18.0] | [164, 171] |
p03086 | u716529032 | 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] * (len(S) + 1)\nfor i in range(len(S)):\n if S[i] not in "ATCG": continue\n ans[i+1] += ans[i]\nprint(max(ans))', 'S = input()\nans = [0] * (len(S) + 1)\nfor i in range(len(S)):\n if S[i] not in "ATCG": continue\n ans[i+1] = ans[i] + 1\nprint(max(ans))'] | ['Wrong Answer', 'Accepted'] | ['s164933451', 's533909330'] | [2940.0, 2940.0] | [17.0, 18.0] | [131, 134] |
p03086 | u720558413 | 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 = 0\nans = 0\n\nfor i in range(len(S)):\n if S[i] != "A" and S[i] != "C" and S[i] != "G" and S[i] != "T":\n max = count\n count = 0\n if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":\n count += 1\n \n print(i,count)\n if max > ans:\n ans = max\nprint(ans)', "... | ['Wrong Answer', 'Accepted'] | ['s965320920', 's984770803'] | [9104.0, 8960.0] | [27.0, 25.0] | [299, 173] |
p03086 | u725757838 | 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 = re.finditer(r'(A|T|G|C)+',s)\nmax=0\nfor a in ans:\n temp=len(a.group())\n if temp>=max:\n max=temp\nprint(max)", 'import re\ns=input()\nans=re.findall(r"((A|T|G|C)+)",s)\nprint(ans)\nif ans==[]:\n print(0)\nelse:\n print(ans)\n max=0\n for i in range(len(ans)):\n tem... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s428583477', 's473535821', 's853820527'] | [2940.0, 3188.0, 3060.0] | [17.0, 20.0, 18.0] | [135, 455, 309] |
p03086 | u728615412 | 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 = 1 if S[0] in lis else 0\nlis = ['A','T','C','G']\nans = 1 if S[0] in lis else 0\nfor i in range(1,len(S)):\n if S[i] in lis:\n count += 1\n else:\n ans = max(ans,count)\n count = 0\nprint(ans)\n ", "S = list(input())\nS.append('fuck')\nlis = ['A','T','C','G']\ncount = 1 if S[0... | ['Runtime Error', 'Accepted'] | ['s344840086', 's391959162'] | [2940.0, 3060.0] | [17.0, 17.0] | [225, 243] |
p03086 | u729217226 | 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() == 1 for c in S[i:j+1]):\n ans = 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 S[i:j+... | ['Runtime Error', 'Accepted'] | ['s780555850', 's408519349'] | [3056.0, 3060.0] | [17.0, 18.0] | [175, 176] |
p03086 | u733608212 | 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\nli = ["A", "C", "G", "T"]\ncount = 0\nfor i in s:\n if i in li:\n count += 1\n else:\n if count > ans:\n ans = count\n count = 0\nif count == len(ans):\n print(count)\nelse:\n print(ans)\n', 's = input()\nans = 0\nli = ["A", "C", "G", "T"]\ncount = 0\n... | ['Runtime Error', 'Accepted'] | ['s143153057', 's668615010'] | [2940.0, 2940.0] | [17.0, 17.0] | [239, 223] |
p03086 | u740284863 | 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)\nL = ["A","C","G","T"]\nw = [0]\nfor i in range(n):\n if S[i] in L:\n cnt = 0\n for j in range(i,n):\n if S[j] not in L:\n cnt += 1\n w.append(len(S[i:j]))\n if cnt == 0:\n w.append(len(S[i::]))\nprint(max(w))', '... | ['Wrong Answer', 'Accepted'] | ['s744281690', 's187929356'] | [3064.0, 9088.0] | [17.0, 24.0] | [301, 197] |
p03086 | u745561510 | 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()\n\ntmp = 0\ncount = 0\nfor i in n:\n print(i)\n if i == "A" or i == "C" or i == "G" or i == "T":\n count+=1\n else:\n print(tmp,count)\n tmp = max(tmp,count)\n count=0\nif tmp == 0:\n print(count)\nelse:\n print(tmp)', 'n = input()\n\ntmp = 0\ncount = 0\nfor i in... | ['Wrong Answer', 'Accepted'] | ['s408542674', 's066896749'] | [2940.0, 2940.0] | [17.0, 17.0] | [256, 189] |
p03086 | u747515887 | 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 max_len = 0\n length = 0\n\n s = list(s)\n s.append('')\n\n for i in s:\n if i in ['A', 'C', 'G', 'T']:\n length += 1\n else:\n if length > max_len:\n max_len = length\n length = 0\n\n\nif __name__ == '__ma... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s229638060', 's258694005', 's840878795'] | [2940.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [319, 302, 339] |
p03086 | u748311048 | 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()\ni=1\nans=''\n \nwhile i<=len(s):\n if s[i-1]=='A'|s[i-1]=='C'|s[i-1]=='G'|s[i-1]=='T':\n ans=ans+s[i-1]\n i+=1\n \nprint (len(ans))", "s=input()\ni=1\nans=''\n\nwhile i<=len(s):\n if s[i-1]=='A'|s[i-1]=='C'|s[i-1]=='G'|s[i-1]=='T':\n i=i+ans\n i+=1\n\nprint (len(ans)) ", "s='AAABAAAAAA'\ni=1\nn=... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s153345405', 's381229791', 's497259178', 's833121174', 's864026609', 's987946484', 's258178900'] | [3060.0, 3060.0, 3064.0, 3064.0, 3064.0, 3060.0, 3188.0] | [18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 19.0] | [138, 131, 246, 288, 215, 139, 285] |
p03086 | u757117214 | 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=[i for i in input()]\nl=[]\ncnt=0\nfor i in range(len(s)):\n if s[i] in {"A","T","C","G"," "}:\n cnt+=1\n if i==len(s)-1:\n l.append(cnt)\n else:\n l.append(cnt)\n cnt=0 ', 's=[i for i in input()]\nl=[]\ncnt=0\nfor i in range(len(s)):\n if s[i] in {"A","T","C","G"," "}:\n cnt+=1\n if i=... | ['Wrong Answer', 'Accepted'] | ['s315871794', 's357754088'] | [3060.0, 3060.0] | [17.0, 17.0] | [184, 210] |
p03086 | u757274384 | 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())\nP = set(["A","C","T","G"])\ncount = 0\nif P&set(S) == set():\n print(0)\n exit()\nelse:\n for i in range(1,len(S)-1):\n for j in range(i+1, len(S)):\n if set(S[i:j])-set(S) == set():\n count = max(count,j-i-1)\n \nprint(count)', 'S = list(input())\nP = set(["A","C","T","G"]... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s343463263', 's707760618', 's913884562', 's112275093'] | [3060.0, 3060.0, 3064.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [258, 251, 317, 251] |
p03086 | u759076129 | 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().strip()\nenki = set('ATCG')\ncount = 0\nmaxlen = 0\nfor i in range(len(s)):\n if s[i] in enki:\n count += 1\n else:\n maxlen = max(maxlen, count)\n count = 0\n\nreturn maxlen", "s = input().strip()\nenki = set('ATCG')\ncount = 0\nmaxlen = 0\nfor c in s:\n if c in enki:\n ... | ['Runtime Error', 'Accepted'] | ['s565918559', 's165029162'] | [2940.0, 3060.0] | [17.0, 17.0] | [202, 214] |
p03086 | u760360044 | 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())\nli=0\nli2=[]\nfor i in S:\n\tif i=='A' or i=='C' or i=='G' or i=='T':\n\t\tli+=1\n\telse:\n\t\tli2.append(li)\n\t\tli=0\nprint(max(li2))\nprint(li2)", "S=list(input())\nli=0\nli2=[]\nfor i in S:\n\tif i=='A' or i=='C' or i=='G' or i=='T':\n\t\tli+=1\n\telse:\n\t\tli2.append(li)\n\t\tli=0\nli2.append(... | ['Runtime Error', 'Accepted'] | ['s173254714', 's388650061'] | [2940.0, 2940.0] | [17.0, 17.0] | [147, 151] |
p03086 | u762540523 | 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;print(len(max(re.findall(r"[ACGT]+",input()),"",key=len)))', 'import re;print(max(map(len,re.split("[^ACGT]+",input()))))'] | ['Wrong Answer', 'Accepted'] | ['s794977520', 's638241955'] | [3188.0, 3188.0] | [20.0, 20.0] | [68, 59] |
p03086 | u764956288 | 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\nns = []\nfor s in S:\n if s in 'ACGT':\n n += 1\n else:\n ns.append(n)\n n = 0\nprint(max(ns))", "S = input()\n\nns = [0]\nn = 0\n\nfor s in S:\n if s in 'ACGT':\n n += 1\n else:\n ns.append(n)\n n = 0\nns.append(n)\n\nprint(max(ns))"] | ['Runtime Error', 'Accepted'] | ['s997776324', 's932333285'] | [2940.0, 2940.0] | [17.0, 17.0] | [127, 149] |
p03086 | u765590009 | 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`. | ['checklist=["A","C","G","T"]\nsn = list(input())\n\nanswer = 0\ncount = 0\nfor s in sn :\n if s in checklist:\n count += 1\n else :\n answer = max(answer,count)\n count = 0\n\nprint(answer)\nprint(sn)', "checklist=['A','C','G','T']\nsn = list(input())\n\nanswer = 0\ncount = 0\nfor s in sn :\n if s in check... | ['Wrong Answer', 'Accepted'] | ['s732984580', 's556780943'] | [9004.0, 8940.0] | [27.0, 27.0] | [197, 185] |
p03086 | u766566560 | 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\nans = 0\n\nfor i in range(10):\n if S[i] == 'A' or S[i] == 'T' or S[i] == 'C' or S[i] == 'G':\n ans += 1\n else:\n if ans >= max:\n max = ans\n else:\n ans = 0\n\nprint(max)", "S = input()\nmax = 0\nans = 0\n\nfor i in range(len(S)):\n if S[i] == 'A' or S[i] == 'T' or S[i] ... | ['Runtime Error', 'Accepted'] | ['s009961494', 's508011611'] | [3060.0, 3064.0] | [18.0, 18.0] | [203, 194] |
p03086 | u770009793 | 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()\n\nss = re.sub(\'[^A, T, C, G]\', \',\', S)\nsss = ss.split(\',\')\nans = ""\nfor i in sss:\n if len(ans) < len(i):\n ans = i\nprint(ans)', 'import re\n\nS=input()\n\nss = re.sub(\'[^A, T, C, G]\', \',\', S)\nsss = ss.split(\',\')\nans = ""\nfor i in sss:\n if len(ans) < len(i):\n ans =... | ['Wrong Answer', 'Accepted'] | ['s586053847', 's281011537'] | [3316.0, 3188.0] | [22.0, 19.0] | [148, 153] |
p03086 | u773711732 | 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)\nm = 0\ncnt = 0\nfor x in N:\n \n if x == 'A' or x == 'C' or x == 'G' or x == 'T':\n cnt += 1\n else:\n m = max(cnt, m)\n cnt = 0\n\nm = max(cnt, m)\n\nprint(m)", "N = list(input())\nm = 0\ncnt = 0\nfor x in N:\n \n if x == 'A' or x == 'C' or x == 'G' or... | ['Wrong Answer', 'Accepted'] | ['s246450553', 's731890061'] | [3060.0, 2940.0] | [18.0, 17.0] | [204, 195] |
p03086 | u776311944 | 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\ndef main():\n s = str(input())\n slist = list(s)\n stk = []\n c = []\n lenmax = 0\n for i in range(len(slist)):\n if slist[i] == \'A\' or slist[i] ==\'C\' or slist[i] ==\'G\' or slist[i] ==\'T\':\n stk.append(slist[i])\n else:\n c.append(stk)\n ... | ['Wrong Answer', 'Accepted'] | ['s103282331', 's252472214'] | [3064.0, 3064.0] | [17.0, 17.0] | [560, 643] |
p03086 | u779293207 | 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_max = 0\n\nfor k in range(len(s)):\n if S[k] == "A" or S[k] == "C" or S[k] == "G" or S[k] == "T":\n count += 1\n if count > count_max:\n count_max = count\n else:\n count=0\nprint(count_max)\n', 'S = input()\ncount = 0\ncount_max = 0\n\nfor k in ran... | ['Runtime Error', 'Accepted'] | ['s400255923', 's006257981'] | [2940.0, 2940.0] | [18.0, 18.0] | [249, 249] |
p03086 | u779728630 | 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 = {"A", "C", "G", "T"}\nans = 0\nfor i in S:\n if i in s:\n tmp += 1\n ans = max(ans, tmp)\n else:\n tmp = 0\nprint(ans)', 'S = input()\ns = {"A", "C", "G", "T"}\nans = 0\ntmp = 0\nfor i in S:\n if i in s:\n tmp += 1\n ans = max(ans, tmp)\n else:\n tmp = 0\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s739342163', 's450989716'] | [9052.0, 9104.0] | [26.0, 31.0] | [137, 145] |
p03086 | u782930273 | 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)\nm = 0\nfor i in range(n):\n for j in range(i + 1, n + 1):\n print(S[i:j], j - i)\n if j - i > m and all(s in "ACGT" for s in S[i:j]):\n m = j - i\nprint(m)', 'S = list(input())\nn = len(S)\nm = 0\nfor i in range(n):\n for j in range(i + 1, n + 1):\n ... | ['Wrong Answer', 'Accepted'] | ['s060962171', 's856063489'] | [3060.0, 2940.0] | [17.0, 18.0] | [206, 177] |
p03086 | u784341473 | 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\ncount=0\nfor s in S:\n if(s=="A" OR s=="C" OR s=="G" or s=="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=="A" OR s=="C" OR s=="G" OR s=="T"):count+=1\n else:count=0\n m=max(m,count)\nprint(m)', 'S=input()\nm=0\ncount=0\nfor s i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s250310750', 's669823201', 's117479037'] | [2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0] | [132, 132, 133] |
p03086 | u790487011 | 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\n# str = input()\n\nstr = "HATAGAYA"\n\npattern = r"[ATCG]+"\n\nmatched_list = re.findall(pattern, str)\n\nmaxlength = 0\nfor item in matched_list:\n tmplength = len(item)\n if maxlength < tmplength:\n maxlength = tmplength\n\nprint(maxlength)', 'import re\n\nstr = input()\n\n\npattern = r"[A... | ['Wrong Answer', 'Accepted'] | ['s774515919', 's686470061'] | [3188.0, 3188.0] | [19.0, 19.0] | [252, 234] |
p03086 | u790830953 | 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`. | ['ref=input()\n\ncount=0\nseq=["A","T","G","C"]\nfor base in seq:\n if base in ref:\n count +=1\n else:\n count =0\n\nprint(count)', 'ref=input()\n\ncount=0\nseq=["A","T","G,","C"]\nfor base in ref:\n if base in ref:\n count +=1\n else count =0\n\nprint(count)', 'ref=input()\n\ncount=0... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s592278850', 's696343233', 's876276364', 's370878731'] | [2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [139, 130, 141, 231] |
p03086 | u793174294 | 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\n\nS=list(map(str, input()))\nlenth=0\nmax=0\nprint(S)\nfor i in range(len(S)):\n if S[i]=="A" or S[i]=="T" or S[i]=="C" or S[i]=="G":\n lenth+=1\n else:\n if max<lenth:\n max=lenth\n lenth=0\n else:\n lenth=0\nif lenth==len(S):\n max=len... | ['Wrong Answer', 'Accepted'] | ['s084527940', 's769003219'] | [3060.0, 3060.0] | [18.0, 19.0] | [321, 305] |
p03086 | u795323188 | 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()\nnum = []\nlists = ["A","c","G","T"]\ncount = 0\n\nfor i in range(len(s)):\n if s[i] in lists:\n count +=1\n else:\n num.append(count)\n count = 0\nelse:\n num.append(count)\nprint(max(num))\n \n ', 's = input()\nnum = []\nlists = ["A","c","G","T"]\ncount = 0\n\nfor i in ran... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s237574279', 's305926507', 's403962833', 's674596559'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 19.0] | [224, 175, 175, 221] |
p03086 | u796708718 | 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\ncnt = 0\nmax_cnt = 0\n\nfor i in S:\n if i == "A" or "C" or "G" or "T":\n cnt +=1\n if cnt > max_cnt:\n max_cnt = cnt\n else:\n cnt = 0\n \nprint(max_cnt)\n ', 'S = input()\n\ncnt = 0\nmax_cnt = 0\n\nfor i in S:\n if i in "ACGT":\n cnt += 1\n if cnt > max_cnt:\n max_cn... | ['Wrong Answer', 'Accepted'] | ['s464849792', 's517526697'] | [2940.0, 2940.0] | [17.0, 17.0] | [180, 158] |
p03086 | u796789068 | 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=[]\nI=[0]*len(s)\nfor i in range(len(s)):\n if (s[i]=="A" or s[i]=="T" or s[i]=="G" or s[i]=="C"):\n I[i]=1\n\n else:\n I[i]=0\nfor i in range(I):\n if (I[i]==1 and I[i-1]==0) or (I[i]==1 and i==0):\n ans.append(1)\n elif (I[i]==1 and I[i-1]==1):\n ans[-1]+=1\npr... | ['Runtime Error', 'Accepted'] | ['s417905828', 's239842217'] | [3064.0, 3064.0] | [18.0, 22.0] | [318, 358] |
p03086 | u798316285 | 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 range(len(s)):\n l=0\n for j in range(i:len(s)):\n if s[j] in ["A","T","G","C"]:\n l+=1\n else:\n break\n ans=max(ans,l)\nprint(ans)', 's=input()\nans=0\nfor i in range(len(s)):\n l=0\n for j in range(i,len(s)):\n if s[j] in ["A","T","G","C"]:\n l+=1\n else:\... | ['Runtime Error', 'Accepted'] | ['s152944180', 's707342064'] | [2940.0, 3060.0] | [17.0, 18.0] | [168, 168] |
p03086 | u802627598 | 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\nprint(max(map(len, re.split('[ACGT]',input()))))", 's = list(input())\n\ncnt = []\nc = 0\nfor i in s:\n print(i)\n if i == "A" or i == "C" or i == "G" or i =="T":\n c += 1\n else:\n cnt.append(c)\n c = 0\n\nprint(max(cnt))\n', "S = input()\n\ncnt = 0\nmcnt = 0\nfor i in S:\n ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s004055152', 's310074323', 's689114020', 's747264673'] | [3188.0, 3060.0, 2940.0, 2940.0] | [19.0, 21.0, 17.0, 18.0] | [58, 189, 167, 180] |
p03086 | u804566868 | 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`. | ['code = input()\nread_code = list(code)\ncount = 0\ncount_end = 0\n\nfor i in range(0, len(read_code)):\n code_count = False\n if read_code[i] == "A" or read_code[i] == "C" or read_code[i] == "G" or read_code[i] == "T":\n code_count = True\n else:\n code_count = False\n count_end = count\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s166150416', 's436366967', 's070045912'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [391, 391, 345] |
p03086 | u807889603 | 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)\nprint(len(s))\nAns =[0]\nans = 0\nfor i in range(len(s)):\n if s[i]=='A'or s[i]=='T'or s[i]=='G'or s[i]=='C':\n ans += 1\n else:\n Ans.append(ans)\n ans = 0\nAns.append(ans)\nprint(Ans)\nprint(max(Ans))\n", "s=list(input())\n#print(s)\n#print(len(s))\nAns =[0]\nan... | ['Wrong Answer', 'Accepted'] | ['s436830832', 's833959823'] | [3060.0, 2940.0] | [18.0, 18.0] | [244, 247] |
p03086 | u811512248 | 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"]\nS_tf = [any([sss == aaa for aaa in acgt]) for sss in S]\nprint(S_tf)\nmaxlen = 0\ncurlen = 0\nfor i in S_tf:\n if i:\n curlen += 1\n if maxlen < curlen:\n maxlen = curlen\n else:\n curlen = 0\nprint(maxlen)', 'S = input()\nacgt = ["A","C","G... | ['Wrong Answer', 'Accepted'] | ['s578197590', 's045238918'] | [3060.0, 3060.0] | [17.0, 17.0] | [270, 258] |
p03086 | u818724291 | 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())\nanswer = 0\n\nfor i in range(len(S)):\n counter = 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 counter += 1\n print(counter)\n else:\n if counter > answer:\n answer = counter\n ... | ['Wrong Answer', 'Accepted'] | ['s497631005', 's272577797'] | [3060.0, 3060.0] | [17.0, 17.0] | [332, 411] |
p03086 | u818778128 | 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=1\nans_list=[]\nn=len(s)\n\n\nfor i in range(0,n):\n if s[i] in {'A','T','C','G',' '}:\n if i==n-1:\n ans+=1\n elif s[i+1] in {'A','T','C','G',' '}:\n ans+=1\n else:\n ans_list.append(ans)\n ans=1\n\nprint(ans_list)\nif max(ans_list)==1:\n prin... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s103227299', 's907055001', 's094534819'] | [3064.0, 3060.0, 3064.0] | [20.0, 17.0, 17.0] | [335, 157, 364] |
p03086 | u820351940 | 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()\nm = re.findall(r"([ACGT]+)", s)\nprint(max(m, key=len) if m else 0)\n', 'import re\ns = input()\nm = re.findall(r"([ACGT]+)", s)\nprint(len(max(m, key=len)) if m else 0)\n'] | ['Wrong Answer', 'Accepted'] | ['s454620044', 's117378622'] | [3188.0, 3188.0] | [19.0, 21.0] | [89, 94] |
p03086 | u823044869 | 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\ncount = 0\nresult = 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 count += 1\n if result < count:\n result = count\n count =0\n\nif result < count:\n result = count\n\nprint(result)\n", "s = input()\n\ncount = 0\nresult = 0\nfor i in range(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s301759152', 's787011987', 's448057928'] | [2940.0, 3060.0, 2940.0] | [17.0, 48.0, 18.0] | [246, 241, 256] |
p03086 | u823585596 | 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)\nans=0\nstr='ACGT'\nfor i in range(l):\n for j in range(i,l):\n for k in range(i,j+1):\n if str.count(S[k])==1:\n ans=max(ans,j-i+1)\nprint(ans)", "S=input()\nl=len(S)\nans=0\nstr='ACGT'\nfor i in range(l):\n for j in range(i,l):\n if all (str.count(x)... | ['Wrong Answer', 'Accepted'] | ['s218929623', 's725329480'] | [8996.0, 8880.0] | [29.0, 24.0] | [191, 173] |
p03086 | u824734140 | 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\nsplit = re.split('[^ACGT]', input())\nprint(split)\nprint(max(map(len, split)))\n", "import re\n\nsplit = re.split('[^ACGT]', input())\n\nprint(max(map(len, split)))\n"] | ['Wrong Answer', 'Accepted'] | ['s737009943', 's612592646'] | [3188.0, 3188.0] | [20.0, 19.0] | [89, 77] |
p03086 | u825378567 | 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`. | ["list_original=input()\nbox=list(list_original)\nMAX = 0\ncount = 0\nflag = 0\nfor figure in box:\n if figure == 'A' or figure =='G' or figure =='C' or figure == 'G':\n flag = 1\n else:\n flag = 0\n count = 0\n if flag == 1:\n count += 1\n if count > MAX:\n MAX =count\nprint(MAX)", "list_original=in... | ['Wrong Answer', 'Accepted'] | ['s993821086', 's654351862'] | [3060.0, 3060.0] | [17.0, 17.0] | [283, 284] |
p03086 | u826557401 | 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\nacgt_list = ["A", "C", "G", "T"]\n\ncount = 0\ncount_list = []\ncount_list.append(0)\nlist_S = list(S)\n\nfor i in range(0, len(list_S)):\n if list_S[i] in acgt_list:\n for j in range(i, len(list_S)):\n if list_S[j] in acgt_list:\n count += 1\n else:\n count_list.append... | ['Wrong Answer', 'Accepted'] | ['s744206857', 's592260765'] | [3188.0, 3064.0] | [20.0, 17.0] | [381, 476] |
p03086 | u827141374 | 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()\nz = ''\nans = ''\nfor i in range(len(s)):\n if s[i] in 'ACGT':\n z = s[i]\n\tfor j in range(i+1, len(s)):\n if s[j] in 'ACGT':\n z += s[j]\n else:\n if len(s) > len(ans):\n ans = s\n z = ''\n else:\n continue\nprint(ans)", "s = input()\nz = ''\nans = 0\nfor... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s777934275', 's921557572', 's672004488'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [265, 273, 283] |
p03086 | u831752983 | 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()\ndef c(b):\n return b=='A' or b=='G' or b=='T' or b=='C'\n\nsuc=[]\nct=0\nfor let in s:\n if c(let):\n ct+=1\n else:\n suc.append(ct)\n suc=0\nsuc.append(ct)\nprint(max(suc))", "s=input()\ndef c(b):\n return b=='A' or b=='G' or b=='T' or b=='C'\n\nsuc=[]\nct=0\nfor let in s:\n if c(let):\n ... | ['Runtime Error', 'Accepted'] | ['s245623358', 's618478629'] | [3060.0, 3060.0] | [17.0, 17.0] | [183, 182] |
p03086 | u840570107 | 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\nlis = []\n\nfor a in s:\n if a == "A" or a == "T" or a == "C" or a == "G":\n ans += 1\n else:\n lis.append(ans)\n ans = 0\n\nprint(lis)\n ', 's = input()\nans1 = 0\nans2 = 0\n\nfor a in s:\n if a == "A" or a == "T" or a == "C" or a == "G":\n ans2 += 1\n else:\n if ans1 < ans2:... | ['Wrong Answer', 'Accepted'] | ['s549555340', 's785689115'] | [2940.0, 2940.0] | [19.0, 18.0] | [159, 216] |
p03086 | u840579553 | 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\nimport numpy as np\nimport math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heappush, heappop\nfrom itertools import permutations, combinations, product, accumulate, groupby\nfrom bi... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s786122515', 's889633386', 's498827383'] | [13528.0, 13404.0, 13572.0] | [160.0, 157.0, 163.0] | [1760, 1789, 1784] |
p03086 | u842964692 | 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()\nN=len(S)\n\nans=0\n\'\'\'\nfor i in range(N):\n if S[i] in "ACGT":\n ans=1\n\nfor l in range(N-1):\n for r in range(l+1,N):\n for s in S[l:r]:\n if not s in "ACGT":\n break\n else:\n ans=max(ans,len(S[l:r])) \n\'\'\'\n\nfor i in range(N):\n ... | ['Runtime Error', 'Accepted'] | ['s843266430', 's677781726'] | [2940.0, 3060.0] | [18.0, 18.0] | [467, 464] |
p03086 | u844646164 | 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`. | ["for i in range(len(S)):\n for j in range(i, len(S)):\n count = 0\n print(list(S[i:j+1]))\n for s in list(S[i:j+1]):\n if s in ['A', 'G', 'T', 'C']:\n count += 1\n else:\n if m <= count:\n m = count\n count = ... | ['Runtime Error', 'Accepted'] | ['s090784934', 's428504412'] | [2940.0, 3060.0] | [17.0, 17.0] | [318, 477] |
p03086 | u844872527 | 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\ntmp=0\nlength=[]\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 tmp+=1\n if i==len(s)-1:\n length.append(tmp)\n else:\n length.append(tmp)\n tmp=0\nprint(length)', 's=input()\n\ntmp=0\nlength=[]\n\nfor i in range(len(s)):\n... | ['Wrong Answer', 'Accepted'] | ['s171552917', 's344084652'] | [9056.0, 9056.0] | [28.0, 24.0] | [243, 248] |
p03086 | u846870091 | 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)\ncnt = 0\nmaxcount = 0\nprint(S)\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 cnt += 1\n if cnt > maxcount:\n maxcount = cnt\n else:\n cnt = 0\nprint(maxcount)', 'S = input()\nS = list(S)\ncnt = 0\nmaxcount =... | ['Wrong Answer', 'Accepted'] | ['s067088116', 's588744076'] | [3064.0, 3060.0] | [17.0, 18.0] | [256, 247] |
p03086 | u848647227 | 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()\ncount = 0\nmx = 0\nfor i in range(len(a)):\n\tif a[i] == "A" or a[i] == "C" or a[i] == "G" or a[i] == "T":\n count += 1\n else:\n count = 0\n if ma < count:\n mx = count\nprint(mx)', 'a = input()\ncount = 0\nmx = 0\nfor i in range(len(a)):\n if a[i] == "A" or a[i] == "C" or a[i] =... | ['Runtime Error', 'Accepted'] | ['s534177643', 's118265499'] | [2940.0, 3060.0] | [17.0, 17.0] | [203, 212] |
p03086 | u848882989 | 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\narg = input()\nscavenger=''\nwarehouse=[]\nlongest=0\ni=0\n\nfor tmp in arg[0:]:\n if tmp=='A' | tmp=='T' | tmp=='C' | tmp=='G':\n scavenger=scavenger+tmp\n else:\n warehouse.append(scavenger)\n scavenger=''\n\nfor tmp in warehouse[0:]:\n if len(tmp)>longest:\n longest=len(tmp)\n\nprint(l... | ['Runtime Error', 'Accepted'] | ['s988183867', 's990532833'] | [3060.0, 3060.0] | [19.0, 19.0] | [306, 338] |
p03086 | u851704997 | 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 range(0,len(S)):\n tmp = S[i]\n if(tmp == "A" or tmp == "G" or tmp == "C" or tmp == "T"):\n ans += 1\n else:\n ans = 0\nprint(str(ans))', 'S = input()\nans = 0\ntmp2 = 0\nfor i in range(0,len(S)):\n tmp = S[i]\n if(tmp == "A" or tmp == "G" or tmp == "C" or tmp == "T"):\n a... | ['Wrong Answer', 'Accepted'] | ['s329885935', 's789822062'] | [2940.0, 2940.0] | [18.0, 17.0] | [167, 200] |
p03086 | u854685063 | 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)\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]):\n ans = max(ans,j - i + 1)\nprint(ans)', 's = input()\nn = len(s)\nfor i in range(n):\n for j in range(i,n):\n if all("ATGC".cout(c) == 1 for c in s[i:j+1]):\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s070649118', 's177636419', 's546622233', 's744339381'] | [3060.0, 3056.0, 3056.0, 27100.0] | [18.0, 18.0, 18.0, 118.0] | [170, 169, 164, 840] |
p03086 | u857070771 | 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())\nd=["A","G","C","T"]\na=[]\nb=[]\nx=[]\nfor i in range(len(s)):\n a.append(s[i:])\nfor j in a:\n for k in range(len(j)-1):\n b.append(j[:-k-1])\nans=a+b\nfor i in ans:\n if list(set(i)) == d:\n x.append(len(i))\n else:\n pass\nprint(max(x))', 's=list(input())\nd=["A","... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s761860832', 's828200445', 's532374977'] | [3064.0, 3188.0, 3064.0] | [17.0, 19.0, 17.0] | [273, 308, 297] |
p03086 | u857408368 | 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# print(S)\n# print(len(S))\nlist = []\nfor i in range(len(S)):\n if(S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T"):\n list.append(i)\n# print(list)\nNUM = []\nfor j in range(len(list)):\n num = 1\n for k in range(len(list) - j - 1):\n # print("k",k)\n if(list[k+1... | ['Wrong Answer', 'Accepted'] | ['s375775139', 's620821869'] | [3064.0, 3064.0] | [17.0, 17.0] | [487, 772] |
p03086 | u861962192 | 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 = b\nn, m = 0, 0\nfor i in "ACGT":\n c = c.replace(i, "")\nfor j in c:\n n = max([len(k) for k in b.split(j)])\n if n > m:\n m = n\nif c == "":\n print(len(b))\nelse:\n print(m)\n', 'b = input()\nc = b\nn, m = 0, 0\nfor i in "ACGT":\n c += c.replace(i, "")\nfor i in c:\n n =... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s390843103', 's608550467', 's217350350'] | [3060.0, 2940.0, 3060.0] | [18.0, 17.0, 20.0] | [203, 164, 140] |
p03086 | u865067466 | 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`. | ['ACGT = [\'A\', \'C\', \'G\', \'T\']\n\n\ndef not_acgt(s):\n for c in s:\n if c not in ACGT:\n return False\n\n return True\n\n\ndef main():\n S = input()\n\n results = []\n # all_results = []\n for i in range(len(S)):\n for j in range(len(S)):\n if not_acgt(S[i:j]... | ['Wrong Answer', 'Accepted'] | ['s346279056', 's570913459'] | [3060.0, 3064.0] | [17.0, 17.0] | [462, 515] |
p03086 | u868040597 | 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/python\n\nimport re\n\ndef main():\n s = str(input())\n print(max([x for x in (re.split(\'[^ACGT]+\', s))]))\n\n\nif __name__ == "__main__":\n main()', '#!/usr/bin/python\n\nimport re\n\ndef main():\n print(max([len(x) for x in re.findall(r\'[ACGT]*\', str(input()))]))\n\nif __name__ == "__main... | ['Wrong Answer', 'Accepted'] | ['s466785949', 's319745587'] | [3316.0, 3188.0] | [23.0, 20.0] | [157, 151] |
p03086 | u868600519 | 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 = re.findall(r'[ACGT]+', S)\nif l:\n print(max(map(len, l)))\nelse:\n print(0)\n", "import re\n\nS = input()\nl = re.findall(r'[ACGT]+', S)\nprint(max(map(len, l), default=0))"] | ['Runtime Error', 'Accepted'] | ['s955198024', 's174868917'] | [2940.0, 3188.0] | [17.0, 19.0] | [91, 87] |
p03086 | u868982936 | 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\n\nfor i in range(S):\n if i == "A" or i == "C" or i == "G" or i == "T":\n count += 1\nprint("%d"%(count)) \n \n', "s = input()\nans = 0\nmemo = 0\nfor i in s:\n if i == 'A' or i == 'T' or i == 'C' or i == 'G':\n memo += 1\n else:\n ans = max(ans, memo)\n memo... | ['Runtime Error', 'Accepted'] | ['s739748355', 's943243958'] | [2940.0, 2940.0] | [17.0, 17.0] | [135, 189] |
p03086 | u870178975 | 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,b=0\nfor i in 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=0\nfor i in s:\n if i in ATGC:\n a+=1\n else:\n b=a\n a=0\nprint(max(a,b))', 's=list(map(str,input().split()))\na=0\nfor i in s:\n if i in ATGC:\n a+=1\n else:\n b=a\n a... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s034342456', 's043238239', 's374167718', 's994028409', 's715369736'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 20.0, 17.0] | [102, 90, 113, 93, 104] |
p03086 | u870286225 | 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 = list(S)\nS_ex = ''.join((['1' if (k == 'A' or k == 'C' or k == 'G' or k == 'T') else '0' for k in S_list]))\nS_ans = [len(k) for k in S_ex.split('0')]\nmax(S_ans)", "S = input()\nS_list = list(S)\nS_ex = ''.join((['1' if (k == 'A' or k == 'C' or k == 'G' or k == 'T') else '0' for k in S_list]))\... | ['Wrong Answer', 'Accepted'] | ['s558103342', 's240011710'] | [2940.0, 3060.0] | [17.0, 17.0] | [180, 187] |
p03086 | u870793476 | 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()\nans = 0\ncount = 0\n\nfor s in S:\n if s in ["A", "C", "G", "T"]:\n count += 1\n ans = max(max_count, count)\n else:\n count = 0\n\nprint(ans)', '\nS = input()\nans = 0\ncount = 0\n\nfor s in S:\n if s in ["A", "C", "G", "T"]:\n count += 1\n ans = max(ans, co... | ['Runtime Error', 'Accepted'] | ['s289479037', 's039208911'] | [3064.0, 2940.0] | [17.0, 17.0] | [172, 166] |
p03086 | u874333466 | 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_list = list(input())\nstring_len = len(string_list)\nrenzoku_list = []\n\ndef find_letter():\n renzoku = 0\n for i in string_len:\n if string_list[i]=='A':\n renzoku += 1\n elif string_list[i]=='C':\n renzoku += 1\n elif string_list[i]=='G':\n renzoku += 1\n elif string_list[i]=='T... | ['Runtime Error', 'Accepted'] | ['s799306902', 's686346136'] | [3064.0, 3064.0] | [17.0, 17.0] | [600, 526] |
p03086 | u875028418 | 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)\nlongest=0\nfor i in range(L):\n for j in range(i):\n DUP=S[j:i+1]\n DUP=DUP.replace("A","#")\n DUP=DUP.replace("T","#")\n DUP=DUP.replace("G","#")\n DUP=DUP.replace("C","#")\n count=0\n for a in range(len(DUP)):\n if DUP[a]=="#":\n count+=1\n else:\n ... | ['Wrong Answer', 'Accepted'] | ['s713306841', 's282711339'] | [3064.0, 3064.0] | [17.0, 17.0] | [370, 371] |
p03086 | u875855656 | 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()\nc=0\nm=0\nacgt=['A','C','G','T']\nfor e in s:\n if e in acgt:\n print(e)\n c+=1\n else:\n if c > m:\n m=c\n c=0\nprint(m)", 's=input()\nc=0\nm=0\nfor e in s:\n if e in "ACGT":\n c+=1\n else:\n if c>m:\n m=c\n c=0\nif c>m:\n m=c\nprint(m)'] | ['Wrong Answer', 'Accepted'] | ['s526426955', 's433810663'] | [2940.0, 2940.0] | [17.0, 17.0] | [139, 117] |
p03086 | u877220920 | 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 = re.split(r'[^ATGC]', S)\n\nmaxlen = -1\nmaxarg = 0\nfor i,a in enumerate(ans):\n if len(a) > maxlen:\n maxlen = len(a)\n maxarg = i\nprint(ans[maxarg])\n\n", "import re\n\nS = input()\nans = re.split(r'[^ATGC]', S)\n\nmaxlen = -1\nmaxarg = 0\nfor a in ans:\n maxlen ... | ['Wrong Answer', 'Accepted'] | ['s000964511', 's861126458'] | [3188.0, 3188.0] | [21.0, 19.0] | [191, 158] |
p03086 | u882370611 | 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 ans += max(ans, j-i+1)\nprint(ans)\n\n \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 ... | ['Wrong Answer', 'Accepted'] | ['s977957965', 's401647241'] | [2940.0, 2940.0] | [17.0, 17.0] | [170, 169] |
p03086 | u883574098 | 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 io, sys, atexit, os\n\nimport math as ma\nfrom sys import exit\nfrom decimal import Decimal as dec\nfrom itertools import permutations\n\n\ndef li ():\n\treturn list (map (int, input ().split ()))\n\n\ndef num ():\n\treturn map (int, input ().split ())\n\n\ndef nu ():\n\treturn int (input ())\n\n\ndef find_gcd... | ['Wrong Answer', 'Accepted'] | ['s526094885', 's236511041'] | [5844.0, 5588.0] | [205.0, 94.0] | [644, 653] |
p03086 | u887207211 | 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()\nT = set()\nfor i in range(len(S)):\n for j in range(len(S)):\n T.add(S[i:i+j])\nfrom itertools import product\ncheck = []\nfor i in range(11):\n for per in product(["A","C","G","T"], repeat = i):\n per = "".join(per)\n check.append(per)\ncheck = list(set(check))\n\nans = 0\nfor t in T:\n tt =... | ['Wrong Answer', 'Accepted'] | ['s087573661', 's575230730'] | [151812.0, 3064.0] | [2109.0, 17.0] | [372, 511] |
p03086 | u890638336 | 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()\nlis_S = list(S)\nAns = 0\nfor char in lis_S:\n if char=="A" or char=="C" or char=="G" or char=="T":\n Ans += 1\n elif index < len(lis_S):\n continue\n else:\n break\nprint(Ans)', 'S = input()\nlis_S = list(S)\nAns = []\nindex = 0\nn = 0\nfor char in lis_S:\n Ans.append(0)... | ['Runtime Error', 'Accepted'] | ['s877976155', 's184690270'] | [2940.0, 3060.0] | [17.0, 17.0] | [209, 305] |
p03086 | u891482208 | 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, cnt = 0\nfor c in s:\n if c in ['A', 'C', 'T', 'G']:\n cnt += 1\n if cnt > ans:\n ans = cnt\n else:\n cnt = 0\nprint(ans)", "s = input()\nans = 0\ncnt = 0\nfor c in s:\n if c in ['A', 'C', 'T', 'G']:\n cnt += 1\n if cnt > ans:\n ans = cnt\n else:\n cnt = 0\nprint(... | ['Runtime Error', 'Accepted'] | ['s836500983', 's724600873'] | [2940.0, 2940.0] | [18.0, 17.0] | [150, 149] |
p03086 | u892340697 | 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 string\nstr_up = string.ascii_uppercase.replace("A","").replace("C","").replace("G","").replace("T","")\nS = input()\npart = []\nfor i in range(len(S)):\n for j in range(len(S)-i+1):\n part.append(S[i:i+j])\nmax_s = 0\nprint(part)\nfor i in part:\n for j in str_up:\n if j in i:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s065085711', 's691529875', 's249770368'] | [3772.0, 3772.0, 3832.0] | [26.0, 24.0, 24.0] | [410, 703, 692] |
p03086 | u893063840 | 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\ns.append("X")\npat = ["A", "C", "G", "T"]\nmx = 0\ncount = 0\n\nfor i in range(len(s)):\n if s[i] in pat:\n count += 1\n else:\n if count > mx:\n mx = count\n count = 0\n\nprint(mx)\n', 's = input()\n\ns += "X"\npat = ["A", "C", "G", "T"]\nmx = 0\ncount = 0\n\nfor ... | ['Runtime Error', 'Accepted'] | ['s975280686', 's099150371'] | [3060.0, 2940.0] | [18.0, 18.0] | [220, 215] |
p03086 | u895445743 | 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(i)\n \nres=0\nfor i in range(n):\n for j in range(i,n):\n sub=s[i:j+1]\n flg=True\n for k in sub:\n if(k not in ['A','G','C','T']):\n flg=False\n if(flg):\n res=max(res,len(sub))\n \nprint(res)", "i=input()\nn=len(i)\n\nres=0\nfor i in range(n):\n for j in range(i,... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s106838034', 's448881169', 's232556597'] | [3064.0, 3064.0, 3064.0] | [19.0, 17.0, 17.0] | [231, 230, 231] |
p03086 | u896941378 | 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`. | ["ACGT = ['A', 'C', 'G', 'T']\nS = input()\ncnt = 0\nmax_cnt = 0\nfor s in S:\n if s in ACGT:\n cnt += 1\n cntList.append(cnt)\n else:\n max_cnt = max(cnt, max_cnt)\n cnt = 0\nprint(max_cnt)", "S = input()\n \nACGT = ['A', 'C', 'G', 'T']\ncntList = []\ncnt = 0\ncntList.append(cnt)\nfor... | ['Runtime Error', 'Accepted'] | ['s022006949', 's011634872'] | [9080.0, 8940.0] | [28.0, 25.0] | [211, 203] |
p03086 | u902973687 | 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)\ntmp = ['']\nx = {'A', 'C', 'G', 'T'}\nfor i in range(N):\n for j in range(i, N):\n if set(S[i:j+1]) <= x:\n tmp.append(S[i:j+1])\nprint(max(tmp, key=len))\n", "S = input()\nN = len(S)\ntmp = ['']\nx = {'A', 'C', 'G', 'T'}\nfor i in range(N):\n for j in range(i, N):\n ... | ['Wrong Answer', 'Accepted'] | ['s601361456', 's361083398'] | [3060.0, 3060.0] | [17.0, 17.0] | [193, 194] |
p03086 | u904804404 | 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()\nch = string[0]\nmax_string_len = 0\nprev_len = 0\nfor idx,ch in enumerate(string):\n if ch in {"A","T","G","C"}:\n prev_len += 1\n \tmax_string_len = max(max_string_len,prev_len)\n else:\n prev_len = 0\n \nprint(max_string_len)', 'string = input()\nch = string[0]\nmax_string_len = 0\npr... | ['Runtime Error', 'Accepted'] | ['s181579635', 's580432550'] | [3064.0, 2940.0] | [17.0, 18.0] | [246, 248] |
p03086 | u906129425 | 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 + 1, n):\n if all(c in 'ATCG' for c in s[i:j]):\n ans += 1\n\nprint(ans)\n", "s = input()\nn = len(s)\nans = 0\nfor i in range(n):\n for j in range(i + 1, n + 1):\n if all(c in 'ATCG' for c in s[i:j]):\n ... | ['Wrong Answer', 'Accepted'] | ['s120060393', 's634990987'] | [2940.0, 2940.0] | [17.0, 17.0] | [158, 175] |
p03086 | u910632349 | 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\nans=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 count+=1\n else:\n ans=max(ans,count)\n count=0\nprint(ans,count)', 's=input()\ncount=0\nans=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 ... | ['Wrong Answer', 'Accepted'] | ['s889468974', 's541323575'] | [8980.0, 9000.0] | [29.0, 29.0] | [191, 196] |
p03086 | u912158215 | 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()\nmaxlength = 0\nlength = 0\nfor i in S:\n if i in 'ATGC':\n length += 1\n else:\n length =0\n maxlength = max(maxlength, length)", "S = input()\nmaxlength = 0\nlength = 0\nfor i in S:\n if i in 'ATGC':\n length += 1\n else:\n length =0\n maxlength = max(maxlength, length)\nprint (maxleng... | ['Wrong Answer', 'Accepted'] | ['s755762465', 's562237120'] | [2940.0, 2940.0] | [17.0, 17.0] | [141, 159] |
p03086 | u917733926 | 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`. | ['tmp = input()\n\nout_1 = 0\nfor c in tmp:\n tmp_s = []\n if c == "A" or c == "G" or c == "T" or c == "C":\n tmp_s.append(c)\n elif out_1 < len(tmp_s):\n out_1 = len(tmp_s)\n tmp_s = []\nprint(out_1)', 'tmp = input()\n\nout_1 = 0\nfor c in tmp:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s393868542', 's942156690', 's069998127'] | [3060.0, 2940.0, 3060.0] | [19.0, 18.0, 17.0] | [254, 228, 324] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.