problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s066294925 | Accepted | s = input()
a = ['A', 'C', 'G', 'T']
ans = []
k = 0
for i in range(len(s)):
if s[i] in a:
k += 1
else:
ans.append(k)
k = 0
ans.append(k)
print(max(ans)) |
p03086 | s077862578 | Accepted | S = input()
cnt = 0
ans = 0
for s in S:
if s not in ("A", "C", "G", "T"):
cnt = 0
else:
cnt += 1
ans = max(ans, cnt)
print(ans) |
p03086 | s845835314 | Accepted | s=input()
acgt=['A','C','G','T']
m=0
cnt=0
for i in range(len(s)):
if s[i] in acgt:
cnt+=1
else:
m=max(cnt,m)
cnt=0
print(max(cnt,m))
|
p03086 | s793655414 | Accepted | s=str(input())
s=list(s)
l=len(s)
ans=0
temp=0
for i in range(0,l):
if s[i]=="A" or s[i]=="C" or s[i]=="G" or s[i]=="T":
temp=temp+1
ans=max(ans,temp)
else:
temp=0
print(ans)
|
p03086 | s593941803 | Accepted | import re
print(max(map(len,re.findall("[ACGT]*",input())))) |
p03086 | s563862072 | Accepted | s = input()
for i in range(len(s)+1):
for j in range(len(s)-i+1):
if [k for k in s[j:j+i]] == [k for k in s[j:j+i] if k=='A' or k=='G' or k=='C' or k=='T']:
a=i
print(a) |
p03086 | s740672420 | Accepted | s = input()
acgt = 'ACGT'
res = cnt = 0
for i in s:
if i in acgt:
cnt += 1
else:
res = max(cnt, res)
cnt = 0
res = max(cnt, res)
print(res)
|
p03086 | s595817118 | Accepted | S = list(input())
A = ['A', 'C', 'G', 'T']
T = []
ans = 0
for e in S:
if e in A:
ans += 1
else:
T.append(ans)
ans = 0
T.append(ans)
print(max(T))
|
p03086 | s199039807 | Accepted | S = input()
N = len(S)
l = []
for i in range(N):
if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":
l.append(1)
else:
l.append(0)
#print(l)
ans = 0
for i in range(N):
for j in range(i, N):
tf = True
for k in range(i, j + 1):
if l[k] == 0:
... |
p03086 | s147806955 | Accepted | s = raw_input()
a = set(list('ACGT'))
j = 0
i = 0
r = 0
while( j < len(s)):
if s[j] not in a:
j += 1
i = j
else:
while(j < len(s) and s[j] in a): j+=1
r = max(r, j - i )
i = j
print r |
p03086 | s219276689 | Accepted | import re
S = input()
m = re.findall(r"[ACGT]+", S)
if m:
print(max(map(len, m)))
else:
print(0) |
p03086 | s332453021 | Accepted | S = input()
N = len(S)
length = 0
for i in range(N):
for j in range(i,N):
if all([(c in 'ACGT') for c in S[i:j+1]]):
length = max(length, len(S[i:j+1]))
print(length) |
p03086 | s958757110 | Accepted | S = input()
ans = 0
tmp = 0
for s in S:
if s in ["A", "C", "G", "T"]:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
ans = max(ans, tmp)
print(ans)
|
p03086 | s918412400 | Accepted | def actual(s):
is_agct = lambda string: set(string).issubset({'A', 'G', 'C', 'T'})
N = len(s)
answer = 0
for i in range(N):
for j in range(N):
substr = s[i:j + 1] # スライスの後半は要素数を超えてもエラーにならないことに注意
if is_agct(substr):
answer = max(answer, len(substr))
... |
p03086 | s663876302 | Accepted | # -*- coding: utf-8 -*-
# 標準入力を取得
S = input()
# 求解処理
N = len(S)
ans = 0
ACGT = ["A", "C", "G", "T"]
for i in range(N):
if S[i] not in ACGT:
continue
length = 1
for j in range(i + 1, N):
if S[j] not in ACGT:
break
length += 1
ans = max(ans, length)
# 結果出力
print(ans) |
p03086 | s054969995 | Accepted | S = input()
N = len(S)
ans = 0
for i in range(N):
for j in range(i, N):
if all('ACGT'.count(c) == 1 for c in S[i : j + 1]):
ans = max(ans, j - i + 1)
print(ans)
|
p03086 | s425081735 | Accepted | s = input()
cnt = 0
ans = 0
for c in s:
if c in "ACGT":
cnt += 1
ans = max(ans, cnt)
else:
cnt = 0
print(ans) |
p03086 | s345428896 | Accepted | s = input()
count = 0
mx = 0
for i in s:
if i=="A" or i=="C" or i=="G" or i=="T":
count += 1
mx = max(count,mx)
else:
count = 0
print(mx) |
p03086 | s590328349 | Accepted | def main():
S = input()
s = set()
s.add('A')
s.add('C')
s.add('G')
s.add('T')
max_count = 0
count = 0
for c in S:
if c in s:
count += 1
else:
max_count = max(max_count, count)
count = 0
max_count = max(max_count, count)
... |
p03086 | s259227612 | Accepted | s = input()
chain = 0
max_chain = 0
for i in range(len(s)):
if (s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T'):
chain += 1
else:
if(chain > max_chain):
max_chain = chain
chain = 0
if (i == len(s)-1):
if(chain > max_chain):
max_chain = c... |
p03086 | s364460469 | Accepted | string = input()
ans = 0
score = 0
ok = set('ACGT')
for c in string:
if c in ok:
score += 1
else:
ans = max(ans, score)
score = 0
ans = max(ans,score)
print(ans) |
p03086 | s117375874 | Accepted | S = input()
count = 0
koremade = 0
for i in range(0,len(S)):
if S[i] in 'ACGT':
count += 1
if i == len(S)-1:
if koremade <= count:
koremade = count
else:
if koremade <= count:
koremade = count
count = 0
print(koremade) |
p03086 | s733058624 | Accepted | S=input()
res=0
for i in range(len(S)+1):
for j in range(i):
t=True
s=S[j:i]
for k in range(len(s)):
if(s[k]!='A' and s[k]!='C' and s[k]!='G' and s[k]!='T'):
t=0
break
if(t):
res=max(res,len(s))
print(res) |
p03086 | s995059505 | Accepted | S=input()
ans=0
temp=0
l=['A','C','G','T']
for i in range(len(S)):
if S[i] in l:
temp+=1
ans=max(temp,ans)
else:
temp=0
print(ans) |
p03086 | s504837919 | Accepted | def ATCoder(S):
count = 0
res = 0
for i in range(len(S)):
if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":
count += 1
if count > res:
res = count
else:
count = 0
return res
if __name__ == "__main__":
S = str(input())
... |
p03086 | s404648104 | Accepted | import re
S = str(input())
acgt = re.compile(r"[A,C,G,T]*")
s = re.findall(acgt, S)
print(max(map(len,s))) |
p03086 | s664639958 | Accepted | s = str(input())
res = 0
max_res = 0
for i in range(len(s)):
if s[i] == 'A' or s[i] == 'T' or s[i] == 'G' or s[i] == 'C':
res += 1
if res > max_res:
max_res = res
else:
res = 0
print(max_res)
|
p03086 | s249290527 | Accepted | S = input()
max_ctr = 0
ctr = 0
for i in range(len(S)):
if (S[i] == 'A' or S[i] == 'T' or S[i] == 'C' or S[i] == 'G'):
ctr += 1
max_ctr = max(ctr, max_ctr)
else:
ctr = 0
print(max_ctr) |
p03086 | s128173652 | Accepted | S = input()
maxlen=count=0
isT = True
for i in range(len(S)):
if S[i] == "T":
isT = True
if S[i] == "T" or S[i] == "G" or S[i] == "C" or S[i] == "A":
count += 1
else:
if isT and maxlen < count:
maxlen = count
count = 0
isT = False
if isT and maxlen < count:
maxlen = count
print(m... |
p03086 | s592301834 | Accepted | S = input()
acgt = ['A', 'C', 'G', 'T']
c = 0
ans = 0
for i in S:
if i in acgt:
c += 1
ans = max(ans, c)
else:
c = 0
print(ans)
|
p03086 | s851556385 | Accepted | s = input()
s += "B"# AGCT以外の適当な文字
max_len = 0
count = 0
for i in s:
if i in "ACGT":
count += 1
else:
max_len = max(max_len,count)
count = 0
print(max_len) |
p03086 | s276157671 | Accepted | ss=['A','G','C','T']
s=list(input())
ans=0
for i in range(len(s)):
if s[i] in ss:
j=i
cnt=0
while j<len(s):
if s[j] in ss:
cnt+=1
j+=1
else:
break
ans=max(ans,cnt)
print(ans) |
p03086 | s657305899 | Accepted | S = input()
l = {"A", "C", "G", "T"}
ans = 0
tmp = ""
for s in S:
if s in l:
tmp += s
if len(tmp) > ans:
ans = len(tmp)
else:
tmp = ""
print(ans) |
p03086 | s040728827 | Accepted | S = input()
li = []
cnt = 0
for i in range(len(S)):
if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":
cnt += 1
else:
li.append(cnt)
cnt = 0
li.append(cnt)
print(max(li)) |
p03086 | s272419038 | Accepted | s = input()
ans = 0
total = 0
for i in range(len(s)):
if s[i] == "A" or s[i] == "G" or s[i] == "C" or s[i] == "T":
total += 1
else:
ans = max(ans, total)
total = 0
print(max(ans, total))
|
p03086 | s868580835 | Accepted | from sys import stdin
def main():
word = stdin.readline()
max = 0
count = 0
for i in range(len(word)):
if word[i] == "A" or word[i] == "C" or word[i] == "G" or word[i] == "T":
count += 1
elif max < count:
max = count
count = 0
print(max)
if __nam... |
p03086 | s764649619 | Accepted | S = input()
atgc = ["A", "T", "G", "C"]
anset = set()
L = 0
for i in range(len(S)):
if S[i] in atgc:
L += 1
else:
anset.add(L)
L = 0
if i == len(S)-1:
anset.add(L)
print(max(anset))
|
p03086 | s280499539 | Accepted | s = input()
count = 0
for i in range(len(s)):
x = 0
for j in range(i,len(s)):
if(s[j] == 'A' or s[j] == 'C' or s[j] == 'G' or s[j] == 'T'):
x += 1
else:
break
if(count < x):
count = x
print(count) |
p03086 | s545009932 | Accepted | S = list(input())
acgt = ["A", "C", "G", "T"]
res = 0
t = 0
for s in S:
if s in acgt:
t += 1
else:
res = max(res, t)
t = 0
res = max(res, t)
print(res) |
p03086 | s326552505 | Accepted | s=input()
l=len(s)
ans=0
for i in range(l):
for j in range(1,l-i+1):
t=s[i:i+j]
for k in range(j):
if t[k]=='A' or t[k]=='C' or t[k]=='G' or t[k]=='T':
continue
else:
break
else:
ans=max(ans,j)
print(ans) |
p03086 | s747425825 | Accepted | s = input()
t = ['A','C','G','T']
ans = 0
tmp_ans = 0
for i in s:
if i in t:
tmp_ans += 1
else:
ans = max(tmp_ans, ans)
tmp_ans = 0
ans = max(tmp_ans, ans)
print(ans) |
p03086 | s192444540 | Accepted | S = input()
N = len(S)
ans = 0
tmp = 0
ACGT = {"A", "C", "G", "T"}
i = 0
while i < N:
if S[i] in ACGT:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
i += 1
ans = max(ans, tmp)
print(ans)
|
p03086 | s449756830 | Accepted | s = input()
sum = 0
max = 0
for i in range(len(s)):
if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':
sum += 1
else: sum = 0
if sum >= max: max = sum
print(max) |
p03086 | s584772920 | Accepted | s=input()
tar="ACGT"
res=0
ans=0
for ch in s:
if ch in tar: ans+=1
else:
if ans>res: res=ans
ans=0
if ans>res: res=ans
print(res) |
p03086 | s907502350 | Accepted | s = input()
count = 0
max_count = 0
for c in s:
if c in ['A','C','G','T']:
count += 1
if max_count < count:
max_count = count
else:
count = 0
print(max_count)
|
p03086 | s433236667 | Accepted | s=input()
ans=0
cur=0
ACGT=["A","C","G","T"]
for ss in s:
if ss in ACGT:
cur+=1
else:
ans=max(cur,ans)
cur=0
print(max(ans,cur))
|
p03086 | s690855479 | Accepted | s=input()
ans=0
for i in range(len(s)):
for j in range(len(s)):
new_s=list(s[i:(len(s)-j)])
if all((i in ["A","T","G","C"]) for i in new_s) and len(new_s)>ans:
ans=len(new_s)
print(ans) |
p03086 | s862925839 | Accepted | ok='AGCT'
s=list(input())
cnt=0
ans=0
for si in s:
if si in ok:
cnt+=1
else:
ans = max(ans,cnt)
cnt=0
ans = max(ans,cnt)
print(ans) |
p03086 | s114695262 | Accepted | S = input()
T = ['A', 'C', 'G', 'T']
ans, cnt = 0, 0
for i in range(len(S)):
if S[i] in T:
cnt += 1
ans = max(ans, cnt)
else:
cnt = 0
print(ans) |
p03086 | s716226644 | Accepted | S = input()
ans = 0
for i in range(len(S)):
for j in range(i, len(S)):
if all('ACTG'.count(c) == 1 for c in S[i:j+1]):
ans = max(ans, j+1-i)
print(ans) |
p03086 | s906769318 | Accepted | S = list(input())
ans = []
cnt = 0
for i in range(len(S)):
if S[i] in ['A', 'C', 'G', 'T']:
cnt += 1
else:
ans.append(cnt)
cnt = 0
ans.append(cnt)
print(max(ans))
|
p03086 | s428334612 | Accepted | s = input()
max = 0
count = 0
for i in range(len(s)):
if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':
count += 1
if max < count:
max = count
else:
count = 0
print(max)
|
p03086 | s314676610 | Accepted | import re
ans = max(map(len, re.findall("[ACGT]*", input())))
print(ans) |
p03086 | s380731178 | Accepted | def S(): return input()
S = S()
ans = 0
temp = 0
for x in S:
if x in 'ACGT':
temp += 1
else:
temp = 0
ans = max(temp,ans)
print(ans)
|
p03086 | s156799521 | Accepted | from operator import itemgetter
s = input()
l = len(s)
ans = []
flag = False
for i in range(l):
if flag:
if s[i] in "AGCT":
continue
else:
ans.append([i-start,start,i])
flag = False
if s[i] in "AGCT":
flag = True
start = i
else:
if flag:
... |
p03086 | s855493217 | Accepted | s=input()
n=len(s)
ans=0
for i in range(n):
for j in range(i,n):
if all("ACGT".count(c) for c in s[i:j+1]):
ans=max(ans,j-i+1)
print(ans) |
p03086 | s095810341 | Accepted | s = input()
ans = 0
cache = 0
for c in s:
if c in ["A", "C", "G", "T"]:
cache += 1
else:
if cache > ans:
ans = cache
cache = 0
if cache > ans:
ans = cache
print(ans) |
p03086 | s657151505 | Accepted | def resolve():
S = input()
ans, cnt = 0, 0
for s in S:
if s == 'A' or s == 'C'or s == 'G' or s == 'T':
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
ans = max(ans, cnt)
print(ans)
resolve()
|
p03086 | s342242247 | Accepted | # B
s = list(input())
count = 0
l = []
for i in range(len(s)):
if s[i] == 'A':
count += 1
continue
elif s[i] == 'C':
count += 1
continue
elif s[i] == 'G':
count += 1
continue
elif s[i] == 'T':
count += 1
continue
else:
l.append... |
p03086 | s221163897 | Accepted |
def abc122_b():
s = input()
acgt = ['A', 'C', 'G', 'T']
check = [1 if s[i] in acgt else 0 for i in range(len(s))]
result = 0
for i in range(len(check)):
for j in range(i, len(check)):
if check[i : j + 1].count(0) == 0:
if result < len(check[i:j + 1]):
... |
p03086 | s306288723 | Accepted | S=input()
m=0
count=0
for s in S:
if s in "ACGT":
count += 1
else:count=0
m=max(m,count)
print(m) |
p03086 | s473067943 | Accepted | s=list(input())
dna = ["A","T","G","C"]
res=[0]
x=0
for i in range(len(s)):
if s[i] in dna:
x+=1
else:
res+=[x]
x=0
print(max(x,max(res))) |
p03086 | s753130359 | Accepted | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
def main():
s = ns()
ACGT = "AGCT"
ans = 0
tmp = 0
for i in s:
if i in ACGT:
tmp += 1
else:
... |
p03086 | s008169119 | Accepted | S=list(input())
line=[]
A=["A","C","G","T"]
num_list=[]
flag=False
for s in S:
if s in A:
line.append(s)
flag=True
elif flag:
num_list.append(len(line))
line=[]
flag=False
num_list.append(len(line))
if len(num_list)==0:print(0)
else:
print(max(num_list)) |
p03086 | s562728128 | Accepted | s = input()
acgt = ['A','C','G','T']
ans = 0
p = 0
for i in range(len(s)):
if s[i] in acgt:
p += 1
else:
ans = max(ans,p)
p = 0
print(max(ans,p)) |
p03086 | s473938822 | Accepted | S = input()
ACGT = 0
ans = 0
for x in S:
if x == 'A' or x == 'C' or x =='G' or x == 'T':
ACGT += 1
else :
ACGT = 0
ans = max(ans, ACGT)
print(ans) |
p03086 | s683701465 | Accepted | S = input()
def check(S): #1 moji
if S in "ATGC":
return True
else:
return False
ans =0
for i in range(len(S)):
temp = 0
while i<len(S) and check(S[i]):
temp+=1
i+=1
ans = max(ans,temp)
print(ans)
|
p03086 | s430283136 | Accepted | S = input()
N = len(S)
ans = 0
for i in range(N+1):
for j in range(i+1, N+1):
l = 0
for c in 'ACGT':
l += S[i:j].count(c)
if l == j - i:
ans = max(ans, l)
print(ans) |
p03086 | s105092987 | Accepted |
s = input()
l = 0
ans = 0
for c in s:
if c in ('A', 'C', 'G', 'T'):
l += 1
ans = max(ans, l)
else:
l = 0
print(ans)
|
p03086 | s786933030 | Accepted | s=input()
n=len(s)
ans=0
for i in range(n):
for j in range(i,n):
if all('ACGT'.count(c)==1 for c in s[i:j+1]):
ans=max(ans,len(s[i:j+1]))
print(ans) |
p03086 | s323142041 | Accepted | S = input()
N = len(S)
ans = 0
for i in range(N):
for j in range(i, N):
if all('ACGT'.count(c) == 1 for c in S[i : j + 1]):
ans = max(ans, j - i + 1)
print(ans)
|
p03086 | s294775762 | Accepted | s = input()
d = len(s)
ans = [0] * 10
tmp = 0
for i in range(d):
if s[i] in "ACGT":
ans[tmp] += 1
else:
tmp += 1
print(max(ans)) |
p03086 | s838023033 | Accepted | S = input()
ans = 0
lsATCG = ['A','T','C','G']
count = 0
for s in S:
if s in lsATCG:
count += 1
else:
ans = max(ans,count)
count = 0
ans = max(ans,count)
print(ans) |
p03086 | s380878470 | Accepted | S=[0]+list(input())
L=[0]
SET=["A","G","C","T"]
SET=set(SET)
for i in range(1,len(S)):
if S[i] not in SET:
L.append(0)
else:
L.append(L[-1]+1)
print(max(L)) |
p03086 | s614755694 | Accepted | s = input()
lis = ['A','C','G','T']
sub = []
for i in range(len(s)):
for j in range(i+1,len(s)+1):
tmp = s[i:j]
flag = True
for k in range(len(tmp)):
if tmp[k] in lis:
pass
else:
flag = False
if flag: sub.append(tmp)
ma = 0
for i in sub:
l = len(i)
if l > ma: m... |
p03086 | s248379204 | Accepted | import math
import sys
s = input()
def isACGT(n):
for i in range(len(n)):
if (n[i] != 'A' and n[i] != 'C' and n[i] != 'G' and n[i] != 'T'):
return False
return True
ans=0
for i in range(len(s)):
for j in range(1, len(s)+1):
if (isACGT(s[i:j]) and len(s[i:j]) > ans):
a... |
p03086 | s043776451 | Accepted | S=input()
ans=0
tmp=0
for i in range(len(S)):
if S[i] in ("A","C","G","T"):
tmp+=1
else:
ans=max(ans,tmp)
tmp=0
ans=max(ans,tmp)
print(ans) |
p03086 | s612592646 | Accepted | import re
split = re.split('[^ACGT]', input())
print(max(map(len, split)))
|
p03086 | s499105220 | Accepted | s = str(input())
cnt = 0
cnt_list = []
for i in range(len(s)):
if s[i] in 'ACGT':
cnt += 1
cnt_list.append(cnt)
else:
cnt = 0
cnt_list.append(0)
print(max(cnt_list)) |
p03086 | s445359883 | Accepted | s = input().strip()
n = len(s)
acum = [0] * (n + 1)
acgt = ['A', 'C', 'G', 'T']
for i in range(1, n + 1):
if s[i - 1] in acgt:
acum[i] = acum[i - 1] + 1
else:
acum[0] = 0
print(max(acum))
|
p03086 | s543154624 | Accepted | S = input()
n = len(S)
length = 0
for s in range(n):
for e in range(s, n):
if all("ACGT".count(c)==1 for c in S[s:e+1]):
length = max(length, e-s+1)
print(length) |
p03086 | s181745994 | Accepted | import re
print(max(map(len, re.findall("[ACGT]*", input())))) |
p03086 | s674640423 | Accepted | S = input()
a = 'ACGT'
memo = []
cnt = 0
for s in S:
if s in a:
cnt += 1
else:
cnt = 0
memo.append(cnt)
print(max(memo))
|
p03086 | s365943292 | Accepted | s = input()
max = 0
tmp = 0
for c in s:
if c in ['A', 'C', 'G', 'T']:
tmp += 1
if tmp > max:
max = tmp
else:
tmp = 0
print(max)
|
p03086 | s359379260 | Accepted | s=list(input())
#print(s)
ans = -1
counter = 0
for i in range(len(s)):
if s[i] == "A" or s[i] == "T" or s[i] == "G" or s[i] == "C":
#print("ATGC")
counter += 1
else:
counter = 0
ans = max(ans,counter)
print(ans)
|
p03086 | s867257545 | Accepted | S = list(input())
cnt = 0
res = 0
for s in S:
if s == 'A' or s == 'T' or s == 'C' or s == 'G':
cnt += 1
res = max(cnt, res)
else:
cnt = 0
print(res)
|
p03086 | s064761240 | Accepted | s = list(input())
ans = 0
for i in range(len(s)):
for j in range(i, len(s)):
# print(s[i:j+1])
if all(x == 'A' or x == 'C' or x == 'G' or x == 'T' for x in s[i:j+1]):
# print('Yes')
if ans < len(s[i:j+1]):
ans = len(s[i:j+1])
# if expression:
#... |
p03086 | s780336272 | Accepted | #python3
def main():
s = input()
ans = 0
cnt = 0
for i in range(len(s)):
if (s[i] == "A") | (s[i] == "T") | (s[i] == "C") | (s[i] == "G"):
cnt += 1
else:
cnt = 0
ans = max(ans, cnt)
print(ans)
main()
|
p03086 | s178143182 | Accepted | s=input()
char=["A","C","G","T"]
ans=0
cnt=0
for i in range(len(s)):
if s[i] in char:
cnt+=1
else:
ans=max(ans,cnt)
cnt=0
ans=max(ans,cnt)
print(ans) |
p03086 | s132027738 | Accepted | S=list(input())
maxlen=0
for i in range(len(S)):
for j in range(i,len(S)):
for k in range(i,j+1):
#cnt=0
if S[k]!='A' and S[k]!='C' and S[k]!='G' and S[k]!='T':
break
if k==j and j-i+1>maxlen:
maxlen=j-i+1
print(maxlen)
|
p03086 | s640219046 | Accepted | import re
S = input()
s = re.split('[BDEFHIJKLMNOPQRSUVWXYZ]',S)
print(max(map(len,s)))
|
p03086 | s573763130 | Accepted | S = input()
cnt=0
ans = 0
sets = {"A","T","C","G"}
for s in S:
if s in sets:
cnt += 1
else:
ans = max(ans,cnt)
cnt = 0
ans = max(ans,cnt)
print(ans)
|
p03086 | s389502496 | Accepted | s = list(input())
d = ["A","C","G","T"]
cnt = 0
ans = 0
for c in s:
if c in d:
cnt += 1
else:
ans = max(ans,cnt)
cnt = 0
print(max(cnt,ans)) |
p03086 | s155410995 | Accepted | S = list(input())
n = len(S)
ACGT = ["A","C","G","T"]
ans = 0
for i in range(n):
if S[i] in ACGT:
if i == n-1:
ans = max(ans,1)
else:
streak = 1
for j in range(i+1,n):
if S[j] in ACGT:
streak += 1
else:
... |
p03086 | s478660369 | Accepted | S = input()
ACGT = 'ACGT'
ans = 0
temp = 0
for x in S:
if x in ACGT:
temp += 1
else:
ans = max(ans, temp)
temp = 0
ans = max(ans, temp)
print(ans) |
p03086 | s023702914 | Accepted | s = list(input())
a = ""
ans = 0
for c in s:
if c in ("A", "C", "G", "T"):
a += c
else:
ans = max(ans, len(a))
a = ""
print(max(ans, len(a)))
|
p03086 | s400811466 | Accepted | s=input()
clist=['A','C','G','T']
count=0
a=[]
for i in s:
if i in clist:
count+=1
else:
a.append(count)
count=0
a.append(count)
print(max(a)) |
p03086 | s952742980 | Accepted | s=input()
x=['A','T','C','G']
a=[0]*len(s)
if s[0] in x:
a[0]=1
for i in range(1,len(s)):
if s[i] in x:
a[i]=a[i-1]+1
print(max(a)) |
p03086 | s082571807 | Accepted | s = input()
acgt = ["A","C","G","T"]
c = ""
for i in s:
if i in acgt:
c+=i
else:
c+= " "
l = c.split()
if l:
print(len(max(l, key=lambda x:len(x))))
else:
print(0) |
p03086 | s715996870 | Accepted | S = input()
ans = 0
cnt = 0
for i in S:
if i in ("A","C","G","T"):
cnt += 1
else:
ans = max(ans,cnt)
cnt = 0
ans = max(ans,cnt)
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.