problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s180817622 | Accepted | s = input()
l = 0
max_num = 0
for str in s:
if str in 'ATCG':
l += 1
else:
max_num = max(max_num, l)
l = 0
max_num = max(max_num, l)
print(max_num)
|
p03086 | s212441396 | Accepted | l = ('A', 'T', 'C', 'G')
S = input()
ans, res = 0, 0
for i in range(len(S)):
if S[i] in l:
res += 1
else:
ans = max(ans, res)
res = 0
ans = max(ans, res)
print(ans) |
p03086 | s264347794 | Accepted | S = input()
ans = 0
i = 0
for i in range(len(S)):
for j in range(i,len(S)):
if S[j]=='A' or S[j]=='G' or S[j]=='T' or S[j]=='C':
ans = max(ans,j-i+1)
else:
break
print(ans)
# print(S) |
p03086 | s622413252 | Accepted | s = str(input())
arr = []
count = 0
ans = 0
for i in s:
if i == 'A' or i == 'C' or i == 'G' or i == 'T':
arr.append(1)
else:
arr.append(0)
for i in range(0, len(arr)):
if arr[i] == 0:
count = 0
else:
count += 1
ans = max(ans, count)
print(ans) |
p03086 | s556780943 | Accepted | checklist=['A','C','G','T']
sn = list(input())
answer = 0
count = 0
for s in sn :
if s in checklist:
count += 1
else :
count = 0
answer = max(answer,count)
print(answer) |
p03086 | s661138244 | Accepted | import re
from itertools import groupby
S = input()
S = re.sub("[ACGT]", "?", S)
ans = 0
cnt = 0
for s,l in groupby(S):
if s=="?":
ans = max(ans, len(list(l)))
print(ans) |
p03086 | s368563233 | Accepted | s=input()
ans=0
cnt=0
for ss in s:
if ss in 'ATGC':
cnt+=1
else:
ans=max(ans,cnt)
cnt=0
print(max(ans,cnt)) |
p03086 | s237595991 | Accepted | S = input()
answer = ''
number_of_consecutive_times = 0
maxium_number_of_consecutive_times = 0
for char in S:
is_included = char in ['A', 'C', 'G', 'T']
if is_included:
number_of_consecutive_times += 1
maxium_number_of_consecutive_times = max(
number_of_consecutive_times,
... |
p03086 | s895596182 | Accepted | def main():
str = input()
max_len = 0
len_acgt = 0
for i in range(len(str)):
if str[i] in "ACGT":
len_acgt += 1
else:
len_acgt = 0
max_len = max(max_len, len_acgt)
print(max_len)
if __name__ == "__main__":
main() |
p03086 | s402750694 | Accepted | # https://atcoder.jp/contests/abc122/tasks/abc122_b
S = input()
SPECIAL = ["A", "C", "G", "T"]
ans = 0
n = 0
for s in S:
if s in SPECIAL:
n += 1
else:
if ans < n:
ans = n
n = 0
if ans < n:
ans = n
print(ans)
|
p03086 | s632597915 | Accepted | s = input()
possible_answers = [0]
possible_answer = 0
acgt = ['A', 'C', 'G', 'T']
for i in range(len(s)):
if s[i] in acgt:
possible_answer += 1
else:
possible_answers.append(possible_answer)
possible_answer = 0
possible_answers.append(possible_answer)
print(max(possible_answers)) |
p03086 | s443400554 | Accepted | def readinput():
s=input()
return s
def main(s):
maxlen=0
templen=0
for i in range(len(s)):
if(s[i]=='A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T'):
templen+=1
else:
maxlen=max(maxlen,templen)
templen=0
return max(maxlen,templ... |
p03086 | s800353903 | Accepted | S = input()
mx = 0
cnt = 0
for s in S:
if s not in ['A', 'T', 'C', 'G']:
mx = max(mx, cnt)
cnt = -1
cnt += 1
mx = max(mx, cnt)
print(mx) |
p03086 | s027437658 | Accepted | # coding: utf-8
S = input()
c = 0
m = 0
for i in S:
if 'A' == i or 'C' == i or 'G' == i or 'T' == i:
c += 1
m = max(c, m)
else:
c = 0
print(m) |
p03086 | s010522584 | Accepted | s = input()
ans = 0
cnt = 0
for i in s:
if i in 'ACGT':
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
ans = max(ans, cnt)
print(ans) |
p03086 | s157499847 | Accepted | S = input()
maximum = 0
cnt = 0
for i in range(len(S)):
if S[i] in ['A','T','C','G']:
cnt += 1
maximum = max(maximum,cnt)
else:
cnt = 0
print(maximum) |
p03086 | s970676722 | Accepted | S = input()
count = [0]
counter = 0
for i in S:
if i == "A" or i == "C" or i == "G" or i == "T":
counter += 1
count.append(counter)
else:
counter = 0
print(max(count)) |
p03086 | s158836989 | Accepted | s = input()
res = []
for i in range(len(s)):
for j in range(i, len(s)):
check = s[i:j+1]
if len(check) == check.count("A")+check.count("T")+check.count("C")+check.count("G"):
res.append(len(check))
print(0 if res == [] else max(res)) |
p03086 | s533214474 | Accepted | import itertools
import math
import sys
import heapq
from collections import Counter
from collections import deque
from fractions import gcd
INF = 1 << 60
sys.setrecursionlimit(10 ** 6)
#ここから書き始める
s = input()
n = len(s)
ans = 0
cnt = 0
for i in range(n):
if s[i] in ["A", "C", "G", "T"]:
cnt += 1
else:
... |
p03086 | s273723607 | Accepted | s=input()
l = [0]
cnt = 0
for i in s:
if i =='A'or i == 'C' or i == 'G' or i == 'T':
cnt +=1
l.append(cnt)
else:
cnt = 0
print(max(l)) |
p03086 | s438343453 | Accepted | import sys
from itertools import combinations
import math
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
ans = 0
temp =... |
p03086 | s702681331 | Accepted | s = input()
max_cnt = 0
cnt = 0
for i in s:
if i in ['A', 'C', 'G', 'T']:
cnt += 1
else:
max_cnt = max(cnt, max_cnt)
cnt = 0
print(max(max_cnt, cnt)) |
p03086 | s869475324 | Accepted | s = input()
max_value = 0
count = 0
for c in s:
if c in "ACGT":
count += 1
else:
count = 0
max_value = max(max_value, count)
print(max_value) |
p03086 | s620007894 | Accepted | s = input()
maxl = 0
l = 0
for i in range(len(s)):
if s[i] in 'ACGT':
l += 1
else:
if maxl < l:
maxl = l
l = 0
if maxl < l:
maxl = l
print(maxl)
|
p03086 | s019519366 | 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 | s059507434 | Accepted | S = input()
A =set()
t = 0
for i in range(len(S)):
if S[i] == 'A' or S[i] == 'G' or S[i] == 'C' or S[i] == 'T':
t += 1
else:
A.add(t)
t = 0
A.add(t)
print(max(A)) |
p03086 | s450697859 | Accepted | s = input()
ans = 0
l = 0
for c in s:
if c == 'A' or c == 'C' or c == 'G' or c == 'T':
l += 1
else:
ans = max(ans, l)
l = 0
ans = max(ans, l)
print(ans)
|
p03086 | s621371144 | Accepted | S = input()
ans = 0
tans = 0
for c in S:
if c in "ACGT":
tans += 1
ans = max(ans, tans)
else:
tans = 0
print(ans) |
p03086 | s603359544 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
s = input()
n = len(s)
ans = 0
acgt = set(['A', 'C', 'G', 'T'])
for i in range(n):
for j in range(i + 1, n + 1):
t = s[i:j]
flag = 1
for k in t:
if k not in acgt:
flag = 0
break
... |
p03086 | s168862324 | Accepted | s = input()
word = ['A', 'C', 'G', 'T']
count = 0
tmp = 0
for i in s:
if word.count(i) == 1:
tmp += 1
else:
tmp = 0
if count < tmp:
count = tmp
print(count) |
p03086 | s113966386 | Accepted | s=input()
l=len(s)
count=0
ans=0
for i in range(l):
if s[i]=='A' or s[i]=='G' or s[i]=='C' or s[i]=='T':
count+=1
else:
if count>ans:
ans=count
count=0
if count>ans:
ans=count
print(ans) |
p03086 | s324547271 | Accepted | n = input()
count=0
m = 0
for s in n:
if s =="A" or s == "C" or s == "G" or s== "T" :
count+=1
m =max(m,count)
else:
count=0
print(m) |
p03086 | s512238794 | Accepted | S = input()
d = set(['A', 'T', 'C', 'G'])
len_ = 0
ans = 0
for s in S:
if s in d:
len_ += 1
else:
# この部分書き換える
# if len_ > ans:
# ans = len_
ans = max(len_, ans)
len_ = 0
ans = max(len_, ans)
print(ans)
|
p03086 | s183253368 | Accepted | # 初期入力
import sys
input = sys.stdin.readline
S =input().strip()
#ACGTが連続しているか判定
count =0
count_list=[0]
for i in S:
if i in "ACGT":
count +=1
count_list.append(count)
else:
count =0
print(max(count_list)) |
p03086 | s309165335 | Accepted | S = input()
L = [s in "ACGT" for s in S]
ans, cnt = 0, 0
for l in L:
if l == True:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
ans = max(ans, cnt)
print(ans) |
p03086 | s938730263 | Accepted | s=input()
temp=0
ans=0
tar="ACGT"
for ch in s:
if ch in tar:
temp+=1
else:
ans=max(ans, temp)
temp=0
print(max(ans,temp))
|
p03086 | s677844018 | Accepted | b = input()
n = len(b)
ans = 0
kar = 0
for i in range(n):
for j in range(i,n):
if b[j] == "A" or b[j] == "T" or b[j] == "G" or b[j] == "C":
kar += 1
else:
if kar > ans:
ans = kar
kar = 0
if j == n - 1:
if kar > ans:
... |
p03086 | s498229491 | Accepted | s = input()
acgt = ['A', 'C', 'G', 'T']
cnt = [0]*len(s)
for i in range(len(s)):
for j in range(i, len(s)):
if s[j] in acgt:
cnt[i] += 1
else:
break
print(max(cnt)) |
p03086 | s502686450 | Accepted | s = input()
ans=0
now=0
for a in s:
if(a=='A' or a=='G' or a=='C' or a=='T'):
now+=1
else:
now=0
ans=max(ans,now)
print(ans) |
p03086 | s177756424 | Accepted | s = str(input())
w = ""
l = []
for i in s:
if i=='A' or i=='C' or i=='G' or i=='T':
w += i
else:
l.append(len(w))
w = ""
l.append(len(w))
print(max(l)) |
p03086 | s529720866 | Accepted | a = ["A", "T", "G", "C"]
b = input()
ans = 0
cnt = 0
for i in range(len(b)):
if b[i] in a:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
ans = max(ans,cnt)
print(ans)
|
p03086 | s572621985 | Accepted | S = input()
acgt = ["A","C","G","T"]
ans = 0
ok = False
tmp = 0
for s in S:
if not ok:
if s in acgt:
ok = True
tmp += 1
else:
pass
elif ok:
if s in acgt:
tmp += 1
else:
ok = False
ans = max(tmp,ans)
... |
p03086 | s771234741 | Accepted | s = input()
ans = 0
m = 0
for i in s:
if i in "ACGT":
m += 1
if m > ans:
ans = m
else:
m = 0
print(ans) |
p03086 | s198935253 | Accepted | s= input()
import re
str_s = re.findall('[ATGC]+',s)
length = [len(p) for p in str_s]
if length==[]:
print(0)
else:
print(max(length)) |
p03086 | s328085397 | Accepted | s = input()
s += 'q'
ans = ''
lst = []
for ss in s:
if ss in ['A', 'C', 'G', 'T']:
ans += ss
else:
lst.append(len(ans))
ans = ''
print(max(lst)) |
p03086 | s547007332 | Accepted | s = input()
ans = 0
DNA = ['A', 'C', 'G', 'T']
count = 0
for i in range(len(s)):
c = s[i]
if c in DNA:
count += 1
else:
ans = max(ans, count)
count = 0
if i == len(s) - 1:
ans = max(ans, count)
print(ans)
|
p03086 | s084382803 | Accepted | import sys
S = input()
ok = ["A","G","T","C"]
for l in range(len(S),0,-1):
for i in range(0,len(S)-l+1):
for s in S[i:i+l]:
if s in ok:
continue
else:
break
else:
print(l)
sys.exit()
else:
print(0)
|
p03086 | s339649996 | Accepted | s = input()
ans = [0]
for i in range(len(s)):
for j in range(len(s)):
l = s[i:j+1]
if all(x=='A'or x=='C' or x=='G' or x=='T' for x in l):
ans.append(len(l))
print(max(ans))
|
p03086 | s425679958 | Accepted | S = input()
ans = 0
for l in range(len(S)):
for r in range(l, len(S)):
T = S[l:r+1]
if set(T) <= set('ACGT'):
ans = max(ans, r-l+1)
print(ans) |
p03086 | s369153274 | Accepted | a = list(input())
ans = 0
count = 0
for i in a:
if i == 'A':
count +=1
elif i == 'C':
count+=1
elif i == 'G':
count+=1
elif i == 'T':
count+=1
else:
ans = max(ans ,count)
count = 0
print(max(ans,count)) |
p03086 | s101331785 | Accepted | if __name__ =='__main__':
s = input()
ans = 0
seq = 0
for c in s:
if c=='A' or c=='T' or c=='G' or c=='C':
seq+=1
else:
ans = max(ans,seq)
seq=0
ans = max(ans,seq)
print(ans) |
p03086 | s526802482 | Accepted | s = input()
cnt = 0
ans = 0
for i in range(len(s)):
if s[i] == 'A' or s[i] == 'T' or s[i] == 'G' or s[i] == 'C':
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(max(ans, cnt)) |
p03086 | s088929567 | Accepted | S = input()
S_num = [0]*len(S)
for i in range(len(S)):
if S[i] in ["A", "T", "G", "C"] :
if i == 0:
S_num[i] = 1
else:
S_num[i] = S_num[i-1]+1
print(max(S_num)) |
p03086 | s197969334 | Accepted | s = input()
score=0
ans=[]
for i in s:
if i in {"A", "T", "C", "G"}:
score+=1
else:
score=0
ans.append(score)
print(max(ans)) |
p03086 | s706251376 | Accepted | #!/usr/bin/env python3
S = input()
s = ''
base = ('A', 'C', 'G', 'T')
max_len = 0
for c in S:
if c not in base:
s = ''
continue
s += c
current_len = len(s)
if max_len < current_len:
max_len = current_len
print(max_len)
|
p03086 | s504894117 | Accepted | S = str(input())
ans=0
for i in range(len(S)+1):
for j in range(i,len(S)+1):
s=S[i:j]
if s.count("A")+s.count("G")+s.count("C")+s.count("T")==len(s):
ans=max(len(s),ans)
print(ans) |
p03086 | s833392703 | Accepted | import re
S = input()
L = re.findall("[AGCT]+", S)
LL = [len(x) for x in L ]
if LL:
print(max(LL))
else:
print(0) |
p03086 | s263923998 | Accepted | # https://atcoder.jp/contests/abc122/tasks/abc122_b
def is_acgt(c):
acgt = ['A', 'C', 'G', 'T']
return c in acgt
if __name__ == "__main__":
S = input()
result = 0
tmp_result = 0
for c in S:
if (is_acgt(c)):
tmp_result += 1
result = max(result, tmp_result)
... |
p03086 | s670599870 | Accepted | S = input()
n = len(S)
ans = 0
for i in range(1,n+1):
for j in range(n-i+1):
target = S[j:j+i]
flag = True
for t in target:
if t not in ['A', 'C', 'G', 'T']:
flag = False
break
if flag:
ans = max(ans, len(target))
... |
p03086 | s681279673 | Accepted | s = list(str(input()))
for i in range(len(s)):
if s[i] in 'ATCG':
s[i] = 1
else:
s[i] = 0
def shakutori(a, k):
right, cnt = 0, 0
for left in range(len(a)):
while right < len(a) and a[right] == k:
right += 1
cnt = max(cnt, right - left)
if right == left... |
p03086 | s355113516 | Accepted | s = input()
count = 0
ans = 0
for i in s:
if i in'AGCT':
count += 1
else:
count = 0
ans = max(ans, count)
print(ans) |
p03086 | s215949195 | Accepted | S=input()
N=len(S)
ans=0
d=set(list("AGCT"))
for i in range(N+1):
for j in range(N+1):
s=S[i:j]
if set(list(s))<=d:
ans=max(ans,len(s))
print(ans) |
p03086 | s974075671 | Accepted | s = input()
atgc = ["A","T","G","C"]
mylist = [0]
for i in range(len(s)):
if s[i] in atgc:
mylist.append(mylist[-1] +1)
else:
mylist.append(0)
print(max(mylist)) |
p03086 | s943243958 | Accepted | s = input()
ans = 0
memo = 0
for i in s:
if i == 'A' or i == 'T' or i == 'C' or i == 'G':
memo += 1
else:
ans = max(ans, memo)
memo = 0
print(max(ans, memo)) |
p03086 | s872031508 | Accepted | import re
s = input()
max_len = 0
for i in range(len(s)):
for j in range(i, len(s)):
a = s[i:j + 1]
if re.fullmatch(r'(A|C|G|T)*', a):
# print(a)
max_len = max(max_len, len(a))
print(max_len) |
p03086 | s557027608 | Accepted | S = input()
s = []
for i in range(len(S)):
if S[i] == 'A' or S[i] == 'C' or S[i] == 'G' or S[i] == 'T':
s.append(i)
ans = 0
if len(s) == 1:
ans = 1
count = 1
for i in range(len(s)-1):
if s[i] + 1 == s[i+1]:
count += 1
else:
count = 1
if ans < count:
ans = count
pr... |
p03086 | s747112226 | Accepted | s=input()
score=0
for i in range(len(s)):
for j in range(i,len(s)):
isbad = 0
for k in range(i,j+1):
if s[k] != "A" and s[k] != "C" and s[k] != "G" and s[k] != "T":
isbad=1
break
if isbad==0:
score = max(j+1-i,score)
# pr... |
p03086 | s594041184 | Accepted | def solution():
s = input()
ans = len = 0
for c in s:
if c in 'ACGT':
len += 1
ans = max(ans, len)
else:
len = 0
print(ans)
solution() |
p03086 | s809121415 | Accepted | a=input()
b=0
c=('A','C','G','T')
d=0
for i in range(len(a)):
if a[i] in c:
b+=1
if b>d:
d=b
else:
b=0
print(d) |
p03086 | s079317876 | Accepted | s = input()
n = len(s)
acgt = ["A", "C", "G", "T"]
ans = 0
cnt = 0
for i in range(n):
if s[i] in acgt:
cnt += 1
#print(ans, cnt, i)
else:
ans = max(ans, cnt)
#print(ans, cnt, i)
cnt = 0
print(max(ans, cnt))
|
p03086 | s942551825 | Accepted | S = input()
N = len(S)
l = []
for i in range(N):
for j in range(i,N):
s = S[i:j+1]
if s.strip("A C G T") == "":
l.append(s)
if len(l) == 0:
print(0)
exit()
m = sorted(l, reverse=True, key=len)
print(len(m[0]))
|
p03086 | s550659728 | Accepted | items = ['A', 'C', 'G', 'T']
def chkmax(a, b):
return a if a > b else b
res = 0
cnt = 0
for c in list(input()):
if c in items:
cnt += 1
res = chkmax(res, cnt)
else:
cnt = 0
print(res)
|
p03086 | s656532299 | Accepted | acgt = list('ACGT')
s = input()
ans = 0
count = 0
for i in s:
if i in acgt:
count += 1
ans = max(count, ans)
else:
count = 0
print(ans)
|
p03086 | s453181191 | Accepted | S = input()
ans = 0
for i in range(len(S)):
j = 0
while i+j < len(S):
if S[i+j:i+j+1] in ('A', 'C', 'T', 'G'):
j += 1
else:
break
ans = max(ans, j)
print(ans)
|
p03086 | s364539119 | Accepted | S=input()
ans = 0
for i in range(1,len(S)+1):
for j in range(0,len(S)-i+1):
if all([c in ["A","T","G","C"] for c in S[j:j+i]]):
ans = i
print(ans) |
p03086 | s108288400 | Accepted | li = list(input())
ans = 0
num = 0
for i in range(len(li)):
if li[i] == 'A' or li[i] == 'G' or li[i] == 'C' or li[i] == 'T':
num += 1
else:
if ans < num:
ans = num
num = 0
if ans == 0:
ans = num
if ans < num:
ans = num
print(ans) |
p03086 | s896824590 | Accepted | s = input()
ans = 0
for start in range(len(s)):
for end in range(len(s)):
tmps = s[start:end+1]
if set(tmps) <= {"A","G","C","T"}:
ans = max(ans,len(tmps))
print(ans) |
p03086 | s484123541 | Accepted | S=str(input())
S2=[]
ans=0
for i in range(len(S)):
for j in range(len(S)+1):
S2=S[i:j]
que=len(S2)
S2=S2.replace("A","")
S2=S2.replace("G","")
S2=S2.replace("C","")
S2=S2.replace("T","")
if S2=="":
if que>ans:
ans=que
S2=[]
print(ans) |
p03086 | s682031307 | Accepted | import sys
def S(): return sys.stdin.readline().rstrip()
S = S()
ans,temp = 0,0
for x in S:
if x in 'ACGT':
temp += 1
ans = max(ans,temp)
else:
temp = 0
print(ans)
|
p03086 | s963388397 | Accepted | def is_ACGT(c):
return c == "A" or c == "C" or c == "G" or c == "T"
S = input()
ans = 0
for i in range(len(S)):
j = 0
while i+j < len(S) and is_ACGT(S[i+j]):
j += 1
ans = max(ans, j)
print(ans)
|
p03086 | s300226421 | Accepted | S = input()
ans = 0
seq = 0
for i in S:
if i in ['A', 'C', 'G', 'T']:
seq += 1
else:
ans = max(ans, seq)
seq = 0
print(max(ans, seq))
|
p03086 | s474478771 | Accepted | import re
print(max(map(len,re.findall("[ACGT]*",input())))) |
p03086 | s401484446 | Accepted | s = input()
acgt = ["A","C","G","T"]
ans = 0
tmp = 0
for i in range(len(s)):
if s[i] in acgt:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
ans = max(ans, tmp)
print(ans)
|
p03086 | s776450567 | Accepted | S = input()
ACGT = ""
ans = 0
for i in range(len(S)):
for j in range(len(S)-i):
if(S[i+j] != "A" and S[i+j] != "C" and S[i+j] != "G" and S[i+j] != "T"):
break
ACGT = ACGT + S[i+j]
ans = max(ans,len(ACGT))
ACGT = ""
print(ans) |
p03086 | s596330842 | Accepted | s = input()
ans = 0
tmp = 0
for c in s:
if c in ['A', 'T', 'G', 'C']:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
ans = max(ans, tmp)
print(ans) |
p03086 | s061000981 | Accepted | s=input()
ans=0
c=0
d={"A","C","G","T"}
for i in range(len(s)):
if not s[i] in d:
ans=max(ans,c)
c=0
else:
c+=1
ans=max(ans,c)
print(ans)
|
p03086 | s932860232 | Accepted | def check(s):
return s == 'A' or s == 'C' or s == 'G' or s == 'T'
S = input()
ans = 0
tmp = 0
for s in S:
tmp = tmp + 1 if check(s) else 0
ans = max(ans, tmp)
print(ans)
|
p03086 | s943481747 | Accepted | S = input()
ans = 0
for i in range(len(S)):
tmp = 0
for j in range(len(S)):
if 'ACGT'.count(S[j]) == 1:
tmp += 1
ans = max(ans, tmp)
else:
tmp = 0
print(ans) |
p03086 | s184403690 | Accepted | #!/usr/bin/env python3
def main():
S = input()
lst = set(['A', 'C', 'G', 'T'])
cnt = 0
ans = 0
for s in S:
if s in lst:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
ans = max(ans, cnt)
print(ans)
if __name__ == '__main__':
main()
|
p03086 | s188957005 | Accepted | S=list(map(str,input()))
L=[0]*(len(S)+1)
for i in range(len(S)):
if S[i] in "ACGT":
L[i]+=1
L[i+1]+=L[i]
print(max(L))
|
p03086 | s446263994 | Accepted | # Code for B - ATCoder
# Use input() to fetch data from STDIN
s = input()
acgt = ["A", "C", "G", "T"]
m = []
c = 0
for x in s:
if not x in acgt:
m.append(c)
c = 0
else:
c += 1
m.append(c)
print(max(m))
|
p03086 | s812832608 | Accepted | #abc 106 b yakusu
s=input()
ans=0
cnt=0
acgt=["A","C","G","T"]
for i in range(len(s)):
if s[i] not in acgt:
if ans<cnt:
ans=cnt
cnt=0
else:
cnt+=1
print(max(ans,cnt))
|
p03086 | s449978451 | Accepted | check = ["A", "C", "G", "T"]
s = input()
ans = 0
tmp = 0
for i in range(len(s)):
if s[i] in check:
tmp += 1
else:
ans = max(ans,tmp)
tmp = 0
else:
ans = max(ans,tmp)
print(ans) |
p03086 | s598095602 | Accepted | S = input()
answer = 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
else:
count = 0
answer = max(answer, count)
print(answer) |
p03086 | s277836926 | Accepted | S = input()
count = 0
MAX = 0
for s in S:
if s in ['A','C','G','T']:
count += 1
else:
MAX = max(MAX,count)
count = 0
MAX = max(MAX,count)
print(MAX) |
p03086 | s210345180 | Accepted | S = input()
T = "ACGT"
ans = 0
cnt = 0
for s in S:
if s in T:
cnt += 1
else:
if cnt > ans:
ans = cnt
cnt = 0
if cnt>ans:
ans = cnt
print(ans) |
p03086 | s968521899 | Accepted | import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = input()
l = len(S)
ans = 0
for i in range(l):
for j in ran... |
p03086 | s326852662 | Accepted | S = input()
ATGC = "ATGC"
cnt_ = 0
for i in range(len(S)):
cnt = 0
for j in range(i,len(S)):
if S[j] in ATGC:
cnt += 1
else:
break
if cnt > cnt_:
cnt_ = cnt
print(cnt_) |
p03086 | s679711950 | 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 | s484581852 | Accepted | s=input()
L=len(s)
cnt=0
ans=0
dic=["A", "G", "C", "T"]
for i in range(L):
if s[i] in dic:
cnt+=1
if cnt > ans:
ans=cnt
else:
if cnt > ans:
ans=cnt
cnt=0
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.