problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s504995988 | Accepted | s = input()
l = ["A", "C", "G", "T"]
ans = 0
c = 0
for i in range(len(s)):
if s[i] in l:
c += 1
if c > ans:
ans = c
else:
c = 0
print(ans) |
p03086 | s908023521 | Accepted | s=input()
ans=0
c=0
for i in range(len(s)):
if s[i] in ["A","C","G","T"]:
c+=1
else:
c=0
ans=max(ans,c)
print(ans) |
p03086 | s927251444 | Accepted | import re
print(max(map(len,re.findall("[ACGT]*",input())))) |
p03086 | s680142453 | Accepted | words = input()
lst = ['A', 'C', 'G', 'T']
max_count = 0
count = 0
for i in range(len(words)):
if words[i] in lst:
count += 1
if i == len(words) - 1:
if count > max_count:
max_count = count
else:
if count > max_count:
max_count = count
count = 0
print(max_count)
|
p03086 | s116142255 | Accepted | # coding: utf-8
S = input()
res = 0
now_mojisu = 0
agct = ["A", "C", "G", "T"]
for i in S:
if i in agct:
now_mojisu += 1
else:
now_mojisu = 0
res = max(res, now_mojisu)
print(res)
|
p03086 | s491888376 | Accepted | import sys
import re
S = input()
if not ( 1 <= len(S) <= 10 ): sys.exit()
if not S.isupper: sys.exit()
result = 0
max = max(re.findall('[A|T|G|C]+', S),key=len) if re.findall('[A|T|G|C]+', S) else ''
if len(max) > 0:result = len(max)
print(result) |
p03086 | s633741754 | Accepted | s = input()
ans = 0
def check(sub):
check_s = set(list("ACGT"))
for c in sub:
if not c in check_s:
return 0
return len(sub)
for i in range(len(s)):
for j in range(i+1, len(s)+1):
ans = max(ans, check(s[i:j]))
print(ans)
|
p03086 | s831731224 | Accepted | S = input()
c = 0
cmax = -1
for s in S:
if s in ['A', 'C', 'G', 'T']:
c += 1
else:
if c > cmax:
cmax = c
c = 0
if c > cmax:
cmax = c
c = 0
print(cmax) |
p03086 | s514702183 | Accepted |
s = input()
ans = 0
for i in range(len(s)):
count = 0
for j in range(i,len(s)):
if s[j] in "ACGT":
count += 1
else:
break
if count >= ans:
ans = count
print(ans)
|
p03086 | s859561858 | Accepted | S = input()
A = ["A", "G", "C", "T"]
cnt = 0
Max = 0
for i in range(len(S)):
if S[i] in A:
cnt += 1
Max = max(Max, cnt)
else:
cnt = 0
print(Max) |
p03086 | s933322479 | Accepted | s = input()
n = len(s)
l = ['A','C','G','T']
ans = 0
a = 0
for i in range(n):
if s[i] in l:
a += 1
else:
a = 0
ans = max(ans,a)
print(ans)
|
p03086 | s581704440 | Accepted | gene = ["A","T","G","C"]
S = list(input())
ans = 0
tmp = 0
for i in range(len(S)):
if S[i] in gene:
tmp += 1
ans = max(ans,tmp)
else:
tmp = 0
print(ans) |
p03086 | s934085871 | Accepted | S = input()
count = 0
max = 0
for i in range(len(S)):
if S[i] == 'A' or S[i] == 'G' or S[i] == 'T' or S[i] == 'C':
count += 1
if max < count:
max = count
else:
count = 0
print(max) |
p03086 | s304268882 | Accepted | S = input()
ans = 0
ans_lis = [0]
for i in range(len(S)):
if S[i] in "ACGT":
ans = ans + 1
if i == (len(S)-1):
ans_lis.append(ans)
else:
ans_lis.append(ans)
ans = 0
print(max(ans_lis)) |
p03086 | s989606457 | Accepted | S = input()
cnt = 0
results = []
for i in range(len(S)):
if S[i] in ['A', 'C', 'G', 'T']:
cnt += 1
else :
results.append(cnt)
cnt = 0
results.append(cnt)
print(max(results)) |
p03086 | s155106465 | Accepted | import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *
sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()
S = input()
N = len(S)
ans = 0
for i in range(N):
for j in range(N... |
p03086 | s449913846 | Accepted | a="".join(["1" if s in ["A","C","G","T"] else "0" for s in input()])
ans=[len(s) for s in a.split("0")]
print(max(ans)) |
p03086 | s309673427 | Accepted | S=input()
ans=cur=0
for c in S:
if c in 'ACGT':
cur+=1
ans=max(ans,cur)
else:
cur=0
print(ans)
|
p03086 | s874516072 | Accepted | S=input()
m=0
count=0
for s in S:
if s in "A":count+=1
elif s in "C":count+=1
elif s in "G":count+=1
elif s in "T":count+=1
else:count=0
m=max(m,count)
print(m) |
p03086 | s321345200 | Accepted | S = input()
tf = []
for s in S:
if s in "ACGT":
tf.append(True)
else:
tf.append(False)
ans = 0
temp = 0
for res in tf:
if res:
temp += 1
else:
temp = 0
ans = max(ans, temp)
print(ans) |
p03086 | s752317302 | Accepted | s = input()
ACGT = ["A","C","G","T"]
ans = 0
ANS = [0]
for i in range(len(s)):
if s[i] in ACGT:
ans += 1
else:
ans = 0
ANS.append(ans)
print(max(ANS)) |
p03086 | s070585866 | Accepted | from math import gcd
import re
s=input()
match=re.findall("[ACGT]*",s)
length=0
for i in match:
length=max(length,len(i))
print(length) |
p03086 | s729825055 | Accepted | S=input()
n=len(S)
ans=0
no=False
for i in range(n):
for j in range(i,n):
for k in range(i,j+1):
if not S[k] in ("A","C","G","T"):
no=True
break
if no:
no=False
break
ans=max(ans,j-i+1)
print(ans) |
p03086 | s254051928 | Accepted | import sys
input = sys.stdin.readline
def main():
t = 'ATGC'
ans = 0
S = input()
temp = 0
for s in S:
if s in t:
temp += 1
else:
ans = max(ans, temp)
temp = 0
print(ans)
if __name__ == '__main__':
main() |
p03086 | s216597091 | Accepted | s = input()
cnt = 0
ans = 0
for x in s:
if x in ['A', 'C', 'G', 'T']:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
ans = max(ans, cnt)
print(ans) |
p03086 | s079208834 | Accepted | S = list(input())
ACGT = ['A', 'C', 'G', 'T']
count_list = []
for i in range(len(S)):
count = 0
for j in range(i, len(S)):
if S[j] in ACGT:
count += 1
else:
break
count_list.append(count)
print(max(count_list)) |
p03086 | s780598450 | Accepted | s = input()
left = 0
ans = 0
for right in range(0,len(s)):
if s[right] in ("A","C","G","T"):
pass
else:
left=right+1
ans = max(ans,right-left+1)
print(ans) |
p03086 | s830988542 | Accepted | s=input()
ans=0
for i in range(len(s)):
for j in range(i,len(s)+1):
if s[i:j].count("A")+s[i:j].count("T")+s[i:j].count("C")+s[i:j].count("G")==len(s[i:j]):
ans=max(ans,len(s[i:j]))
print(ans) |
p03086 | s173211124 | Accepted | S = input()
ans = 0
for i in range(len(S)):
a = i
k = 0
while S[a] == 'A' or S[a] == 'C' or S[a] == 'G' or S[a] == 'T':
k += 1
a += 1
if a == len(S):
break
ans = max(ans,k)
print(ans) |
p03086 | s143109344 | Accepted | a=input()
b=0
c=0
for i in range(len(a)):
if a[i]=="A" or a[i]=="C" or a[i]=="G" or a[i]=="T":
b=b+1
if c<b:
c=b
if a[i]!="A" and a[i]!="C" and a[i]!="G" and a[i]!="T":
b=0
print(c) |
p03086 | s686991107 | Accepted | S = input()
res = 0
l = ['A', 'C', 'G', 'T']
for i in range(len(S)):
sub = 0
for j in range(i, len(S)):
if S[j] in l:
sub += 1
else:
break
if sub > res: res = sub
print(res)
|
p03086 | s153046753 | Accepted | s = str(input())
list = ['A','C','G','T']
score = 0
tmp = 0
for i in s:
if(i in list):
tmp += 1
else:
score = max(score,tmp)
tmp = 0
score = max(score,tmp)
print(score)
|
p03086 | s613827072 | Accepted | S = input()
ACGT = 'A C G T'.split()
result = 0
tmp = 0
for i in S:
if i in ACGT:
tmp += 1
else:
tmp = 0
if tmp > result:
result = tmp
print(result)
|
p03086 | s334681836 | Accepted | S = input()
ans = 0
for i in range(len(S)):
for j in range(i, len(S)):
c = True
for k in range(i, j+1):
if S[k]!='A' and S[k]!='C' and S[k]!='G' and S[k]!='T':
c = False
if c and ans < j-i+1:
ans = j-i+1
print(ans) |
p03086 | s466811250 | Accepted | pat = ["A", "C", "G", "T"]
s = input()
left = right = 0
ans = 0
while left < len(s):
right = left
while right < len(s) and s[right] in pat:
right += 1
ans = max(ans, right - left)
left = right + 1
print(ans)
|
p03086 | s266861614 | 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 | s897876519 | Accepted | S = input()
ans = 0
n = len(S)
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+1-i)
print(ans) |
p03086 | s660956830 | Accepted | # AtCoder Beginner Contest 122 B - ATCoder
import sys
S = str(input())
target = ['A', 'C', 'G', 'T']
ans = 0
temp_ans = 0
for s in S:
if s in target:
temp_ans += 1
else:
temp_ans = 0
ans = max(ans, temp_ans)
print(ans)
|
p03086 | s549004044 | Accepted | items = ['A', 'C', 'G', 'T']
def max(a, b):
return a if a > b else b
x= 0
y = 0
for c in list(input()):
if c in items:
y += 1
x = max(x, y)
else:
y = 0
print(x) |
p03086 | s815190024 | Accepted | import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input():
return sys.stdin.readline().rstrip()
def main():
S=list(input())
ans=0
tmp=0
for s in S:
if s=='A' or s=='T' or s=='G' or s=='C':
tmp+=1
else:
ans=max(ans,tmp)
tmp=0
a... |
p03086 | s136670799 | Accepted | S = input()
N = len(S)
ans = 0
for i in range(N):
for j in range(i + 1, N + 1):
ss = S[i:j]
for c in ss:
if not c in ("A", "C", "G", "T"):
break
else:
ans = max(ans, len(ss))
print(ans) |
p03086 | s333627844 | Accepted | s = input()
str_max = ""
int_max = 0
str_temp = ""
int_temp = 0
for i in s:
if i == "A"or i == "C"or i == "G"or i == "T":
str_temp += i
int_temp += 1
# print("OK", i)
else:
str_temp = ""
int_temp = 0
# print("NG", i)
if int_max < int_temp:
int_max =... |
p03086 | s600383617 | Accepted | s = input()
ans = 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
for j in range(i+1, len(s)):
if s[j] == 'A' or s[j] == 'C' or s[j] == 'G' or s[j] == 'T':
count += 1
else:
break
if ans ... |
p03086 | s030249249 | Accepted | s = input()
S = ""
for i in s:
if i in "ACGT":S+="1"
else:S+="0"
print(max(list(map(len,S.split("0"))))) |
p03086 | s372175212 | Accepted | S = input()
acgt = {'A', 'C', 'G', 'T'}
length = len(S)
start = 0
ans = 0
while start < length:
while start < length and S[start] not in acgt:
start += 1
right = start
while right < length and S[right] in acgt:
right += 1
ans = max(ans, right - start)
start = right
print(ans) |
p03086 | s903243390 | Accepted | S = input()
man = 0
cnt = 0
l = ['A', 'C', 'G', 'T']
for s in S:
res = False
for i in l:
if s == i:
cnt += 1
res = True
if res == False:
cnt = 0
if man < cnt:
man = cnt
print(man) |
p03086 | s657814523 | Accepted | S="x"+input()
T=[0]*(len(S)+1)
U={"A","C","G","T"}
for i in range(len(S)):
if S[i] in U:
T[i]=T[i-1]+1
else:
T[i]=0
print(max(T))
|
p03086 | s873148540 | Accepted | s = input()
import re
sep = 'B|D|E|F|H|I|J|K|L|M|N|O|P|Q|R|S|U|V|W|X|Y|Z'
print(max([len(i) for i in re.split(sep, s)])) |
p03086 | s710792976 | Accepted | import sys
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))
def main():
S = input()
ans = 0
tmp = 0
acgt = ['A', 'C', 'G', 'T']
... |
p03086 | s451349309 | Accepted | if __name__ == '__main__':
#全探索
S = input()
s_len = len(S)
s1 = {"A","C","G","T"}
m_len = 0
for x in range(s_len):
for y in range(x+1,s_len+1):
s2 = set(S[x:y])
s_union = s1.union(s2)
if len(s_union) == 4:
m_len = max(m_len,len(S[x:y]))
print(m_len)
|
p03086 | s227001572 | Accepted | s = input()
x = 0
y = 0
for i in range(len(s)):
if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":
x = x + 1
else:
if y < x:
y = x
x = 0
if y < x:
y = x
print(y) |
p03086 | s825034857 | Accepted | import re
S = input()
ACGT = re.findall('[ACGT]+',S)
if len(ACGT) > 0:
print(max([len(s) for s in ACGT]))
else:
print(0) |
p03086 | s104434816 | Accepted | S = str(input())
data = ['A','C','G','T']
acgt = ''
for s in S:
if s not in data:
acgt += '.'
else:
acgt += s
ans = 0
for s in acgt.split('.'):
ans = max(ans, len(s))
print(ans) |
p03086 | s996733254 | Accepted | S=input()
agct='AGCT'
ans=0
for i in range(len(S)):
cnt=0
j=i
while j<len(S) and S[j] in agct :
cnt+=1
j+=1
ans=max(ans,cnt)
print(ans) |
p03086 | s857063949 | Accepted | S = input()
max_len = 0
counter = 0
for i in S:
if i in 'ACGT':
counter += 1
if max_len < counter:
max_len = counter
else:
counter = 0
print(max_len)
|
p03086 | s102618690 | Accepted | S = input()
ACGT = ["A", "C", "G", "T"]
s = ""
l = []
for i in S:
if i in ACGT:
s += i
l.append(s)
else:
l.append(s)
s = ""
l2 = map(len, l)
print(max(l2)) |
p03086 | s588898946 | Accepted | #ABC122-B
s = input()
atgc = set(['A','T','G','C'])
cnt = 0
acgt_len = []
for i in range(len(s)):
if s[i] in atgc:
cnt += 1
else:
acgt_len.append(cnt)
cnt = 0
acgt_len.append(cnt)
print(max(acgt_len)) |
p03086 | s588686127 | Accepted | S = input()
x = ['A', 'C', 'T', 'G']
i = 0
count = 0
ans = 0
while i < len(S):
if S[i] in x:
count += 1
ans = max(ans, count)
else:
count = 0
i += 1
print(ans)
|
p03086 | s962200477 | Accepted | s = input()
acgt = 'ACGT'
max_count = 0
i = 0
while i < len(s):
count = 0
if s[i] not in acgt:
i += 1
continue
count += 1
for j in range(i+1, len(s)):
if s[j] not in acgt:
break
count += 1
if count > max_count:
max_count = count
i += count + 1
... |
p03086 | s931221845 | Accepted | S = input()
acgt = {'A','C','G','T'}
m = 0
c = 0
for s in S:
if s in acgt:
c+=1
m = max(m,c)
else:
m = max(m,c)
c = 0
print(m) |
p03086 | s878543966 | Accepted | s = input()
a = [-1]
b = 0
for n in range(len(s)):
if s[n] != "A" and s[n] != "C" and s[n] != "G" and s[n] != "T":
a.append(n)
a.append(len(s))
for n in range(len(a)-1):
b = max(b, a[n+1]-a[n]-1)
print(b) |
p03086 | s588759474 | Accepted | s = input()
answer, count = 0, 0
for c in s:
if c in "ACGT":
count += 1
else:
answer = max(answer, count)
count = 0
answer = max(answer, count)
print(answer)
|
p03086 | s787026202 | Accepted | S = input()
max_length = 0
length = 0
for s in S:
if s in ["A", "C", "G", "T"]:
length += 1
else:
if length > max_length:
max_length = length
length = 0
if length > max_length:
max_length = length
print(max_length) |
p03086 | s646888705 | Accepted | # -*- coding:utf-8 -*-
import re
S = input()
S_sp = re.split("[^ACGT]",S)
ans = 0
for moji in S_sp:
if len(moji) > ans:
ans = len(moji)
print(ans)
|
p03086 | s717602934 | Accepted | S=input()
ans=0
length=0
for c in S:
if (c == 'A' or c == 'G' or c == 'C' or c == 'T'):
length += 1
if length > ans:
ans = length
else:
length = 0
print(ans)
|
p03086 | s354214382 | Accepted | import re
print(max([0]+[len(r) for r in re.findall("[ACGT]+",input())])) |
p03086 | s043610813 | Accepted | S = str(input())
chrs = ('A', 'C', 'G', 'T')
max_len = 0
this_len = 0
for s in S:
if s in chrs:
this_len += 1
else:
this_len = 0
max_len = max(this_len, max_len)
print(max_len) |
p03086 | s092898680 | Accepted | S = input()
m = 0
cnt = 0
for s in S:
if s == 'A':
cnt += 1
elif s == 'C':
cnt += 1
elif s == 'G':
cnt += 1
elif s == 'T':
cnt += 1
else:
cnt = 0
m = max(m, cnt)
print(m)
|
p03086 | s326475709 | Accepted | x=["A","G","C","T"]
ans=0
now=0
for i in input():
if i in x:
now+=1
else:
now=0
ans=max(now,ans)
print(ans) |
p03086 | s121320341 | Accepted | s = input()
acgt = [0]
tmp = 0
for i in range(len(s)):
if s[i] in ['A', 'C', 'G', 'T']:
tmp += 1
elif tmp > 0:
acgt.append(tmp)
tmp = 0
acgt.append(tmp)
print(max(acgt)) |
p03086 | s662437203 | Accepted | s = input()
l = list(s)
count = 0
ans = 0
for i in range(len(l)):
if l[i] == "A" or l[i] == "T" or l[i] == "G" or l[i] == "C":
count += 1
continue
ans = max(ans,count)
count = 0
ans = max(ans,count)
print(ans) |
p03086 | s121272267 | Accepted | s = input() + 'n'
ans = 0
fans = 0
for i in range(len(s)):
if s[i] =='A' or s[i] =='C' or s[i] =='G' or s[i] =='T':
ans += 1
elif fans < ans:
fans = ans
ans = 0
print(fans) |
p03086 | s180672895 | Accepted | s = input()
substring = set(['A', 'C', 'G', 'T'])
MAX = 0
i = 0
while i < len(s):
t = 0
for j in range(i, len(s)):
if s[j] in substring:
t += 1
else:
break
i += 1
MAX = max(MAX, t)
print(MAX) |
p03086 | s245613570 | Accepted | import sys
S = input()
maxer = 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 maxer < count:
maxer = count
else:
count = 0
print( maxer ) |
p03086 | s932227766 | Accepted | dic = ["A","T","G","C"]
S = list(input())
ans = 0
count = 0
for i in range(0,len(S),1):
if S[i] in dic:
count += 1
ans = max(ans,count)
else:
count=0
print(ans) |
p03086 | s265973168 | Accepted | S = input()
N = len(S)
a,b = 0,0
l = [0]
for i in range(N):
if S[i] == 'A' or S[i] == 'C' or S[i] == 'G' or S[i] == 'T':
a += 1
b = 1
else:
if b:
l.append(a)
b = 0
a = 0
else:
if a:
l.append(a)
print(max(l)) |
p03086 | s378535458 | Accepted | s=input()
n=len(s)
def check(s):
a=list(set(list(s)))
b=list("ACGT")
for i in b:
if i in a:
a.remove(i)
if a==[]:
return len(s)
return 0
ans=0
for i in range(n):
for j in range(n+1):
ans=max(ans,check(s[i:j]))
print(ans) |
p03086 | s579783699 | Accepted | s=input()
ACGT=["A","C","G","T"]
moji=[]
for i in range(len(s)):
#print(moji)
if s[i] in ACGT:
moji.append(s[i])
for j in range(i+1,len(s)):
if s[j] in ACGT:
moji[i]+=s[j]
else:
break
else:
moji.append("")
index=0
for i in moji:... |
p03086 | s748083347 | 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 | s902328706 | Accepted | S = list(input())
c = 0
ans = 0
for i in S:
if i=='A' or i=='C' or i=='G' or i=='T':
c += 1
if ans < c:
ans = c
else:
c = 0
print(ans) |
p03086 | s474343756 | Accepted | s = input()
l = len(s)
ans = 0
for i in range(l):
loc = 0
idx = i
while s[idx] in ["A","C","G","T"] and idx<l:
loc += 1
idx += 1
if idx>=l:
break
ans = max(ans,loc)
print(ans) |
p03086 | s450142996 | Accepted | S = input()
L = ["A","G","C","T"]
cnt = 0
maxcnt = 0
for i in range(len(S)):
if S[i] in L:
cnt += 1
else:
if maxcnt < cnt:
maxcnt = cnt
cnt = 0
if maxcnt < cnt:
maxcnt = cnt
print(maxcnt) |
p03086 | s165158330 | Accepted | # -*- coding: utf-8 -*-
S = input().strip()
max_cnt=0
cnt=0
for i in range(len(S)):
if S[i] in "ACGT":
cnt += 1
else:
max_cnt = max(max_cnt,cnt)
cnt = 0
max_cnt = max(max_cnt,cnt)
print(max_cnt)
|
p03086 | s778097276 | Accepted | s = input()
n = len(s)
ans = 0
for i in range(n):
for j in range(i, n):
ok = True
for k in range(i, j + 1):
if s[k] not in ['A', 'T', 'G', 'C']:
ok = False
if ok:
ans = max(ans, j - i + 1)
print(ans)
|
p03086 | s909363651 | Accepted | S=input()
H="AGTC"
ans=0
cnt=0
for i in range(len(S)):
if S[i] in H:
cnt+=1
ans=max(ans,cnt)
else:
cnt=0
print(ans) |
p03086 | s269331495 | Accepted | S=input()
max_bubun_length=0
tmp_bubun_length = 0
for i in range(len(S)):
# print(S[i])
# print(tmp_bubun_length)
# print(max_bubun_length)
if S[i] in "ACGT":
tmp_bubun_length += 1
else:
if tmp_bubun_length > max_bubun_length:
max_bubun_length = tmp_bubun_length
... |
p03086 | s492763832 | Accepted | S = input()
List = list(S)
ans = 0
arr = []
for i in range(len(List)):
if List[i] == "A" or List[i] == "C" or List[i] == "G" or List[i] == "T":
ans += 1
else:
arr.append(ans)
ans = 0
arr.append(ans)
print(max(arr))
|
p03086 | s653773979 | Accepted | s = input()
moji = ("A","C","G","T")
count = [0]
tmp = 0
for i in range(len(s)):
if s[i] in moji:
tmp +=1
else:
count.append(tmp)
tmp = 0
count.append(tmp)
print(max(count)) |
p03086 | s629210034 | Accepted | s = input()
dp = [0]*(len(s) + 1)
for i, x in enumerate(s):
if x in "ACGT":
dp[i+1] = dp[i] + 1
print(max(dp)) |
p03086 | s388605299 | Accepted | s = input()
n = len(s)
ans = 0
for i in range(n):
for j in range(i,n):
if all("ATGC".count(c) == 1 for c in s[i:j+1]):
ans = max(ans,j - i + 1)
print(ans) |
p03086 | s058900537 | Accepted | s=input()
gene = ["A","T","G","C"]
ans=0
counter=0
for i in range(len(s)):
for j in range(i,len(s)):
if(s[j] in gene):
counter += 1
else:
if(counter > ans):
ans=counter
counter=0
break
if(counter > ans):
ans=counter
counter=0
print(ans) |
p03086 | s723830507 | Accepted | S = input()
result = 0
for i in range(len(S)):
head = S[i:]
for j in range(len(head)):
tail = head[:j + 1]
if len(list(filter(lambda x: x not in "ACGT", tail))) == 0:
result = len(tail) if len(tail) > result else result
print(result)
|
p03086 | s883542672 | Accepted | S=input()
DNA=['A','T','C','G']
count=0
v=0
for ch in S:
if ch in DNA:
count+=1
else:
if v < count:
v=count
count=0
else:
count=0
if v < count:
v=count
print(v) |
p03086 | s773561284 | Accepted | S = input()
ans = 0
count = 0
ACGT = ['A', 'C', 'G', 'T']
for i in range(len(S)):
for j in range(i, len(S)):
if all(ACGT.count(c) == 1 for c in S[i : j+1]):
ans = max(ans, j-i+1)
print(ans) |
p03086 | s450027310 | Accepted | S = list(input())
ACGT = ["A", "C", "G", "T"]
count = 0
Max = 0
if len(S) == 1:
if S[0] in ACGT:
print(1)
else:
print(0)
else:
for s in S:
if s in ACGT:
count += 1
if count > Max:
Max = count
else:
if count > Max:
... |
p03086 | s975127443 | Accepted | import re
print(len(max("".join(re.sub(r"[^ATCG]", " ", input())).split(" "), key=lambda x: len(x)))) |
p03086 | s555772861 | Accepted | S = input()
ma = 0
tmp = 0
acgt = ('A','C','G','T')
for s in S:
if s in acgt:
tmp += 1
ma = max(ma,tmp)
else:
tmp = 0
print(ma) |
p03086 | s158373087 | Accepted | S = input()
ret = 0
for i in range(len(S)):
for j in range(i, len(S)):
f = True
for k in S[i:j + 1]:
if k not in ("ACGT"):
f = False
break
if f:
ret = max(ret, (j + 1) - i)
print(ret) |
p03086 | s042354839 | Accepted | def is_acgt(s):
for c in s:
if c not in ["A", "C", "G", "T"]:
return False
return True
S = input()
ml = 0
for l in range(len(S)+1):
for r in reversed(range(len(S)+1)):
if l <= r and is_acgt(S[l:r]):
ml = max(ml, r-l)
print(ml) |
p03086 | s920362190 | Accepted | s=str(input())
cnt=0
for i in range(len(s)):
tmp=0
for j in range(len(s)-i):
if(s[i+j]=="A"or s[i+j]=="C"or s[i+j]=="G" or s[i+j]=="T"):
tmp+=1
else:
break
cnt = max(cnt,tmp)
print(cnt) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.