problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s919008870 | Accepted | S=list(input())
tmp=0
ans=0
ACGT=['A','C','G','T']
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 | s026806822 | Accepted |
def main():
s = input()
ans = 0
seq = 0
for c in s:
if c == 'A' or c == 'C' or c == 'T' or c == 'G':
seq+=1
else:
ans = max(ans,seq)
seq=0
else:
ans = max(ans,seq)
print(ans)
if __name__ == '__main__':
main() |
p03086 | s962993883 | 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 | s733039021 | Accepted | # 各桁の数値の総和を計算する.
def calc_digit_sum(num):
sums = 0
while num > 0:
sums += num % 10
num //= 10
return sums
s = input()
contains = set(["A", "C", "G", "T"])
answer = cnt = 0
for ch in s:
if ch not in contains:
cnt = 0
else:
cnt += 1
answer = max(answer, cnt)
pri... |
p03086 | s306040874 | Accepted | s = input()
most = 0
acgt = ["A", "C", "G", "T"]
point = 0
for i in range(len(s)):
if s[i] in acgt:
point += 1
else:
if point > most:
most = point
point = 0
if point > most:
most = point
point = 0
print(most) |
p03086 | s496694693 | Accepted | S = input()
result = 0
for i in range(len(S)):
checker = 0
if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":
checker += 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":
checker += 1
else:
break
result = max(result,checker)
pr... |
p03086 | s581883717 | Accepted | A = list(input())
max_nu = 0
nu = 0
for i in range(len(A)):
if A[i] == "A" or A[i] == "C" or A[i] == "G" or A[i] == "T":
nu += 1
if max_nu < nu:
max_nu = nu
else:
nu = 0
print(max_nu) |
p03086 | s961065920 | Accepted | S = input()
n = len(S)
acgt = ['A', 'C', 'G', 'T']
ans = cnt = 0
for s in S:
if s in acgt:
cnt += 1
ans = max(ans, cnt)
else:
cnt = 0
print(ans) |
p03086 | s214910166 | Accepted | S=input()
acgt=['A','C','G','T']
ans,count=0,0
for i in range(len(S)):
if S[i] in acgt:
count+=1
ans=max(ans,count)
else:
count=0
print(ans) |
p03086 | s378573890 | Accepted | S = input()
ACGT = ['A', 'C', 'G', 'T']
count = 0
max_count = 0
for s in S:
if s in ACGT:
count += 1
else:
max_count = max(max_count, count)
count = 0
max_count = max(max_count, count)
print(max_count) |
p03086 | s872956127 | Accepted | s = input()
acgt = set({'A','C','G','T'})
s = s + 'Z' #dummy
ans = [-1]*(len(s))
def dfs(i):
if ans[i] != -1:
return ans[i]
elif s[i] not in acgt:
ans[i] = 0
return 0
else:
ans[i] = dfs(i+1) + 1
return ans[i]
for i in range(len(s)):
dfs(i)
print(max(ans)) |
p03086 | s510755696 | Accepted | s=input()
n=len(s)
list=['A','C','G','T']
ans=[]
for i in range(n):
k=0
while i+k<=n-1:
if all(a in list for a in s[i:i+k+1]):
ans.append(k+1)
k+=1
if len(ans)==0:
print(0)
else:
print(max(ans)) |
p03086 | s285459205 | Accepted | #ABC122B - ATCoder
s = str(input())
size = len(s)
ans = 0
for i in range (0,size):
for j in range (i,size+1):
hantei = s[i:j]
countA = hantei.count('A')
countC = hantei.count('C')
countG = hantei.count('G')
countT = hantei.count('T')
if (len(hantei) == countA + countC... |
p03086 | s684063036 | Accepted | def solve():
s = input()
ans = ''
for i in range(len(s)+1):
for j in range(i+1, len(s)+1):
if s[i:j].replace('A', '').replace('C', '').replace('G', '').replace('T', '') == '':
if len(ans) < len(s[i:j]):
ans = s[i:j]
print(len(ans))
if __name__ ==... |
p03086 | s298040587 | Accepted | #122_B
S=input()
Ans=0
cnt=0
for s in S:
if s in 'ATCG':
cnt+=1
else:
Ans=max(Ans,cnt)
cnt=0
Ans=max(Ans,cnt)
print(Ans) |
p03086 | s698953480 | Accepted | icase=0
if icase==0:
s=list(input())
acgt={"A","C","G","T"}
sc=[0]*len(s)
if s[0] in acgt:
sc[0]=1
for i in range(1,len(s)):
if s[i] in acgt:
sc[i]=sc[i-1]+1
print(max(sc))
|
p03086 | s574225080 | Accepted | s = input()
ans = 0
m = 0
for S in s:
if S in "A":
ans += 1
elif S in "G":
ans += 1
elif S in "T":
ans += 1
elif S in "C":
ans += 1
else:
ans = 0
m = max(m,ans)
print(m) |
p03086 | s061472371 | Accepted | import re
S = re.findall('[ACGT]*', input())
print(max([len(s) for s in S])) |
p03086 | s628566934 | Accepted | S=str(input())
S=S.translate(str.maketrans({'A': 'a', 'T': 'a', 'C': 'a','G': 'a'}))
if "a" in S:
l=len(S)
for i in range(1,l+1):
b=S.count(str("a"*i))
if b == 0:
print(i-1)
break
if i==l:
print(l)
else:
print("0") |
p03086 | s956167530 | Accepted | #conding utf-8
S=input()
ATGC=["A","T","G","C"]
ans=0
tmp=0
for i in range(len(S)):
if S[i:i+1] in ATGC:
tmp +=1
else:
tmp=0
if ans<tmp:
ans=tmp
print(ans) |
p03086 | s595340369 | Accepted | S=input()
ACGT=[0]
count=0
for i in range(len(S)):
if (S[i]=="A")|(S[i]=="C")|(S[i]=="G")|(S[i]=="T"):
count+=1
else:
ACGT.append(count)
count=0
ACGT.append(count)
print(max(ACGT)) |
p03086 | s080823285 | Accepted | s = input()
acgt = 'ACGT'
acgt_flag = False
length = 0
l = 0
for i in range(len(s)):
if s[i] in acgt:
if acgt_flag:
l+=1
else:
l=1
acgt_flag = True
else:
if acgt_flag:
length = max(length, l)
acgt_flag = False
length = max(length, l)
print(length) |
p03086 | s257804985 | Accepted | S = input()
ans = 0
long= 0
ACGT = ['A','C','G','T']
for s in S:
if s in ACGT:
long += 1
ans = max(ans,long)
else:
long = 0
print(ans) |
p03086 | s015111104 | Accepted | S = list(input())
L = ['A','C','G','T']
c = 0
ans = 0
for i in S:
if i in L:
c += 1
ans = max(ans,c)
else:
c = 0
print(ans)
|
p03086 | s752523811 | Accepted | s = input()
ACGT = "ACGT"
cnt = 0
ans = 0
for i in s:
if i in ACGT:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(max(ans, cnt)) |
p03086 | s374583842 | Accepted | import bisect,collections,copy,heapq,itertools,math,string
import sys
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()
cnt = 0
max_r... |
p03086 | s270063546 | Accepted | s = list(input())
n = len(s)
def atcg(s):
slength = len(s)
cnt = 0
for i in range(slength):
if s[i] == 'A' or s[i] == 'T' or s[i] == 'C' or s[i] == 'G':
cnt +=1
else:
break
return cnt
ans = []
for i in range(n):
ans.append(atcg(s[i:]))
print(max(ans)) |
p03086 | s495459545 | 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_
len_ = 0
if len_ > ans:
ans = len_
print(ans)
|
p03086 | s466354294 | Accepted | S = input()
acgt = ['A', 'C', 'G', 'T']
flag = False
best = 0
a = 0
for s in S:
if s in acgt:
if flag:
a += 1
else:
a = 1
flag = True
if a > best:
best = a
else:
if flag:
flag = False
print(best)
|
p03086 | s055277270 | Accepted | import re
s = input()
l = [len(s) for s in re.findall(r'[ACGT]+', s)]
print(0 if len(l) == 0 else max(l))
|
p03086 | s574034829 | Accepted | s = str(input())
s += "B"
l = len(s)
c = 0
mx = 0
for i in range(l):
if s[i] in ["A","G","C","T"]:
c += 1
else:
if c > mx:
mx = c
c = 0
else:
c = 0
print(mx)
|
p03086 | s542966962 | Accepted | s = input()
SENT = ('A','T','G','C')
ans = 0
count = 0
for c in s:
if c in SENT:
count += 1
else:
ans = max(ans,count)
count = 0
else:
ans = max(ans,count)
print(ans)
|
p03086 | s944326080 | Accepted | import re
S = input()
match = re.findall("[ACGT]*", S)
print(max(map(len, match))) |
p03086 | s811603531 | Accepted | input = input()
num = 0
max = 0
for j in range(len(input)):
i = input[j]
if i == "A" or i == "T" or i == "C" or i == "G":
num += 1
max = num if num > max else max
else:
num = 0
print(max) |
p03086 | s185341286 | Accepted | S = input()
n = len(S)
flag = 0
for i in reversed(range(0,n+1)):
for j in range(0,n-i+1):
s = S[j:j+i].replace("A", "").replace("C", "").replace("G","").replace("T","")
#print("+", s, "+", len(s))
if len(s) == 0:
flag=1
break
if flag==1:
break
print(i) |
p03086 | s189560033 | Accepted | from itertools import combinations
import sys
def get_ngram(n, s):
return [''.join(s[i:i+n]) for i in range(len(s)-n+1)]
def main():
S = input()
chars = {'A', 'C', 'G', 'T'}
for i in range(len(S), -1, -1):
for c in get_ngram(i, S):
if set(c) <= chars:
print(i)
... |
p03086 | s724945920 | Accepted | S = input()
ans = 0
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:
cnt = 0
ans = max(ans, cnt)
print(ans) |
p03086 | s851433373 | Accepted | l = ["A","T","G","C"]
cnt = []
s = input()
c = 0
flag = 0
for i in range(len(s)):
if s[i] not in l:
cnt.append(c)
c = 0
else:
c += 1
cnt.append(c)
print(max(cnt)) |
p03086 | s277296269 | Accepted | import copy
S = list(input())
tmp = 0
count = 0
for s in S:
if s == 'A' or s == 'C' or s == 'G' or s == 'T':
tmp += 1
if count < tmp:
count = copy.copy(tmp)
else:
tmp = 0
print(count)
|
p03086 | s711425187 | Accepted | s = list(input())
s.append(" ")
current = 0
ans = 0
for i in range(len(s)):
if s[i] not in "ACGT":
ans = max(ans, i-current)
current = i+1
print(ans)
|
p03086 | s339363390 | Accepted | S=input()
L=["A","C","G","T"]
cnt=0
ans=0
for i in range(len(S)):
if S[i] in L:
cnt+=1
ans=max(ans,cnt)
else:
cnt=0
print(ans) |
p03086 | s960467067 | Accepted | n = input()
cnt = 0
ans = 0
for i in range(len(n)):
if n[i] in "ACGT":
cnt += 1
if ans <= cnt:
ans = cnt
else:
cnt = 0
print(ans) |
p03086 | s837190913 | Accepted | S = input()
valid = ['A', 'T', 'C', 'G']
count = 0
max_len = 0
for i in range(len(S)):
for j in range(i, len(S)):
if S[j] in valid:
count += 1
else:
break
if count > max_len:
max_len = count
count = 0
print(max_len)
|
p03086 | s174841558 | Accepted | s = list(input())
N = len(s)
ref = ["A","C","G","T"]
lst = []
for i in range(N):
ans = ""
if s[i] in ref:
while s[i] in ref:
ans = ans + s[i]
i += 1
if i >= N:
break
lst.append(ans)
ans = -float("inf")
for i in range(N):
ans = max(ans, len(l... |
p03086 | s509038777 | Accepted | s = input()
n = len(s)
acgt = "ACGT"
cnt = 0
flag = 0
ans = 0
for i in range(n):
if s[i] in acgt:
cnt += 1
ans = max(ans,cnt)
else:
cnt = 0
print(ans) |
p03086 | s494822914 | Accepted | s=list(input())
n=len(s)
ans=[]
if n==1:
if s.pop() in list('ATCG'):
print(1)
exit()
for i in range(n-1):
for j in range(i+1,n+1):
part=set(s[i:j])
flag=True
for p in part:
if p not in list('ATGC'):
flag=False
break
if flag==True:
ans.append(len(s[i:j]))
#print(a... |
p03086 | s532374977 | Accepted | s=list(input())
d=["A","G","C","T"]
a=[]
b=[]
x=[]
for i in range(len(s)):
a.append(s[i:])
for j in a:
for k in range(len(j)-1):
b.append(j[:-k-1])
ans=a+b
for i in ans:
if set(i) <= set(d):
x.append(len(i))
else:
pass
if x:
print(max(x))
else:
print(0) |
p03086 | s574010555 | 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 | s848964626 | Accepted | S = list(input())
ans, p = 0, ""
for s in S:
if s in ["A", "C", "G", "T"]:
p += s
else:
p = ""
ans = max(ans, len(p))
print(ans) |
p03086 | s039309809 | Accepted | s = input()
ACGT = 'ACGT'
ans = 0
cnt = 0
for i in s:
if i in ACGT:
cnt += 1
else:
ans = max(ans,cnt)
cnt = 0
print(max(ans,cnt))
|
p03086 | s548474420 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
def resolve():
S = input()
acgt = ('A', 'C', 'G', 'T')
ans = 0
l = 0
while (l < len(S)) and (len(S)-l > ans):
r = l+1
while (r < len(S)+1) and (S[r-1] in acgt):
r += 1
ans = max(r-1-l, ans)
l += 1
... |
p03086 | s390411912 | Accepted | S = str(input())
cnt=0
max=0
for i in range(len(S)):
if S[i] in ['A','C','G','T']:
cnt+=1
else:
if cnt>max:
max=cnt
cnt=0
if cnt>max:
max=cnt
print(max) |
p03086 | s822691891 | Accepted | s = input()
res, ans = 0, 0
for i in s:
if i in ["A", "C", "G", "T"]:
res += 1
else:
ans = max(res, ans)
res = 0
ans = max(res, ans)
print(ans) |
p03086 | s088210442 | Accepted | S = list(input())
ans = 0
n_ans = 0
for i in range(len(S)):
if(S[i]=='A' or S[i]=='C' or S[i]=='G' or S[i]=='T'):
n_ans += 1
else:
ans = max(ans, n_ans)
n_ans = 0
ans = max(ans, n_ans)
print(ans) |
p03086 | s159564750 | Accepted | #ABC122
s = input()
d = ["A","T","G","C"]
l = []
count = 0
for i in range(len(s)):
if s[i] not in d:
l.append(count)
count = 0
else:
count += 1
#print(count)
l.append(count)
print(max(l)) |
p03086 | s639895384 | Accepted | S = input()
cnt = 0
ans = 0
for s in S:
if s in 'ACGT':
cnt += 1
ans = max(ans, cnt)
else:
cnt = 0
print(ans)
|
p03086 | s967834001 | 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 | s685675164 | Accepted | import sys
input=sys.stdin.readline
def main():
s = input()
cnt = 0
trial = 0
for i in s: # 本当に全通りO（n^2）やらなくても最長の部分がわかれば良い
if i in "ACGT":
trial += 1
else:
cnt = max(cnt, trial)
trial = 0
print(cnt)
if __name__=="__main__":
main()
|
p03086 | s244265092 | 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 | s098054182 | Accepted | import sys
import math
stdin = sys.stdin
mod = 10**9 + 7
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]
s = ns()
ans = 0
c = 0
acgt = ["A", "C", "G", "T"]
for si in s:
i... |
p03086 | s138452582 | Accepted | S = input()
ACGT = 'ACGT'
count = []
tmp_num = 0
for i in S:
if i in ACGT:
tmp_num += 1
elif i not in ACGT:
count.append(tmp_num)
tmp_num = 0
count.append(tmp_num)
print(max(count)) |
p03086 | s951755627 | Accepted | s=input()
count=0
a_list=[]
b_list=["A", "C", "G", "T"]
num=len(s)
for i in range(num):
if s[i] in b_list:
count+=1
else:
a_list.append(count)
count=0
a_list.append(count)
print(max(a_list)) |
p03086 | s122192031 | Accepted | ans=0;now=0
for i in list(input()):
if i in {"A","G","C","T"}:now+=1
elif now:ans=max(now,ans);now=0
print(max(now,ans)) |
p03086 | s667905779 | Accepted |
import math
import itertools
import statistics
#import collections
#x = int(input())
#k, n = (map(int, input().split()))
#A= (map(int, input().split()))
#x個の赤りんごp y緑りんごq c個無色r
#n = list(map(int, input().split()))
s = input()
max_ = 0
count = 0
for i in range(len(s)):
if s[i] in ("A", "T", "C", "G"):
cou... |
p03086 | s934080828 | Accepted | def atcoder(s):
ans = 0
count = 0
acgt = ["A", "C", "G", "T"]
for i in s:
if i in acgt:
count += 1
else:
count = 0
ans = max(ans, count)
return ans
def main():
s = list(str(input()))
print(atcoder(s))
if __name__ == '__main__':
main() |
p03086 | s265297402 | Accepted | s = input()
acgt = ["A", "C", "G", "T"]
max_len = 0
cnt = 0
for i in s:
if i in acgt:
cnt += 1
if max_len < cnt:
max_len = cnt
else:
cnt = 0
print(max_len)
|
p03086 | s234953060 | Accepted | S = input()
result = 0
streak = 0
for s in S:
if s == 'A' or s == 'T' or s == 'G' or s == 'C':
streak += 1
else:
result = max(streak, result)
streak = 0
result = max(streak, result)
print(result) |
p03086 | s295314081 | Accepted | S=input()
N=len(S)
ans=0
for i in range(N):
for j in range(i,N):
if all('ATGC'.count(c) for c in S[i:j+1]):
ans=max(ans,j-i+1)
print(ans)
|
p03086 | s742546597 | Accepted | S = input()
res = []
tmp = []
for s in S:
if s == 'A' or s == 'C' or s == 'G' or s == 'T':
tmp.append(s)
else:
res.append(len(tmp))
tmp = []
res.append(len(tmp))
print(max(res))
|
p03086 | s552395226 | Accepted | S=list(input())
n=len(S)
ans=0
ansl=[0]
for i in range(n):
if S[i]=="A" or S[i]=="C" or S[i]=="G" or S[i]=="T":
ans+=1
else:
ans=0
ansl.append(ans)
ansl.sort(key=int)
print(ansl[n]) |
p03086 | s109673720 | Accepted | s=input()
n=len(s)
res=0
for i in range(n):
if s[i]=='A' or s[i]=='C' or s[i]=='G' or s[i]=='T':
ans=1
j=i+1
while j<n:
if s[j]=='A' or s[j]=='C' or s[j]=='G' or s[j]=='T':
ans+=1
j+=1
else:
break
else:
continue
res=max(res,ans)
print(res) |
p03086 | s193307251 | Accepted | S = input()
max_len = 0
cnt = 0
acgt = ['A', 'C', 'G', 'T']
for i in range(len(S)):
if S[i] in acgt:
cnt += 1
if max_len < cnt:
max_len = cnt
else:
cnt = 0
print(max_len)
|
p03086 | s448057928 | Accepted | s = input()
count = 0
result = 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:
if result < count:
result = count
count =0
if result < count:
result = count
print(result)
|
p03086 | s826591190 | Accepted | S = input()
L = len(S)
ACGT = ['A', 'C', 'G', 'T']
ans = 0
for i in range(L):
for j in range(i, L):
sub_S = S[i:j+1]
if all([s in ACGT for s in sub_S]):
if len(sub_S) > ans:
ans = len(sub_S)
print(ans)
|
p03086 | s160031225 | Accepted | s = list(input())
n = len(s)
count = 0
maxcount = 0
for i in range(n):
if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":
count += 1
maxcount = max(maxcount,count)
else:
count = 0
print(maxcount) |
p03086 | s593216218 | Accepted | def all_part_string(s):
r = range(len(s))
return [s[i:j+1] for i in r for j in r if s[i:j+1] != '']
def contains_only(s, l):
return False if [a for a in [e for e in s if e not in l] if a != ''] else True
if __name__ == '__main__':
s = input()
ss = all_part_string(s)
o = [e for e in ss if conta... |
p03086 | s872766919 | Accepted | S = input()
N = len(S)
ACGT = {"A", "C", "G", "T"}
ans = 0
for i in range(N):
if S[i] in ACGT:
cnt = 0
for j in range(i, N):
if S[j] in ACGT:
cnt += 1
else:
break
ans = max(ans, cnt)
print(ans) |
p03086 | s731890061 | Accepted | N = list(input())
m = 0
cnt = 0
for x in N:
if x == 'A' or x == 'C' or x == 'G' or x == 'T':
cnt += 1
else:
m = max(cnt, m)
cnt = 0
m = max(cnt, m)
print(m) |
p03086 | s128779243 | Accepted | S = list(input())
count = 0
ans = 0
flg = False
for word in S:
if word=="A" or word=="C" or word=="G" or word=="T":
flg = True
else:
flg=False
count = 0
if flg:
count += 1
ans = max(ans,count)
print(ans) |
p03086 | s754511133 | Accepted | s = input()
left = 0
ans = 0
for right in range(0,len(s)):
if s[right] == "A" or s[right]== "C"or s[right]== "T"or s[right]=="G":
pass
else:
left=right+1
ans = max(ans,right-left+1)
print(ans) |
p03086 | s303052522 | Accepted | S = input()
l = []
ans = ("A", "C", "G", "T")
A = 0
flag = False
for i in range(len(S)):
for j in range(i+1, len(S)+1):
l.append(S[i:j])
for i in range(len(l)):
for c in l[i]:
if c not in ans:
flag = True
break
if flag:
flag = False
continue
... |
p03086 | s734274498 | Accepted | import re
m = re.findall(r'[ATCG]+', input())
if m:
print(max([len(x) for x in m]))
else:
print('0')
|
p03086 | s409000678 | Accepted | S = input()
acgt = ('A', 'C', 'G', 'T')
right = 0
res = -1
for left in range(len(S)):
while right < len(S) and S[right] in acgt:
right += 1
res = max(res, right - left)
if left == right:
right += 1
print(res)
|
p03086 | s779333691 | Accepted | """abc122_b"""
S = input()
CNT = 0
ANS = [0]
for s in S:
if s in "ACTG":
CNT += 1
elif CNT != 0:
ANS.append(CNT)
CNT = 0
ANS.append(CNT)
print(max(ANS))
|
p03086 | s409417333 | Accepted | def main():
#n = int(input())
s = input()
#s = input().split()
#a,b = list(map(int,input().split()))
#a = [input() for i in range(n)]
#a = [int(input()) for i in range(n)]
#a = [input().split() for i in range(n)]
#a = [list(map(int,input().split())) for i in range(n)]
ans = 0
count = 0
lis = []
... |
p03086 | s962589155 | Accepted | S=input()
# ACGT
lis=[]
for x in range(len(S)):
alt=len(S)-x
for y in range(alt):
y=len(S)-y
ts=S[x:y]
ca=ts.count('A')
cg=ts.count('G')
cc=ts.count('C')
ct=ts.count('T')
if len(ts)==ca+cg+cc+ct:
lis.append(len(ts))
if lis !=[]:
print(max(lis))
else:
print(0) |
p03086 | s157768158 | Accepted | s = input()
list_s = list(s)
k = 0
ans = []
for i in range(len(list_s)):
c = list_s[i]
if c == "A" or c == "C" or c == "G" or c == "T":
k += 1
else:
ans.append(k)
k = 0
if k != 0:
ans.append(k)
print(max(ans)) |
p03086 | s491800810 | Accepted | s = input()
S = ""
for i in s:
if i in "ACGT":
S+="1"
else:
S+="0"
ans = max(list(map(len,S.split("0"))))
print(ans) |
p03086 | s986167030 | Accepted | S = str(input())
m=0
point=0
for i in S:
if i == "A" or i == "G" or i == "C" or i == "T":
point+=1
else:
point*=0
m = max(m, point)
print(m) |
p03086 | s128445618 | Accepted | import re
print(max(map(len, re.split('[^ACGT]', input())))) |
p03086 | s086907036 | Accepted | s=input()
Flag=True
cnt=0
ans=0
for i in range(len(s)):
if s[i] in 'ACGT':
cnt+=1
else:
ans=max(ans,cnt)
cnt=0
ans=max(ans,cnt)
print(ans) |
p03086 | s959235762 | Accepted | import re
print(len(max(re.split('[^ACGT]',input()),key=len))) |
p03086 | s405200432 | Accepted | S=input()
ans=0
tmp=0
for i in range(len(S)):
if S[i]=="A" or S[i]=="C" or S[i]=="G" or S[i]=="T":
tmp+=1
else:
ans=max(ans,tmp)
tmp=0
ans=max(ans,tmp)
print(ans)
|
p03086 | s674379690 | Accepted | import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
input = lines.pop(0)
acgt = tuple("ACGT")
max_num_list = []
max_num = 0
for c in input:
if c in acgt:
max_num += 1
else:
max_num_list.append(max_num)
max_num = 0
max_num_list.append(max_num)
print(max(max_num_list))
|
p03086 | s285738223 | Accepted | s = input()
ans = 0
g = 0
for i in range(len(s)):
if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":
g += 1
if g > ans:
ans = g
else:
g = 0;
print(ans) |
p03086 | s245624385 | Accepted | S = input()
res = 0
counts=0
for i in range(len(S)):
if S[i] in "ACGT":
counts+=1
else:
res=max(res,counts)
counts=0
print(max(res,counts)) |
p03086 | s384298687 | Accepted | import sys
input = sys.stdin.buffer.readline
input = sys.stdin.readline
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
def main():
ACGT="ACGT"
s=input()
ans=0
cnt=0
for i ... |
p03086 | s283681773 | Accepted | S = input()
ans = 0
ACGT = ["A","C","G","T"]
for i in range(len(S)):
for j in range(i,len(S)+1):
clipped_list = list(S[i:j])
clipped = set(clipped_list)
for acgt in ACGT:
try:
clipped.remove(acgt)
except:
pass
if clipped == set(... |
p03086 | s044308156 | Accepted | N = input()
ACGT = ["A", "C", "G", "T"]
ans = [0]
count = 0
for n in N:
if n in ACGT:
count += 1
else:
ans.append(count)
count = 0
ans.append(count)
print(max(ans)) |
p03086 | s751673731 | Accepted | S = input()
cnt = 0
tmp = 0
for i in S:
if i in ['A', 'C', 'G', 'T']:
tmp+=1
elif cnt < tmp:
cnt = tmp
tmp = 0
if cnt < tmp:
print(tmp)
else:
print(cnt) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.