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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03085 | u996698785 | 2,000 | 1,048,576 | On the Planet AtCoder, there are four types of bases: `A`, `C`, `G` and `T`. `A` bonds with `T`, and `C` bonds with `G`. You are given a letter b as input, which is `A`, `C`, `G` or `T`. Write a program that prints the letter representing the base that bonds with the base b. | ["def helix(x):\n if x in 'AT':\n return 'AT'.replace(x, '')\n elif x in 'GC':\n return 'GC'.replace(x, '')", "b=input()\nc={ 'A' : 'T' , 'T' : 'A' , 'C' : 'G' , 'G': 'C' }\nprint(c[b])"] | ['Wrong Answer', 'Accepted'] | ['s429663905', 's209227636'] | [2940.0, 2940.0] | [17.0, 17.0] | [109, 72] |
p03085 | u996749146 | 2,000 | 1,048,576 | On the Planet AtCoder, there are four types of bases: `A`, `C`, `G` and `T`. `A` bonds with `T`, and `C` bonds with `G`. You are given a letter b as input, which is `A`, `C`, `G` or `T`. Write a program that prints the letter representing the base that bonds with the base b. | ['s = input()\nm = 0\nc = 0\nS = {"A", "C", "G", "T"}\nfor i in range(len(s)):\n if s[i] in S:\n c += 1\n else:\n if c != 0:\n if c > m:\n m = c\n c = 0\n\nif c > m:\n m = c\n\nprint(m)', 'a = input()\nif a == "A":\n print("T")\nelif a == "C":\n print("G")\n... | ['Wrong Answer', 'Accepted'] | ['s349268430', 's765030699'] | [3060.0, 2940.0] | [17.0, 17.0] | [227, 112] |
p03085 | u999331208 | 2,000 | 1,048,576 | On the Planet AtCoder, there are four types of bases: `A`, `C`, `G` and `T`. `A` bonds with `T`, and `C` bonds with `G`. You are given a letter b as input, which is `A`, `C`, `G` or `T`. Write a program that prints the letter representing the base that bonds with the base b. | ['s = input()\nif(s == "A"):\n print("F")\nelif(s == "T"):\n print("A")\nelif(s == "C"):\n print("G")\nelif(s == "G"):\n print("C")', 's = input()\nif(s == "A"):\n print("T")\nelif(s == "T"):\n print("A")\nelif(s == "C"):\n print("G")\nelif(s == "G"):\n print("C")'] | ['Wrong Answer', 'Accepted'] | ['s201386903', 's836513189'] | [2940.0, 2940.0] | [17.0, 17.0] | [134, 134] |
p03086 | u000513658 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nstr = []\nans = []\n\nfor i in range(len(s)):\n if s[i] in "ACGT":\n str.append(s[i])\n else:\n ans.append(len(str))\n str = []\nprint(max(ans))\nprint(ans)', "S = input()\n\nACGT = 'ACGT'\n\ncount = []\ntmp_num = 0\nfor i in S:\n if i in ACGT:\n tmp_num += 1\n e... | ['Runtime Error', 'Accepted'] | ['s015940445', 's138452582'] | [2940.0, 9100.0] | [17.0, 31.0] | [186, 216] |
p03086 | u011062360 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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_s = list(s)\nk = 0\nans = 0\nfor c in list_s:\n if c == "A" or c == "C" or c == "G" or c == "T":\n k += 1\n\nprint(ans)', 's = input()\nlist_s = list(s)\nk = 0\nans = []\nfor i in range(len(list_s)):\n c = list_s[i]\n if c == "A" or c == "C" or c == "G" or c == "T":\n k += 1\n... | ['Wrong Answer', 'Accepted'] | ['s580947581', 's157768158'] | [3060.0, 3064.0] | [18.0, 18.0] | [139, 249] |
p03086 | u016182925 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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_S = [S]\nch = 0\nan = 0\nfor i in S :\n if i in list_S:\n ch += 1\n else :\n an = max(an, ch)\n ch = 0\nprint(an)', 'S = input()\ni = ["A","G","C","T"]\nlist_S = [S]\nch = 0\nan = 0\nfor j in S :\n if j in i :\n ch += 1\n else :\n an = max(an, ch)\n ch = 0\nprint(max(an,ch))'] | ['Wrong Answer', 'Accepted'] | ['s407121240', 's058318814'] | [2940.0, 3060.0] | [17.0, 17.0] | [132, 158] |
p03086 | u016567570 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['S = str(input())\ns_list=[]\nstring= ""\nAGCT = ["A", "G", "C", "T"]\nfor s in S:\n if s in AGCT:\n string += s\n else:\n s_list.append(string)\n string=""\nmax(map(len, s_list))', 'S = input()\ns_list=[]\nstring= ""\nAGCT = ["A", "G", "C", "T"]\nfor s in S:\n if s in AGCT:\n stri... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s237084286', 's448744549', 's645753127'] | [2940.0, 2940.0, 3060.0] | [19.0, 17.0, 17.0] | [195, 190, 248] |
p03086 | u017624958 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\n\nbase_pairs = {\n 'A': 'T', \n 'C': 'G',\n 'G': 'C',\n 'T': 'A',\n}\n\npair = base_pairs.get(b)\n\nprint(pair)\n", "S = input()\n\nanswer = ''\nnumber_of_consecutive_times = 0\nmaxium_number_of_consecutive_times = 0\nfor char in S:\n is_included = char in ['A', 'C', 'G', 'T']\n\n if is... | ['Wrong Answer', 'Accepted'] | ['s930818276', 's237595991'] | [2940.0, 3060.0] | [17.0, 19.0] | [126, 453] |
p03086 | u021019433 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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(map(len,re.finditer('[ACGT]*',input())))", "import re\nprint(max(map(len,re.finditer('[ACGT]*',input()))))", "import re\nprint(max(x.end()-x.start() for x in re.finditer('[ACGT]*',input())))"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s718020724', 's788945013', 's098239555'] | [3188.0, 3188.0, 3188.0] | [21.0, 21.0, 19.0] | [56, 61, 79] |
p03086 | u021548497 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nk = 0\nans = 0\nfor i in range(s):\n if s[i] == "A" or "G" or "C" or "T":\n k += 1\n else:\n ans = max(ans, k)\n k = 0\nans = max(ans, k)\nprint(ans)', 's = input()\nk = 0\nans = 0\nfor i in range(len(s)):\n if s[i] == "A" or "G" or "C" or "T":\n k += 1\n else:\n ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s209430514', 's927312455', 's787869220'] | [3060.0, 3064.0, 3060.0] | [19.0, 18.0, 17.0] | [179, 184, 209] |
p03086 | u022215787 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = ['A','C','G','T']\n\nans = 0\ntmp_ans = 0\nfor i in s:\n if i in t:\n tmp_ans += 1\n print(i)\n else:\n ans = max(tmp_ans, ans)\n tmp_ans = 0\nans = max(tmp_ans, ans)\nprint(ans)", "s = input()\nt = ['A','C','G','T']\n\nans = 0\ntmp_ans = 0\nfor i in s:\n if i in ... | ['Wrong Answer', 'Accepted'] | ['s674383447', 's747425825'] | [9032.0, 9108.0] | [26.0, 25.0] | [216, 199] |
p03086 | u022871813 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nt = 0\nfor i in s:\n if i == 'A' or i == 'T' or i == 'G' or i == 'C':\n t += 1\n else:\n if t > a:\n a = t\n t = 0\na = t\nprint(a)\n", "s = input()\na = 0\nt = 0\nfor i in s:\n if i == 'A' or i == 'T' or i == 'G' or i == 'C':\n t += 1\n else:... | ['Wrong Answer', 'Accepted'] | ['s608381647', 's774437288'] | [2940.0, 3060.0] | [18.0, 19.0] | [183, 194] |
p03086 | u023229441 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nprint(max(1,s.count("A"))*max(1,s.count("T"))*max(1,s.count("G"))*max(1,s.count("C")))\n', 's=input()\nprint(s.count("A")*s.count("T")*s.count("G")*s.count("C"))', 's=input()\nprint(max(1,s.count("A"))+max(1,s.count("T"))+max(1,s.count("G"))+max(1,s.count("C")))\n', 's=list(input())\nans=0\nnow=0\nfor q in... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s566378833', 's756538557', 's914025636', 's393455317'] | [2940.0, 2940.0, 2940.0, 2940.0] | [19.0, 17.0, 20.0, 17.0] | [97, 68, 97, 141] |
p03086 | u024245528 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['import itertools\n# ACGT\nS = list(input())\n\nindex_num =[]\n\nACGT = list("ACGT")\n\nfor i in ACGT:\n index_num.append([n for n, v in enumerate(S) if v == i])\n\n\naaa =sorted(list(itertools.chain.from_iterable(index_num)))\n#print(aaa)\ncnt =0\nmax_cnt =0\n\nfor i in range(len(aaa)-1):\n if aaa[i]+1 == aaa[i... | ['Wrong Answer', 'Accepted'] | ['s754073397', 's535634498'] | [3060.0, 2940.0] | [17.0, 17.0] | [394, 172] |
p03086 | u032222383 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\nN = len(S)\nans = 0\nfor i in range(N):\nfor j in range(i, N):\nif all('ACGT'.count(c) == 1 for c in S[i : j + 1]):\nans = max(ans, j - i + 1)\nprint(ans)\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 ... | ['Runtime Error', 'Accepted'] | ['s766358817', 's719295317'] | [2940.0, 3060.0] | [17.0, 17.0] | [161, 184] |
p03086 | u033963510 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\npattern = "[A|T|G|C]+"\nmatch_result = re.findall(pattern, S)\n\nans = 0\nfor word in match_result:\n if ans <= len(word): ans = len(word)\n', '\nimport re\n\nS = input()\n\npattern = "[A|T|G|C]+"\nmatch_result = re.findall(pattern, S)\n\nans = 0\nfor word in match_result:\n if ans <... | ['Wrong Answer', 'Accepted'] | ['s035973575', 's616825196'] | [3188.0, 3188.0] | [19.0, 20.0] | [161, 173] |
p03086 | u037221289 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = [s for s in input()]\n\nAnswer_list = []\nDNA = ['A','T','G','C']\nfragment = ''\n\nfor x in S:\n if x in DNA:\n fragment += x\n \n else:\n Answer_list.append(fragment)\n fragment = ''\nAnswer_list.append(fragment)\nsorted_Answer_list = sorted(Answer_list) \nprint(sorted_Answer_list[-1])", "S = ... | ['Wrong Answer', 'Accepted'] | ['s801346886', 's286045074'] | [3060.0, 2940.0] | [22.0, 19.0] | [295, 175] |
p03086 | u038408819 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 si in s:\n if si in acgt:\n cnt += 1\n ans = max(ans, cnt)\n else:\n cnt = 0\n #print(ans)\nprint(ans)", "s = input()\nacgt = ['A', 'C', 'G', 'T']\nans = 0\nfor si in s:\n if si in acgt:\n cnt += 1\n ans = max(ans, c... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s012023250', 's416610900', 's872544139'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [177, 177, 185] |
p03086 | u038676814 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\npattern = '[A|C|G|T]+'\n\n# findall \nresults = re.findall(pattern, S, re.S)\n\nif len(results) == 0 :\n print(0)\nelse :\n print(max(results))", "import re\nS = input()\n\npattern = '[A|C|G|T]+'\n\n# findall \nresults = re.findall(pattern, S, re.S)\n\nif len(results) == 0 :\n print... | ['Wrong Answer', 'Accepted'] | ['s769618974', 's307232775'] | [3188.0, 3188.0] | [19.0, 20.0] | [164, 177] |
p03086 | u045091221 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nprint ('AC' if re.match(r'\\AA[a-z]+C[a-z]+\\Z', input()) else 'WA') \n", "import re\n\nm = re.findall(r'[ATCG]+', input())\nprint(max([len(x) for x in m]) if m else '0')\n"] | ['Wrong Answer', 'Accepted'] | ['s507576039', 's839195123'] | [9860.0, 9720.0] | [35.0, 34.0] | [80, 93] |
p03086 | u045408189 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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=['A','T','G','C']\nans=0\nM=0\nfor i in range(s):\n if s[i] in L:\n ans += 1\n else:\n if ans > M:\n M = ans\n ans = 0\nprint(M)", "s=input()\nL=['A','T','G','C']\nans=0\nM=0\nfor i in range(len(s)):\n if s[i] in L:\n ans += 1\n else:\n if ans > M:\n M = ans\n ... | ['Runtime Error', 'Accepted'] | ['s286971344', 's797528879'] | [2940.0, 3060.0] | [17.0, 17.0] | [146, 200] |
p03086 | u045953894 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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() ; c = 0 ; l = []\n\nfor i in s:\n if i == 'A' or i == 'T' or i == 'G' or i == 'C':\n c += 1\n if i != 'A' and i != 'T' and i != 'G' and i != 'C':\n l.append(c)\n c = 0\n \nprint(l(max))\n ", "s = input()\na = ['A','T','G','C']\nans = []\nc = 0\n\nfor i in s:\n ... | ['Runtime Error', 'Accepted'] | ['s782178294', 's606680487'] | [3060.0, 9048.0] | [17.0, 28.0] | [235, 204] |
p03086 | u057964173 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 resolve():\n n=int(input())\n l=list(map(int, input().split()))\n ans='YES'\n l.sort()\n for i in range(n-1):\n if l[i]==l[i+1]:\n ans='NO'\n print(ans)\n\nresolve()", "def resolve():\n s=input()\n cnt=0\n ans=0\n for i in s:\n if i in ['A','T','C','G']:\n ... | ['Runtime Error', 'Accepted'] | ['s366419871', 's256550360'] | [3060.0, 2940.0] | [18.0, 18.0] | [195, 204] |
p03086 | u062691227 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nimport numpy as np\ns = 'ATGCKKAA'\ns = input()\natgcs = re.split(r'[^ATGC]', s)\nlens = np.array(list(map(len, atgcs)))\nret = atgcs[lens.argmax()]\nprint(ret)", "import re\nimport numpy as np\ns = input()\natgcs = re.split(r'[^ATGC]', s)\nlens = np.array(list(map(len, atgcs)))\nret = atgcs[lens.argmax()]... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s759357445', 's762067783', 's887316994'] | [21520.0, 12508.0, 21492.0] | [1776.0, 148.0, 1997.0] | [164, 150, 130] |
p03086 | u068750695 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 hantei(n):\n for i in range(len(n)):\n if n[i]!="A" and n[i]!="G" and n[i]!="T" and n[i]!="C":\n return False\n\ns=input()\nT=[]\nn=[]\nm=[]\nx=0\n\nfor i in range(len(s)-1):\n for j in range(i+1,len(s)):\n T.append(s[i:j+1])\n\nflag=False\nfor i in range(len(T)):\n w=T[i]\n i... | ['Wrong Answer', 'Accepted'] | ['s201231264', 's323208500'] | [3064.0, 3064.0] | [17.0, 17.0] | [444, 481] |
p03086 | u069172538 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['SHINJUKU', 'x=input()\nN=len(x)\nmaxl=0\nfor i in range(N):\n if (x[i]=="A")or(x[i]=="T")or(x[i]=="G")or(x[i]=="C"):\n j=1\n while (i+j<N):\n if ((x[i+j]=="A")or(x[i+j]=="T")or(x[i+j]=="G")or(x[i+j]=="C")):\n j=j+1\n else:\n break\n if maxl<j:\n maxl=j\n maxi=i\n \nprint... | ['Runtime Error', 'Accepted'] | ['s540465960', 's597184443'] | [2940.0, 3064.0] | [17.0, 17.0] | [8, 297] |
p03086 | u072610327 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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)\n\nstr_max = 0\nprint(len(S))\nfor start in range(len(S)):\n for end in range(start+1, len(S)):\n if {"A","C","G", "T"} |set(S[start:end+1]) == {"A","C","G", "T" }:\n str_max = max(str_max, -start+end+1)\n\nprint(str_max)', "S = input()\nN = len(S)\nans = 0\nfor i in rang... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s113532219', 's113988483', 's881292633', 's340668701'] | [3060.0, 2940.0, 3064.0, 3060.0] | [18.0, 17.0, 17.0, 18.0] | [257, 163, 463, 184] |
p03086 | u072949274 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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())\nA = 'ACGT'\nL = len(S)\n\ncnt = 0\nmax_cnt = 0\nfor x in S:\n print(x, cnt)\n if x in A:\n cnt += 1\n else:\n if max_cnt < cnt:\n max_cnt = cnt\n cnt = 0\n\nprint(max_cnt)\n", "S = str(input())\nA = 'ACGT'\nL = len(S)\n\ncnt = 0\nmax_cnt = 0\nfor x in S:\n ... | ['Wrong Answer', 'Accepted'] | ['s711671349', 's789074814'] | [2940.0, 2940.0] | [17.0, 17.0] | [216, 234] |
p03086 | u075303794 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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(x for x in input())\ntemp = 0\nans = []\nfor i in range(len(s)):\n if s[i] == 'A' or i == 'C' or i =='G' or i =='T':\n temp += 1\n if i == len(s) - 1:\n ans.append(temp)\n else:\n ans.append(temp)\n temp = 0\nprint(max(ans))\n", "s = list(x for x in input())\ntemp = 0\nans = []\nfor i in s... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s253482354', 's976426093', 's507788124'] | [3060.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0] | [242, 225, 251] |
p03086 | u076306174 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nm_len=0\nlen=0\n\nacgt={'A','C','G','T'}\n\nfor i in S:\n if i in acgt:\n len+=1\n #print(i,len)\n else:\n #print(i,len,m_len)\n if len>m_len:\n m_len=len\n len=0\n \nlen>m_len\nm_len=len\n\nprint(m_len)", "\nS=input()\n\nm_len=0\nlen=0\n\nacgt={... | ['Wrong Answer', 'Accepted'] | ['s241381206', 's404721408'] | [3060.0, 3060.0] | [18.0, 17.0] | [255, 264] |
p03086 | u076996519 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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', 'T', 'G']\ns = input()\nmax = 0\nmax_temp = 0\nfor i in len(s):\n if s[i] in l:\n max_temp += 1\n if max < max_temp:\n max = max_temp\n else:\n max_temp = 0\nprint(max)", "l = ['A', 'C', 'T', 'G']\ns = input()\nmax = 0\nmax_temp = 0\nfor i in len(s):\n if str(s[... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s537309780', 's627650475', 's567999199'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [210, 215, 202] |
p03086 | u077019541 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['Ss=[i for i in input()]\nanss = []\ncounter = 0\nfor i in range(len(Ss)):\n if Ss[i]=="A" and Ss[i]=="C" and Ss[i]!="G" and Ss[i]!="T":\n anss.append(counter)\n counter=0\n else:\n counter+=1\nif len(anss)!=0:\n print(max(anss))\nelse:\n print(0)', 'Ss=[i for i in input()]\nanss = []\... | ['Wrong Answer', 'Accepted'] | ['s537076706', 's427149177'] | [3060.0, 3060.0] | [17.0, 17.0] | [267, 296] |
p03086 | u077337864 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nans = 0\nl = 0\nfor _s in s:\n if s in ['A', 'C', 'G', 'T']:\n l += 1\n else:\n ans = max(ans, l)\nprint(max(ans, l))\n", "s = input().strip()\nans = 0\nl = 0\nfor _s in s:\n if _s in ['A', 'C', 'G', 'T']:\n l += 1\n else:\n ans = max(ans, l)\n l = 0\nprint(max(ans, l))\n"] | ['Wrong Answer', 'Accepted'] | ['s382040788', 's504946104'] | [2940.0, 2940.0] | [17.0, 17.0] | [139, 150] |
p03086 | u078214750 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\npattern = re.compile('[ACGT]+')\nS = input()\nprint(re.findall(pattern, S))\nprint(len(max(re.findall(pattern, S), key=len, default='')))", "S = input()\nans = 0\nfor i in range(len(S)):\n for j in range(i+1, len(S)+1):\n\tif all('ACTG'.count(c)==1 for c in S[i:j+1]):\n ans = max(ans, j+1-i)\nprint(a... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s005017720', 's481993775', 's896851666', 's421434867'] | [9664.0, 8920.0, 8964.0, 9052.0] | [33.0, 24.0, 20.0, 27.0] | [144, 162, 163, 187] |
p03086 | u078944864 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nans = ''\ntmp = ''\nfor s in str:\n if (s in ['A', 'T', 'G', 'C']):\n tmp += s\n if (len(tmp) > len(ans):\n ans = tmp\n else:\n tmp = ''\n\nprint(ans)\n ", "str = list(input())\n\ntmp = ''\nans = ''\nfor s in str:\n if (s in ['A', 'T', 'G', 'C']):\n tmp += s\n if (len(tmp) >... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s087474698', 's162470233', 's086780532'] | [2940.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0] | [177, 178, 183] |
p03086 | u081688405 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['src = input()\nlength = len(src)\nacgt = set("ACGT")\nans = 0\nfor i in range(length):\n n = length - i\n for ngram in [src[k:k+n] for k in range(length - n + 1)]:\n print(ngram)\n subtract = len(set(ngram) - acgt)\n if subtract == 0:\n ans = n\n break\n if ans != 0... | ['Wrong Answer', 'Accepted'] | ['s081648207', 's222763647'] | [3060.0, 3060.0] | [17.0, 19.0] | [332, 311] |
p03086 | u082861480 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\ndic_ = str.maketrans({'T':'1','A':'1','C':'1','G':'1'})\ns = s.translate(dic_)\ncount = 0\nresult = 0\npre_i = ''\nprint(s)\n\nfor i in s:\n if pre_i == '1' and i == '1':\n count += 1\n elif pre_i =='1':\n if count > result:\n result = count\n count = 0\n pre_i = ''\n \n elif i == '1... | ['Wrong Answer', 'Accepted'] | ['s896286985', 's003616589'] | [3064.0, 3060.0] | [17.0, 18.0] | [348, 202] |
p03086 | u083190434 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nans = 0, temp = 0\nfor i in s:\n ok = False\n for j in ACGT:\n if i == j:\n ok = True\n temp += 1\n if ok == False:\n ans = max(ans, temp)\n temp = 0\nans = max(ans, temp)\nprint(ans)', 'ACGT = ["A", "C" ,"G", "T"]\ns = input()\nans = 0\ntemp = 0\nfor i ... | ['Runtime Error', 'Accepted'] | ['s316193512', 's014583960'] | [3056.0, 3060.0] | [17.0, 17.0] | [234, 233] |
p03086 | u085334230 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nres = []\nfor i in range(len(S)):\n if S[i] in ["A", "C", "G", "T"]:\n count += 1\n else:\n res.append(count)\n count = 0\nprint(max(res, 0))\n', 'S = input()\ncount = 0\nres = 0\nfor i in S:\n if i in ["A", "C", "G", "T"]:\n count += 1\n else:\n ... | ['Runtime Error', 'Accepted'] | ['s809415107', 's910687799'] | [2940.0, 3060.0] | [17.0, 17.0] | [184, 159] |
p03086 | u089230684 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 random\nb = input()\nif b =="A":\n print("T")\nelif b=="T":\n print("A")\nelif b=="G":\n print("C")\nelif b=="C":\n print("G")', "s = list(input())\nn = len(s)\nres = 0\nfor i in range(n):\n for j in range(i,n):\n temp = s[i:j+1]\n if all(i in 'ATGC' for i in temp):\n re... | ['Wrong Answer', 'Accepted'] | ['s412517200', 's114149530'] | [9428.0, 9008.0] | [30.0, 30.0] | [136, 195] |
p03086 | u090057686 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nans = []\nallow = ["A","C","G","T"]\ncount = 0\nfor s in str:\n if s in allow:\n count = count + 1\n \nif len(ans) == 0:\n print(0)\nelse:\n print(sorted(ans)[-1])', 'str = input()\nans = []\nallow = ["A","C","G","T"]\nans_str = ""\nfor index in range(len(str)):\n if str[index] in allow:\n ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s108230466', 's180183814', 's836598299', 's270434997'] | [2940.0, 3060.0, 2940.0, 3060.0] | [17.0, 18.0, 18.0, 17.0] | [176, 247, 175, 220] |
p03086 | u093562214 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = input().split()\nQ = int(q)\ns = input()\nS = list(s)\n\narray = []\ncount = 0\nff = False\nfor i in range(len(S)):\n if len(S) < i+1:\n break\n if S[i] == 'A':\n flag = True\n array.append(0)\n elif flag == True and S[i] == 'C':\n count += 1\n array.pop(-1)\n ... | ['Runtime Error', 'Accepted'] | ['s062040020', 's006827559'] | [3064.0, 3064.0] | [18.0, 18.0] | [1026, 552] |
p03086 | u094191970 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = list(input())\nfor i in range(q):\n l, r = map(int, input().split())\n ss = ''.join(s[l-1:r])\n ans = ss.count('AC')\n print(ans)", "s=input()+'Z'\n\nans=0\nt_ans=0\nfor i in s:\n if i in 'ATGC':\n t_ans+=1\n else:\n ans=max(t_ans,ans)\n t_ans=0\nprint(ans)... | ['Runtime Error', 'Accepted'] | ['s600241922', 's591507132'] | [3060.0, 3064.0] | [17.0, 18.0] | [173, 125] |
p03086 | u094565093 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 i in range(len(S)):\n if S[i] == "A" or S[i] == "T" or S[i] == "C" or S[i] == "G":\n count+=1\n if max<count:\n max=count\n else:\n count=0\nprint(max)', 'S=input()\nmax=0\ncount=0\nfor i in range(len(S)):\n if S[i] == "A" or S[i] == "T" or S[i] == "C" or S[i] == "G":\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s020674480', 's158089616', 's190659099', 's206311779', 's674641169', 's932772661'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 19.0, 17.0] | [186, 188, 186, 189, 186, 194] |
p03086 | u095756391 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nb = 0\n\nans = []\n\nfor i in s:\n if (i == 'A' or i == 'G' or i == 'C' or i == 'T'):\n b += 1\n else:\n ans.append(b)\n b = 0\n\nprint(max(ans)) ", "S = list(input())\n\nb = 0\n\nans = [0]\n\nfor n, i in enumerate(S, 1):\n if (i == 'A' or i == 'G' or i == 'C' or i == 'T'):\n b += 1\n ... | ['Runtime Error', 'Accepted'] | ['s930363315', 's945582721'] | [2940.0, 3060.0] | [17.0, 17.0] | [161, 182] |
p03086 | u096736378 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\ns2 = ''\nfor c in s:\n if c in ('A','T','C','G'):\n s2 += '1'\n else:\n s2 += '0'\n\nprint(s,s2)\n\ntmp = 0\nret = 0\n if c == '1':\n tmp += 1\n else:\n ret = max(ret, tmp)\n tmp = 0\nret = max(ret, tmp)\nprint(ret)\n", "s = input()\ns2 = ''\nfor c in s:\n ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s250973452', 's354638758', 's532854675', 's894322008', 's446394080'] | [2940.0, 3060.0, 3060.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [258, 258, 255, 258, 259] |
p03086 | u103902792 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nSENT = ('A','T','G','C')\n\nans = 0\ncount = 0\nfor c in s:\n if c in SENT:\n count += 1\n else:\n ans = max(ans,conut)\n count = 0\nelse:\n ans = max(ans,count)\n \nprint(ans)", "s = input()\nSENT = ('A','T','G','C')\n\nans = 0\ncount = 0\nfor c in s:\n if c in SENT:\n count += 1\n els... | ['Runtime Error', 'Accepted'] | ['s289584566', 's542966962'] | [3060.0, 3060.0] | [18.0, 17.0] | [188, 190] |
p03086 | u109632368 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\n ans = 0\n for i in range(len(s)):\n cur = 0\n for j in range(i,len(s)):\n if s[j] in {"A", "C", "G", "T"}:\n cur += 1\n else:\n break\n\n ans = max(cur, ans)\n\n\n print(ans)', 'def main():\n s = ... | ['Wrong Answer', 'Accepted'] | ['s743199717', 's933831630'] | [2940.0, 3060.0] | [18.0, 18.0] | [278, 318] |
p03086 | u111652094 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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=len(S)\n\nans=0\nans_list=()\n\nfor i in range(l):\n if S[i] in ("A","G","C","T"):\n ans+=1\n else:\n ans_list.append(ans)\n ans=0\nans_list.append(ans)\nprint(ans)\n ', "s = input()\nt = ''\nfor i in range(len(s)):\n if s[i] in ('A', 'C', 'G', 'T'):\n t += '1'\n... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s065425931', 's681566954', 's182501419'] | [8864.0, 3060.0, 9028.0] | [21.0, 18.0, 30.0] | [197, 187, 207] |
p03086 | u112318601 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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_count=0\nfor i in range(len(S)):\n if S[i] in [A,C,G,T]:\n j=0\n while S[i+j] in [A,C,G,T]:\n max_count=max(max_count,j)\n j+=1\n if i+j==len(S):\n break\nprint(max_count)', "S=input()\nmax_count=0\nfor i in range(len(S)):\n if S[i] in ['A','C','G','T']:\n j=0\n ... | ['Runtime Error', 'Accepted'] | ['s094250316', 's393912134'] | [3060.0, 2940.0] | [20.0, 17.0] | [205, 260] |
p03086 | u112766430 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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']\nl,count = 0,0\nfor i in range(len(s)):\n\tif ACGT.find(s[i]) >= 0:\n\t\tcount += 1\n\telse:\n\t\tif l < count:\n\t\t\tl = count\n\t\tcount = 0\nprint(l)", "ACGT = ['A','C','G','T']\ns = input() + 'X'\nl,count = 0,0\nfor i in range(len(s)):\n\tif s[i] in ACGT:\n\t\tcount += 1\n\telse:\n\t\tif... | ['Runtime Error', 'Accepted'] | ['s647380244', 's482913578'] | [2940.0, 2940.0] | [18.0, 18.0] | [158, 168] |
p03086 | u118019047 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nletters = ["A","G","C","T"]\ncounter = 0\nrecord = 0\n\nfor letter in s:\n if letter in letters:\n counter += 1\n else:\n counter = 0\nelse:\n record = max(record,counter)\n print(record)', 's = input()\nletters = ["A","G","C","T"]\ncounter = 0\nrecord = 0\n\nfor letter in s:\n ... | ['Wrong Answer', 'Accepted'] | ['s969409727', 's196946046'] | [3060.0, 3060.0] | [17.0, 17.0] | [214, 239] |
p03086 | u119655368 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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_re = 0\nfor i in range(len(s)):\n tar_s = s[i:]\n tar_s = re.search(r'(A|T|C|G)*', tar_s).group()\n max_re = max(max_re, len(tar_s))\nprint(max_re)", "import re\ns = input()\nmax_re = 0\nfor i in range(len(s)):\n tar_s = s[i:]\n tar_s = re.search(r'(A|T|C|G)*', tar_s).group()\n max_... | ['Runtime Error', 'Accepted'] | ['s399399023', 's710534282'] | [2940.0, 3188.0] | [19.0, 19.0] | [167, 178] |
p03086 | u121732701 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\n \nif "A"==b\n print("T")\nelif "C"==b\n print("G")\nelif "T"==b\n print("A")\nelse:\n print("C")', 'S = input()\ncount = 0\nnum = 0\n\n\nfor i in S:\n if i=="A" or i=="C" or i=="G" or i=="T":\n count = count + 1\n if count >= num:\n num = count\n else:\n ... | ['Runtime Error', 'Accepted'] | ['s765335853', 's611852522'] | [2940.0, 2940.0] | [17.0, 17.0] | [114, 206] |
p03086 | u123745130 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nans,temp = 0,0\nfor x in S:\n if x in 'ACGT':\n temp += 1\n else:\n temp = 0\n ans = max(ans,temp)\nprint(ans)", "n= input()\nans,temp = 0,0\nfor x in n:\n if x in 'ACGT':\n temp += 1\n else:\n temp = 0\n ans = max(ans,temp)\nprint(ans)"] | ['Runtime Error', 'Accepted'] | ['s185628458', 's671310153'] | [8828.0, 9052.0] | [24.0, 32.0] | [137, 137] |
p03086 | u123849536 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 re\ns = input()\ntarget = re.sub('[^ACGT]', '@', s)\nprint(target)\nnum_list = []\nfor t in target.split('@'):\n num_list.append(len(t))\nprint(max(num_list))", "# -*- coding: utf-8 -*-\nimport re\ns = input()\ntarget = re.sub('[^ACGT]', '@', s)\nnum_list = []\nfor t in target.split('... | ['Wrong Answer', 'Accepted'] | ['s736748225', 's002893063'] | [3316.0, 3188.0] | [22.0, 19.0] | [183, 169] |
p03086 | u124077807 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nsl = len(s)\ndic = {"A":1,"C":1,"G":1,"T":1}\ncntmax = 0\nfor i in range(sl):\n cnt=0 \n for j in range(sl):\n try :\n cnt += dic[s[j]]\n except KeyError:\n if cntmax < cnt:\n print(str(i)+" "+str(j)+" "+str(cntmax)+" "+str(cnt))\n ... | ['Wrong Answer', 'Accepted'] | ['s295612013', 's697750714'] | [3060.0, 3060.0] | [17.0, 17.0] | [335, 466] |
p03086 | u127499732 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 for c in S[i:j+1]:\n if all('ACGT'.count(c) == 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 ... | ['Runtime Error', 'Accepted'] | ['s147445593', 's223556748'] | [2940.0, 3060.0] | [17.0, 17.0] | [195, 172] |
p03086 | u129836004 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = []\ncnt = 0\nfor a in s:\n if a == 'A' or a == 'C' or a == 'T' or a == 'G':\n cnt += 1\n else:\n acgt.append(cnt)\n cnt = 0\nacgt.appen(cnt)\nprint(max(acgt))\n ", "s = input()\nacgt = []\ncnt = 0\nfor a in s:\n if a == 'A' or a == 'C' or a == 'T' or a == 'G':\... | ['Runtime Error', 'Accepted'] | ['s932251286', 's604225029'] | [2940.0, 2940.0] | [18.0, 18.0] | [204, 205] |
p03086 | u130900604 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()+"O"\ntmp=""\nans=[]\nfor i in s:\n if i in ["A","T","G","C"]:\n tmp=tmp+i\n else:\n ans.append(tmp)\n tmp=""\nres=""\nfor i in ans:\n if len(i)>len(res):\n res=i\nprint(res)\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 ... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s546241536', 's788894615', 's800702873', 's668966504'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0, 17.0] | [186, 156, 190, 185] |
p03086 | u131264627 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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())\nctn = 0\nfor i in s:\n if i in ['A', 'G', 'C', 'T']:\n ctn += 1\n m = max(m, ctn)\n else:\n ctn = 0\nprint(ctn)", "s = list(input())\nctn = 0\nm = 0\nfor i in s:\n if i in ['A', 'G', 'C', 'T']:\n ctn += 1\n m = max(m, ctn)\n else:\n ctn = 0\npri... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s460615151', 's553867302', 's177808696'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [149, 155, 141] |
p03086 | u131946248 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = ''\nt = ''\nacgt = 'ACGT'\nfor s in S:\n if (s in acgt):\n t += s\n else:\n if (len(ans) < len(t)):\n ans = t\n\nif (len(ans) < len(t)):\n ans = t\nprint(ans)", "s = input()\nans = 0\nfor i in range(len(s)):\n for j in range(i+1,len(s)+1):\n t = s[i:j]\n ... | ['Wrong Answer', 'Accepted'] | ['s588701704', 's274071410'] | [3060.0, 9116.0] | [17.0, 29.0] | [198, 212] |
p03086 | u145600939 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = 'ACGT'\nans = 0\ncnt = 0\nfor i in s:\n if i in ACGT:\n cnt += 1\n else:\n ans = max(ans,cnt)\n cnt = 0\nprint(ans,cnt)\n", "s = input()\nACGT = 'ACGT'\nans = 0\ncnt = 0\nfor i in s:\n if i in ACGT:\n cnt += 1\n else:\n ans = max(ans,cnt)\n cnt = 0\nprint(max(ans,cnt))\n"] | ['Wrong Answer', 'Accepted'] | ['s682648452', 's039309809'] | [2940.0, 2940.0] | [18.0, 17.0] | [141, 146] |
p03086 | u146597538 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nres = 0\nmax = 0\nfor i in s:\n if i == 'A' or i == 'T' or i == 'C' or i == 'G':\n res += 1\n elif max <res:\n max = res\n res = 0\n else:\n res = 0\n\nif max < res:\n max = res\n-\nprint(max)", "s = list(input())\n\nres = 0\nmax = 0\nfor i in s:\n if i == 'A' or i == 'T' or i ==... | ['Runtime Error', 'Accepted'] | ['s542475465', 's682488166'] | [2940.0, 3060.0] | [18.0, 17.0] | [213, 212] |
p03086 | u148540382 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ['s = input()\n\nacgt_s = "ACGT"\ncount_s = 0\ncount_max = 0\n\nfor i in s:\n for j in acgt_s:\n if j == i:\n count_s += 1\n break\n else:\n count_max = max(count_max, count_s)\n print(count_max)\n count_s = 0\n\ncount_max = max(count_max, count_s)\nprint(count_ma... | ['Wrong Answer', 'Accepted'] | ['s610046093', 's576434326'] | [2940.0, 2940.0] | [17.0, 17.0] | [304, 248] |
p03086 | u158126367 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nif b=="A":\n print("T")\nif(b==\'T\'):\n print(\'A\')\nif(b==\'G\'):\n print(\'C\')\nif(b==\'C\'):\n print(\'G\')', 'def solve(string):\n ans = 0\n i = 0\n while i < len(string):\n j = 0\n while i + j < len(string) and string[i + j] in "ATGC":\n j += 1\n ... | ['Wrong Answer', 'Accepted'] | ['s338117169', 's347477803'] | [2940.0, 3060.0] | [17.0, 18.0] | [116, 285] |
p03086 | u159335277 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nst = 'ACGT'\nans = 0\ncur = 0\nfor x in s:\n if x in st:\n cur += 1\n else:\n cur = 0\n ans = max(cur, ans)", "s = input()\n\nst = 'ACGT'\nans = 0\ncur = 0\nfor x in s:\n if x in st:\n cur += 1\n else:\n cur = 0\n ans = max(cur, ans)\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s246550780', 's720267363'] | [2940.0, 2940.0] | [17.0, 18.0] | [121, 132] |
p03086 | u163320134 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nfor i in range(l):\n for j in range(1,l-i+1):\n t=s[i:i+j]\n for k in range(j):\n if t[k]=='A' or t[k]=='C' or t[k]=='G' or t[k]=='T':\n continue\n else:\n break\n else:\n ans=max(ans,j)", "s=input()\nl=len(s)\nans=0\nfor i in range(l):\n for j in ra... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s410120355', 's776758438', 's326552505'] | [3064.0, 3060.0, 3064.0] | [17.0, 17.0, 20.0] | [241, 204, 252] |
p03086 | u164474813 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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)\na = [0]*l\nfor i in range(l):\n if s[i] == "A" or s[i] =="T" or s[i] =="C" or s[i] =="G":\n a[i] = 1\nm = 0\nif a[0] = 1:\n m = 1\nfor i in range(1,l):\n a[i] = (a[i-1]+1)*a[i]\n if m < a[i]:\n m = a[i]\n\nprint(m)', 's = input()\nl = len(s)\na = [0]*l\nfor i in range(... | ['Runtime Error', 'Accepted'] | ['s311897376', 's478706012'] | [2940.0, 3064.0] | [17.0, 17.0] | [249, 250] |
p03086 | u168416324 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 che(s):\n for c in s:\n if c==\'A\' or c==\'C\' or c==\'G\' or c==\'T\':\n pass\n else:\n return 0\n return 1\nmx=""\nfor i in range(0,len(s)+1):\n for j in range(0, len(s)+1):\n com=s[i:j]\n if len(com)==0:\n continue\n if len(mx)<len(com) and che(com):\n mx=com\n... | ['Wrong Answer', 'Accepted'] | ['s025451410', 's090500126'] | [3060.0, 3064.0] | [17.0, 17.0] | [303, 308] |
p03086 | u173148629 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\n\nfor i in range(len(S)):\n tmp=0\n if S[i] in ("A","C","G","T"):\n tmp+=1\n else:\n ans=max(ans,tmp)\n tmp=0\nprint(ans)', 'S=input()\nn=len(S)\nans=0\n\nfor i in range(n):\n for j in range(i,n):\n if S[i:j+1].count(("A","C","G","T"))==j-i+1:\n a... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s275870648', 's615968840', 's656897636', 's729825055'] | [2940.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [160, 164, 162, 293] |
p03086 | u174603263 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\ninput = sys.stdin.readline\n\ns = list(input().rstrip())\n\nlis = ['A', 'C', 'G', 'T']\n\nfor i in range(len(s)):\n for j in range(4):\n if (s[i] == lis[j]):\n s[i] = 'う～えす～ぎさ～ん'\n\n\nct = 0\nct_lis = []\n\nfor i, x in enumerate(s):\n if (x == 'う～えす～ぎさ～ん'):\n ct += 1\n ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s755154257', 's819470458', 's822546498'] | [3060.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0] | [403, 412, 397] |
p03086 | u178192749 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = [0]*len(s)\nfor i in s:\n if s in 'ACTG ':\n cnt +=1\n else:\n cnt = 0\n cnt_list[i] = cnt\nprint(max(cnt_list))", "s = input()\ncnt = 0\ncnt_list = [0]*len(s)\nfor idx,i in enumerate(s):\n if i in 'ACTG ':\n cnt +=1\n else:\n cnt = 0\n cn... | ['Runtime Error', 'Accepted'] | ['s430774103', 's538676570'] | [3060.0, 2940.0] | [17.0, 17.0] | [159, 176] |
p03086 | u178249601 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 function(S):\n ACGT = ['A', 'C', 'G, 'T']\n ret = 0\n N = len(S)\n for i in range(0, N):\n for j in range(i+1, N+1):\n temp = 0\n l = S[i:j]\n for x in l:\n if x not in ACGT:\n break\n temp = len(l)\n \tif temp >= ... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s062341132', 's257661112', 's458668958', 's588663700', 's206905724'] | [2940.0, 3060.0, 2940.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [344, 392, 281, 383, 493] |
p03086 | u179376941 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["lst = ['A', 'C', 'G', 'T']\nword = input()\n\nlst2 = []\nlst3 = []\nlst4 = []\nlst5 = []\nlst6 = []\nlst7 = []\nlst8 = []\nlst9 = []\nlst10 = []\nfor s1 in lst:\n for s2 in lst:\n lst2.append(s1+s2)\n for s3 in lst:\n lst3.append(s1+s2+s3)\n for s4 in lst:\n lst4.append(s1+s2+s3+s4)\n f... | ['Wrong Answer', 'Accepted'] | ['s975274919', 's680142453'] | [108764.0, 9048.0] | [886.0, 26.0] | [1079, 304] |
p03086 | u182004566 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\n\nif ("A" not in s) and ("C" not in s) and ("G" not in s) and ("T" not in s):\n print 0\n\nmax = 0\nfor i, c in enumerate(s):\n if is_ACGT(c):\n if i == (len(s) - 1):\n break\n max = get_ACGT_length(s[i+1:])\n\nprint(max)\n\ndef is_ACGT(c):\n if (c == "A") or (c =... | ['Runtime Error', 'Accepted'] | ['s294296304', 's849553576'] | [2940.0, 3064.0] | [17.0, 19.0] | [603, 419] |
p03086 | u185464141 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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# submission # - User: herp_sy\n\n\nimport math\nimport statistics\n\ns = input()\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", "# coding: utf-8\n# submission # - User: herp_sy\n\n\nimpor... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s884144201', 's976487661', 's326609491'] | [5708.0, 5324.0, 5212.0] | [49.0, 40.0, 36.0] | [272, 272, 277] |
p03086 | u186967328 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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_score = 0\nscore = 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 score += 1\n if max_score <= score:\n max_score = score\n else:\n if max_score <= score:\n max_score = score\n score = 0\n print(max_score,score)\n \n \nprint... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s451881575', 's454384341', 's736193443'] | [3060.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0] | [313, 225, 291] |
p03086 | u187233527 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["s = input()\nans = 0\ntmp = 0\nacgt = ['A', 'C', 'G', 'T']\nwhile s:\n if s.pop(0) in acgt:\n tmp += 1\n else:\n ans = max([ans, tmp])\n tmp = 0\n\nans = max([ans, tmp])\nprint(ans)", "s = [i for i in input()]\nans = 0\ntmp = 0\nacgt = ['A', 'C', 'G', 'T']\nwhile s:\n if s.pop(0) in acgt:\n tmp += 1\n ... | ['Runtime Error', 'Accepted'] | ['s388779564', 's284570212'] | [3060.0, 3060.0] | [17.0, 17.0] | [180, 193] |
p03086 | u188244611 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["#ABC 122, B - ATCoder\nS = input()\nN = len(S)\n\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", "#ABC 122, B - ATCoder\nS = input()\nN = len(S)\n\nans = 0\nfor i in range(N):\n for j in range(i, ... | ['Runtime Error', 'Accepted'] | ['s458541975', 's656585743'] | [2940.0, 3064.0] | [17.0, 17.0] | [203, 204] |
p03086 | u190178779 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["import sys\nimport re\nS = input()\nif not ( 1 <= len(S) <= 10 ): sys.exit()\nif not S.isupper: sys.exit()\n\nmax = max(re.findall('[A|T|G|C]+', S)) if re.findall('[A|T|G|C]+', S) else 0\nif max > 0:max\nprint(max)", "import sys\nimport re\nS = input()\nif not ( 1 <= len(S) <= 10 ): sys.exit()\nif not S.isupper: sys.... | ['Runtime Error', 'Accepted'] | ['s272123231', 's491888376'] | [9692.0, 9764.0] | [35.0, 38.0] | [206, 248] |
p03086 | u191635495 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nres = 0\ncount = 0\nfor s in S:\n if s in ['A', 'C', 'G', 'T']:\n print(s)\n count += 1\n else:\n count = 0\n res = max(count, res)\n\nprint(res)\n", "S = input()\nres = 0\ncount = 0\nfor s in S:\n if s in ['A', 'C', 'G', 'T']:\n count += 1\n else:\n coun... | ['Wrong Answer', 'Accepted'] | ['s494794835', 's631151221'] | [2940.0, 2940.0] | [17.0, 17.0] | [178, 161] |
p03086 | u192429849 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\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 continue\n else:\n max(count_max,count)\n count = 0\n \nprint(count_max)", "S = input()\ncount = 0\ncount_max = 0\nfor i in range(len(S)... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s053289714', 's244150682', 's269955624', 's595912761', 's307957724'] | [3060.0, 2940.0, 3060.0, 2940.0, 3060.0] | [18.0, 18.0, 17.0, 17.0, 17.0] | [243, 196, 217, 193, 220] |
p03086 | u194440952 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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())\nbox = ["A", "G", "C", "T"]\nACGTbox = str()\nfor i in range(0, len(S)):\n for j in range(i, len(S)):\n if S[j] in box:\n s += S[j]\n else:\n break\n if len(s) > len(ACGTbox): \n ACGTbox = s \n s = str()\nprint(len(ACGTbox))', 'S = input()\nbox = ["... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s286553269', 's516822329', 's745628923', 's950503382', 's932455890'] | [3060.0, 3060.0, 3064.0, 3064.0, 3060.0] | [41.0, 17.0, 17.0, 17.0, 19.0] | [281, 286, 285, 305, 323] |
p03086 | u200527996 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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"]\nfor i in range(len(S)):\n tmp = 0\n if S[i] in acgt:\n tmp += 1\n for j in range(i+1,len(S)):\n if S[j] in acgt:\n tmp += 1\n continue\n else:\n print(S[i:j])\n tmp =max(tmp, j-... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s542083934', 's571828434', 's743718710', 's991217034', 's180206569'] | [3060.0, 3060.0, 3060.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 19.0, 19.0] | [341, 291, 296, 263, 346] |
p03086 | u204208382 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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="AAAAAAAAAA"\n\ndef sea(s):\n if s==[]:\n return 0\n max_agct=0\n tem_agct=0\n for i in range(len(s)):\n for j in range(len(s)-i):\n if s[i+j]=="A" or s[i+j]=="G" or s[i+j]=="C" or s[i+j]=="T":\n tem_agct+=1\n \n \n else:... | ['Wrong Answer', 'Accepted'] | ['s027599278', 's337339940'] | [3064.0, 3064.0] | [17.0, 17.0] | [631, 632] |
p03086 | u209275335 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nli = []\ncount = 0\ns = ""\nfor i in range(len(n)):\n if n[i] == "A" or n[i] == "G" or n[i] == "C" or n[i] == "T":\n s += "a"\n else:\n s += "b"\nfor i in range(len(n)):\n if s[i] == "a":\n count += 1\n else:\n li.append(count)\n count = 0\nli.append(count)\... | ['Wrong Answer', 'Accepted'] | ['s601279243', 's435473021'] | [3064.0, 9000.0] | [17.0, 29.0] | [327, 390] |
p03086 | u209619667 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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())\nS = ['A','C','G','T']\ncount = 0\na = []\na.append(count)\nfor i in A:\n if i in S:\n count += 1\n print(count)\n a.append(count)\n else:\n count = 0\nprint(max(a))", "A = list(input())\nS = ['A','C','G','T']\ncount = 0\na = []\na.append(count)\nfor i in A:\n if i in S:\n count +=... | ['Wrong Answer', 'Accepted'] | ['s050238091', 's420883652'] | [3060.0, 3060.0] | [17.0, 17.0] | [185, 168] |
p03086 | u210827208 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nres=0\nfor i in range(len(s)+1):\n for j in range(i+1,len(s)+1):\n print(list(s[i:j]))\n if set(list(s[i:j]))|{'A','G','C','T'}=={'A','G','C','T'}:\n cnt=len(s[i:j])\n if res<cnt:\n res=cnt\n\nprint(res)", "s=input()\n\nres=0\nfor i in range(len(s)+1):\n for... | ['Runtime Error', 'Accepted'] | ['s019037377', 's947918019'] | [3064.0, 3060.0] | [17.0, 18.0] | [250, 251] |
p03086 | u211259428 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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())\nm =0\nmaxi = 0\nfor i in range(0,len(S)):\n if S[i] == 'A' or S[i] == 'G'or S[i] == 'C'or S[i] == 'T' :\n m = m + 1 \n maxi = max(maxi,m)\n else:\n m = 0\n maxi = maxi\n print(maxi)\nprint(maxi)\n\n", "S = str(input())\nm =0\nmaxi = 0\nfor i in range(0,len(S)):\n... | ['Wrong Answer', 'Accepted'] | ['s882283248', 's765224190'] | [3060.0, 2940.0] | [17.0, 18.0] | [240, 224] |
p03086 | u220345792 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\ncount = 0\n\n\nfor i in S:\n if i =="A" or i == "C" or i == "T" or i == "G":\n count += 1\n else:\n ans = max(count, ans)\n count = 0\n \nans = max(count, ans)\nprint(ans)', 'S = input()\nans = 0\ncount = 0\n\n\nfor i in S:\n if i =="A" or i == "C" or i == "T" or i == "G"... | ['Runtime Error', 'Accepted'] | ['s441701051', 's978170194'] | [2940.0, 3064.0] | [17.0, 17.0] | [202, 214] |
p03086 | u221345507 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["S = input()\n\natgc = ['A','T','G','C']\n\nmax_count = 0\ncount = 0\nfor i in range(len(S)):\n print(count)\n if S[i] in atgc:\n count+=1\n else:\n max_count = max(max_count,count)\n count = 0\nmax_count = max(max_count,count)\nprint(max_count)", 'S = input()\n\nmax_count = 0\ncount = 0\... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s381960021', 's520846757', 's637154252'] | [3060.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [260, 184, 244] |
p03086 | u222138979 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nlet = 'ATGC'\nprev = b[0]\nif prev in let:\n leng = 1\nlens = []\nfor i in range(1,len(b)):\n if leng == 0 and b[i] in let:\n leng = 1\n if b[i] in let and prev in let:\n print(b[i])\n leng += 1\n else:\n lens.append(leng)\n leng = 0\n prev = b[i]\n\nprin... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s592540151', 's747325152', 's885081578'] | [3064.0, 3064.0, 3064.0] | [17.0, 20.0, 17.0] | [313, 325, 457] |
p03086 | u222207357 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nans = 0\n\nfor ss in S:\n if ss in 'ACGT':\n len += 1\n else:\n len = 0\n ans = max(ans,len)\n \nprint(ans)", "S = input()\n\ncnt = 0\nans = 0\n\nfor ss in S:\n if ss in 'ACGT':\n cnt += 1\n else:\n cnt = 0\n ans = max(ans,cnt)\n \nprint(ans)... | ['Runtime Error', 'Accepted'] | ['s616290855', 's772663400'] | [2940.0, 3064.0] | [17.0, 17.0] | [145, 145] |
p03086 | u223133214 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = len(S)\nans_list = []\nfor i in range(n):\n for j in range(i + 1, n):\n T = S[i: j + 1]\n U = T.replace("A","").replace("C","").replace("G","").replace("T","")\n if U == "":\n ans_list.append(len(T))\nprint(max(ans_list))', 'S = list(input())\nans, p = 0, ""\nfor s in S:\n if... | ['Runtime Error', 'Accepted'] | ['s411718007', 's045754554'] | [3064.0, 2940.0] | [17.0, 18.0] | [252, 157] |
p03086 | u223555291 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\ns=0\nfor i in range(len(a)):\n if i==0 or i==len(a)-1:\n pass\n else:\n if a[i]=='A' or a[i]=='C' or a[i]=='G' or a[i]=='T':\n count+=1\n s=count\n else:\n if count>s:\n s=count\n\n \n \n count=0\np... | ['Wrong Answer', 'Accepted'] | ['s089693785', 's324841894'] | [3060.0, 2940.0] | [17.0, 17.0] | [309, 194] |
p03086 | u223646582 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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\nprint(max(re.findall('[ATCG]+', S)))", "import re\n\nS=input()\n\nans=0\nfor i in range(10):\n for j in range(i,10+1):\n str=S[i:j]\n if re.search(r'^[AGCT]+$' ,str):\n ans=max(ans,len(str))\n\nprint(ans)\n "] | ['Runtime Error', 'Accepted'] | ['s104003787', 's713027289'] | [3188.0, 3188.0] | [19.0, 20.0] | [60, 170] |
p03086 | u225202950 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of S. Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`. | ["mx, h = [], []\nfor ch in input():\n print(h)\n if ch in ['A', 'C', 'G', 'T']:\n h += ch\n else:\n mx += [h]\n h = []\nelse:\n print(max([len(l) for l in mx]))\n", "mx, h = [], []\nfor ch in str(input()):\n if ch in ['A', 'C', 'G', 'T']:\n h += ch\n else:\n mx += [... | ['Runtime Error', 'Accepted'] | ['s095483934', 's504086586'] | [2940.0, 2940.0] | [17.0, 17.0] | [184, 190] |
p03086 | u225627575 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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()\nS = list(str)\n\nans = 0\nnum = 0\n\nfor i in range(len(str)):\n if list[i] == "A" or list[i] == "G" or list[i] == "T" or list[i] == "C":\n num = 1\n for j in range(len(str)):\n list[j] == "A" or list[j] == "G" or list[j] == "T" or list[i] == "j":\n num = num + 1\n else :\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s032902087', 's621607610', 's416826818'] | [2940.0, 3064.0, 3188.0] | [17.0, 17.0, 19.0] | [368, 371, 347] |
p03086 | u230549821 | 2,000 | 1,048,576 | You are given a string S consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is 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 = ['A','T','G','C']\nmaxl=0\nans=0\nfor i in range(len(S)):\n if S[i] in li:\n leng+=1\n else:\n if leng>maxl:\n maxl=leng\n leng=0\nprint(maxl)", "S=list(input())\nli = ['A','T','G','C']\nans=0\nleng=0\nfor i in range(len(S)):\n if S[i] in li:\n len... | ['Runtime Error', 'Accepted'] | ['s070315916', 's844661554'] | [3060.0, 3060.0] | [18.0, 20.0] | [191, 180] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.