problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s779211105 | Accepted | #ABC122B
def main():
import sys
S = sys.stdin.readline().rstrip()
#print(S)
cnt = 0
ans = 0
for s in S:
if s in ['A', 'G', 'C', 'T']:
cnt +=1
else:
ans = max(ans, cnt)
cnt=0
ans = max(ans, cnt)
print(ans)
... |
p03086 | s380194664 | Accepted | ATGC=['A', 'T', 'G', 'C']
S=input()
N=len(S)
maxlen=0
count=0
for i in range(N):
if S[i] in ATGC:
count+=1
else:
count=0
if count>maxlen:
maxlen=count
print(maxlen) |
p03086 | s356001043 | Accepted | S=input()
count=0
ans=0
for s in S:
if s in "ACGT":
count+=1
ans=max(ans,count)
else:
count=0
print(ans) |
p03086 | s389611030 | Accepted | S=input()
ans=0
for i in range(len(S)):
cnt=0
while True:
if i>=len(S):
break
elif S[i] not in ["A","C","G","T"]:
break
else:
cnt+=1
i+=1
if cnt>ans:
ans=cnt
print(ans) |
p03086 | s733824051 | Accepted | # abc122_b.py
s = input()
ans = 0
cnt = 0
for i in s:
if i == "A" or i=="T" or i=="G" or i=="C" :
cnt+=1
else:
if ans<cnt:
ans=cnt
cnt=0
if ans<cnt:
ans=cnt
print(ans) |
p03086 | s557489160 | Accepted | S=list(input())
A=[0]*10
c=0
for i in range(len(S)):
if S[i]=="A" or S[i]=="G" or S[i]=="C" or S[i]=="T":
A[c]+=1
else:
c+=1
print(max(A))
|
p03086 | s616825196 | Accepted |
import re
S = input()
pattern = "[A|T|G|C]+"
match_result = re.findall(pattern, S)
ans = 0
for word in match_result:
if ans <= len(word): ans = len(word)
print(ans) |
p03086 | s406127918 | Accepted | S = input()
N = len(S)
ans = [0]
x = 0
for i in range(N):
s = S[i]
if s == 'A' or s == 'C' or s == 'G' or s == 'T':
x += 1
if i == N -1:
ans.append(x)
else:
if x != 0:
ans.append(x)
x = 0
print(max(ans))
|
p03086 | s969447893 | Accepted | import sys
S = list(input())
X = ["A","C","G","T"]
max_len = 0
cur = 0
for i in S:
if i in X: cur += 1
else:
if cur> max_len:
max_len = 0
max_len +=cur
cur = 0
else:
cur = 0
if cur > max_len:
print(cur)
sys.exit()
print(max_len) |
p03086 | s107154776 | Accepted | s = list(input())
now = 0
ans = 0
for i in range(len(s)):
if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":
now += 1
if ans < now:
ans = now
else:
now = 0
print(ans) |
p03086 | s486781278 | Accepted | s = input()
ans, sum = 0, 0
for i in range(len(s)):
cur = s[i]
if (cur == 'A' or cur == 'T' or cur == 'G' or cur == 'C'):
sum += 1
else: sum = 0
ans = max(ans, sum)
print(ans)
|
p03086 | s435587480 | Accepted | S = input()
ans = 0
l = ["A", "T", "C", "G"]
length = len(S)
for i in range(length):
if S[i] in l:
temp = 1
for j in range(i + 1, length):
if S[j] in l:
temp += 1
else:
break
ans = max(temp, ans)
print(ans) |
p03086 | s192870899 | Accepted | S = input().rstrip()
P = {"A", "C", "G", "T"}
cnt = 0
res = 0
for s in S:
if s in P:
cnt += 1
res = max(cnt, res)
else:
cnt = 0
print(res) |
p03086 | s185883194 | Accepted | import re;print(max(len(i)for i in re.split('[^ACTG]',input()))) |
p03086 | s623862266 | Accepted | S = input()
ans = 0
cnt = 0
acgt = ['A','C','G','T']
for c in S:
if c in acgt:
cnt += 1
else:
if cnt > ans:
ans = cnt
cnt = 0
if cnt > ans:
ans = cnt
print(ans) |
p03086 | s498978689 | Accepted | import sys
input=sys.stdin.readline
def main():
s = input()
len_s = len(s)
cnt = 0
for i in range(len_s):
trial = 0
for k in range(i,len_s):
if s[k] in "ACGT":
trial += 1
else:
cnt = max(cnt,trial)
break
print(c... |
p03086 | s006755314 | Accepted | import sys
import numpy as np
import numba
from numba import jit
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
@jit
def main(s):
ans = 0
for j, i in enumerate(s):
if i=='A' or i=='C' or i=='G' or i=='T':
cnt = 1
j += 1
while s[j]=='A... |
p03086 | s265954880 | Accepted | S = input()
n = len(S)
ans = 0
list = ['A', 'G', 'C', 'T']
for i in range(n):
j = i
while j < n:
if S[j] in list:
j += 1
else:
if ans < j - i :
ans = j - i
break
if j == n:
if ans < j - i :
ans = j - i
print(ans) |
p03086 | s075007252 | Accepted | S = input()
l = len(S)
max_cnt = 0
for i in range(l):
for j in range(i, l):
res = [1 if s == "A" or s == "C" or s == "G" or s == "T" else 0 for s in S[i : j + 1]]
if sum(res) == len(res):
max_cnt = max(sum(res), max_cnt)
print(max_cnt) |
p03086 | s080960623 | Accepted | s = input()
count = 0
ans = 0
for i in range(len(s)):
if s[i] in "ACGT":
count += 1
ans = max(ans,count)
else:
count = 0
print(ans)
|
p03086 | s123275155 | Accepted | s = str(input())
ACGT = {"A", "C", "G", "T"}
ans = 0
for i in range(len(s)):
for j in range(i, len(s) + 1):
t = s[i: j]
for k in t:
if k not in ACGT:
break
else:
ans = max(ans, len(t))
print(ans)
|
p03086 | s879350839 | Accepted | import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
s = input()
chk_str = ""
chk = 0
for i in range(len(s)):
if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":
... |
p03086 | s234190767 | Accepted | a = list(input())
c = 0
m = 0
for x in a:
if x in ["A", "C", "G", "T"]:
c += 1
else:
m = max(m, c)
c = 0
print(max(m, c)) |
p03086 | s104188583 | Accepted | s = list(input())
acgt = ['A', 'C', 'G', 'T']
cnt = 0
ans = 0
for i in s:
if i in acgt:
cnt += 1
else:
cnt = 0
ans = max(cnt, ans)
print(ans)
|
p03086 | s248887623 | Accepted | ln = input()
output = ''
a = ''
for i in ln:
if i == 'A' or i == 'T' or i == 'C' or i == 'G' :
a += i
else:
if len(output) < len(a):
output = a
a = ''
if len(output) < len(a):
output = a
a = ''
print(len(output))
|
p03086 | s499952186 | Accepted | S = input()
T = S.replace('A','1').replace('C','1').replace('G','1').replace('T','1')
a = 0
for s in range(10):
if '1'*(10-s) in T:
a=1
print(10-s)
break
if a == 0:
print('0') |
p03086 | s208858669 | Accepted | s = input()
ans, temp = 0, 0
for x in s:
if x in "ACGT":
temp += 1
else:
temp = 0
ans = max(ans, temp)
print(ans) |
p03086 | s446232466 | Accepted | s = input()
n = len(s)
res = 0
for i in range(n):
cnt = 0
for j in range(i, n):
if s[j] in "ACGT":
cnt += 1
else:
break
if cnt >= res:
res = cnt
print(res) |
p03086 | s268235879 | Accepted | import re
s = input()
m = re.findall(r'[A|T|G|C]+',s)
if len(m)==0:
print(0)
else:
print(len(max(m,key=len))) |
p03086 | s126876624 | Accepted | def main():
s = list(input())
count_list = [0] * 1
index = 0
for i in s:
if i == "A" or i == "T" or i == "G" or i == "C":
count_list[index] += 1
else:
index += 1
count_list.append(0)
ans = max(count_list)
print(ans)
if __name__ == '... |
p03086 | s636862035 | Accepted | s = input()
ans = 0
temp = 0
for c in s:
if c in 'ATCG':
temp += 1
ans = max(ans, temp)
else:
temp = 0
print(ans) |
p03086 | s502786958 | Accepted | s = input()
ans = 0
for l in range (len(s)):
for r in range(l+1, len(s)+1):
cnt = 0
for str in s[l:r]:
if str not in ['A','C','G','T']:
cnt = 0
break
else:
cnt += 1
ans = max(ans, cnt)
print(ans)
|
p03086 | s014583960 | Accepted | ACGT = ["A", "C" ,"G", "T"]
s = input()
ans = 0
temp = 0
for i in s:
ok = False
for j in ACGT:
if i == j:
ok = True
temp += 1
if ok == False:
ans = max(ans, temp)
temp = 0
ans = max(ans, temp)
print(ans) |
p03086 | s548354346 | Accepted | s=input()
ans=''
lis=[]
for i in s:
if i in 'ATGC':
ans += i
if i == s[-1]:
lis.append(len(ans))
else:
lis.append(len(ans))
ans=''
print((max(lis))) |
p03086 | s108920545 | Accepted | S = list(input())
Max = 0
count = 0
for i in range(len(S)):
if S[i]=="A" or S[i]=="T" or S[i]=="C" or S[i]=="G":
count+=1
if count>Max:
Max=count
else:
count=0
print(Max) |
p03086 | s514834417 | Accepted | # -*- coding: utf-8 -*-
# 標準入力を取得
S = input()
# 求解処理
ACGT = ["A", "C", "G", "T"]
ans = 0
N = len(S)
for i in range(N):
for j in range(i, N):
if all([S[k] in ACGT for k in range(i, j + 1)]):
ans = max(ans, j - i + 1)
# 結果出力
print(ans) |
p03086 | s117656933 | Accepted | S = input()
res = 0
cur = 0
N = len(S)
ACGT = ["A", "C", "G", "T"]
for i in range(N):
if S[i] in ACGT:
cur += 1
else:
cur = 0
if cur > res:
res = cur
print(res)
|
p03086 | s725329480 | Accepted | S=input()
l=len(S)
ans=0
str='ACGT'
for i in range(l):
for j in range(i,l):
if all (str.count(x)==1 for x in S[i:j+1]):
ans=max(ans,j-i+1)
print(ans) |
p03086 | s492045880 | Accepted | count = 0
ans = 0
s = input()
for i in range(len(s)):
if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':
if i != len(s)-1:
count += 1
else:
count += 1
ans = max(ans,count)
else:
ans = max(ans,count)
count = 0
print(ans) |
p03086 | s725671705 | Accepted | S=input()
ans=[]
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:
ans.append(count)
count=0
ans.append(count)
print(max(ans)) |
p03086 | s568239838 | Accepted | string_data = list(input())
N = len(string_data)
match_word_lits = ['A', 'C', 'G', 'T']
count = 0
max_word = 0
for i in range(N):
if string_data[i] in match_word_lits:
count += 1
if max_word < count:
max_word = count
else:
count = 0
print(max_word) |
p03086 | s095869593 | Accepted | S=input()
T='ATCG'
flag =0
ans =0
for i in range(len(S)):
flag =0
for j in range(i,len(S)):
if S[j] == 'A' or S[j] == 'G' or S[j] == 'T' or S[j] == 'C':
flag +=1
ans = max(ans,flag)
else:
break
print(ans) |
p03086 | s323910515 | Accepted | s = list(input())
cnt = 0
ans = 0
check = ["A", "C", "G", "T"]
for i in range(len(s)):
if s[i] in check:
cnt += 1
ans = max(cnt, ans)
else:
cnt = 0
print(ans) |
p03086 | s565422644 | Accepted | S = input()
ACGT = ["A","C","G","T"]
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)
elif S[i] not in ACGT:
ans_lis.append(ans)
ans = 0
print(max(ans_lis)) |
p03086 | s236899278 | Accepted | s = input()
count = 0
ans = 0
for i in s:
if i in'AGCT':
count += 1
ans = max(ans, count)
else:
count = 0
print(ans)
|
p03086 | s888697814 | Accepted | S = list(input())
def atgc(s):
if s == "A" or s == "T" or s == "G" or s == "C":
return True
else:
return False
c = 0
nax = 0
for i in range(len(S)):
if atgc(S[i]):
c += 1
if i == len(S)-1:
nax = max(nax,c)
else:
nax = max(nax,c)
c = 0
print(nax... |
p03086 | s428926730 | Accepted | s = input()
count = 0
count_list = [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_list.append(count)
count = 0
count_list.append(count)
print(max(count_list)) |
p03086 | s339424290 | Accepted | S = input()
A = 0
B = 0
for i in S:
if "AGTC".count(i) == 1:
B += 1
else:
A = max(A,B)
B = 0
A = max(A,B)
print(A)
|
p03086 | s936288245 | Accepted | c,m=0,0
for i in input():
if i in "AGCT":
c+=1
else:
if c > m:
m=c
c=0
if c > m:
m=c
print(m) |
p03086 | s601045075 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))
def main():
S = input()
n = len(S)
acgt = ['A', 'C', 'G', 'T']
cnt = 0
maxlen = 0
for i in range(n):
if S[i] in acgt:
cnt += 1
maxlen = max(maxlen, cnt)
... |
p03086 | s447435433 | Accepted | s=list(input())
dp = [0]*(len(s)+1)
for i in range(len(s)):
if s[i] in 'ACGT':
dp[i] += 1
dp[i+1] += dp[i]
else:
dp[i]=0
print(max(dp)) |
p03086 | s119604202 | Accepted | S = input()
listS = list(S)
N = []
dic = ['A', 'T', 'G', 'C']
count = 0
for i in range(len(listS)):
if listS[i] in dic:
count += 1
N.append(count)
else:
count = 0
N.append(count)
print(max(N)) |
p03086 | s995153013 | Accepted | ss = input()
dic = {'A': 1, 'C': 1, 'G': 1, 'T': 1}
max_s = 0
tmp = 0
for s in ss:
if s in dic.keys():
tmp += 1
else:
max_s = max(max_s, tmp)
tmp = 0
max_s = max(max_s, tmp)
print(max_s)
|
p03086 | s120442123 | Accepted | s=input()
x=0
y=0
for i in range(len(s)):
if s[i] in ['A','T','C','G']:
y+=1
x=max(x,y)
else:
y=0
print(x) |
p03086 | s266709035 | Accepted | S = input()
max_len = 0
for i in range(len(S)):
for j in range(i, len(S)+1):
tmp = S[i:j]
for t in tmp:
if t != 'A' and t != 'C' and t != 'G' and t != 'T':
break
else:
if len(tmp) >= max_len:
max_len = len(tmp)
print(max_len) |
p03086 | s936421267 | Accepted | s = input()
acgt_list = ["A", "C", "G", "T"]
ans = 0
temp = 0
for c in s:
if c in acgt_list:
temp += 1
continue
ans = temp if temp > ans else ans
temp = 0
ans = temp if temp > ans else ans
print(ans) |
p03086 | s344806268 | Accepted | a=input()
ct=[0]*10
hantei=0
ct2=0
for i in a:
if (hantei==1):
if i in'ACGT':
ct[ct2]+=1
else:
hantei=0
ct2+=1
else:
if i in 'ACGT':
ct[ct2]+=1
hantei=1
print(max(ct)) |
p03086 | s880272950 | Accepted | s = input()
ans=0
counter = 0
for c in s:
if c=='A' or c=='C' or c=='G' or c=='T':
counter+=1
else:
ans = max(ans,counter)
counter=0
ans = max(ans,counter)
print(ans)
|
p03086 | s666066083 | Accepted | S=input()
N=len(S)
ans=0
for i in range(N):
for j in range(i,N):
if all('ATCG'.count(a)==1 for a in S[i:j+1]):
ans=max(ans,j+1-i)
print(ans) |
p03086 | s616829502 | Accepted | s = input()
l,r = 0,0
ma = 0
for l in range(len(s)):
if(s[l] not in ['A','C','G','T']):continue
t = ""
for r in range(l,len(s)):
if(s[r] not in ['A','C','G','T']):break
t += s[r]
ma = max(ma,len(t))
print(ma)
|
p03086 | s855332835 | Accepted | #B
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 | s332652359 | Accepted | S = input()
N = len(S)
ans = 0
for i in range(len(S)):
for j in range(i, len(S)):
A = S[i:j]
if all('ACGT'.count(c) == 1 for c in S[i:j+1]):
ans = max(j-i+1, ans)
print(ans) |
p03086 | s834685974 | Accepted | a=[0]
for i in input():
if i in "ACGT":a+=[a[-1]+1]
else:a+=[0]
print(max(a)) |
p03086 | s051873681 | Accepted | s = input()
n = len(s)
x = [0] * n
fl = 1
if s[0] == 'A' or s[0] == 'T' or s[0] == 'C' or s[0] == 'G':
x[0] = 1
for i in range(1,n):
if s[i] == 'A' or s[i] == 'T' or s[i] == 'C' or s[i] == 'G':
x[i] = x[i-1] + 1
else:
x[i] = 0
print(max(x)) |
p03086 | s421732422 | Accepted | def main():
ans,tmp=0,0
S=input()
ACGT=list('ACGT')
for s in S:
if s in ACGT:
tmp += 1
ans = max(ans, tmp)
else:
tmp = 0
print(ans)
main() |
p03086 | s241170398 | Accepted | S = input()
l_list = ['A','C','T','G']
ans_list = str()
for i,l in enumerate(S):
if l in l_list:
ans_list += '1'
else:
ans_list += '0'
ans_list = ans_list.split('0')
print(max([len(i) for i in ans_list]))
|
p03086 | s263454237 | Accepted | s = input()
tar = ("A","C","G","T")
ans = 0
cnt = 0
for c in s:
if c in tar: cnt += 1
else:
ans = max(cnt,ans)
cnt = 0
else: ans = max(cnt,ans)
print(ans) |
p03086 | s958049895 | Accepted | s = list(input())
right = 0
ans = 0
for left in range(len(s)):
while right < len(s) and s[right] in ["A", "C", "G", "T"]:
right += 1
ans = max(ans, right - left)
right = left + 1
print(ans) |
p03086 | s222100311 | Accepted | S = input().strip()
popa = list("ACGT")
maxx = 0
counter = 0
for i in S:
if i in popa:
counter+=1
else:
maxx = max(maxx,counter)
counter = 0
maxx = max(maxx,counter)
print(maxx) |
p03086 | s012728320 | Accepted | s=input()
acgt=["A","C","G","T"]
ans=-1
cnt=0
for i in range(len(s)):
if s[i] in acgt:
cnt+=1
else:
if ans < cnt:
ans=cnt
cnt=0
if ans < cnt:
ans=cnt
print(ans) |
p03086 | s724003201 | Accepted | S=str(input())
ans=0
kotae=[]
for i in range(len(S)):
if S[i] in "ACGT":
ans+=1
kotae.append(ans)
else:
ans=0
kotae.append(ans)
print(max(kotae)) |
p03086 | s128039827 | Accepted | s = input()
ans = 0
for i in range(len(s)):
for j in range(i + 1, len(s) + 1):
cnt = 0
for k in ["A", "G", "C", "T"]:
cnt += s[i:j].count(k)
if cnt == len(s[i:j]):
ans = max(ans, cnt)
print(ans) |
p03086 | s199437047 | Accepted | s = input()
ary1 = "".join([x if x in ["A","C","G","T"] else " " for x in s]).split()
if ary1 ==[]:
print(0)
else:
print(max([len(x) for x in ary1]))
|
p03086 | s573758905 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Tue Mar 31 09:40:38 2020
@author: black
"""
S = list(input())
len = 0
ans = 0
for i in S:
if i == "A" or i == "T" or i == "C" or i == "G":
len += 1
ans = max(len, ans)
else:
len = 0
print(ans) |
p03086 | s740042301 | Accepted | S = input()
ans = 0
j = 0
for i in S:
if i == "A" or i == "C" or i == "G" or i == "T":
j += 1
if ans < j:
ans = j
else:
j = 0
print(ans) |
p03086 | s357288838 | 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
if(cnt > ans): ans = cnt
print(ans)
|
p03086 | s886227370 | Accepted |
def resolve():
S = input()
ans = 0
ACGT = {"A", "C", "G", "T",}
for i in range(len(S)):
ss = S[i:]
cnt = 0
for s in ss:
if s in ACGT:
cnt += 1
else:
break
ans = max(ans, cnt)
return print(ans)
if __name__ == "... |
p03086 | s714886585 | Accepted | s=input()
ans=0
memory=0
for i in range(len(s)):
if s[i]=="A" or s[i]=="T" or s[i]=="G" or s[i]=="C":
memory+=1
else:
ans=max(ans,memory)
memory=0
ans=max(ans,memory)
print(ans) |
p03086 | s671095817 | 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 | s762868153 | Accepted | s=input()+'Z'
ans=0
t_ans=0
for i in range(len(s)):
if s[i] in 'ATGC':
t_ans+=1
else:
ans=max(t_ans,ans)
t_ans=0
print(ans) |
p03086 | s398842768 | Accepted | def resolve():
S = input()
ansmax = 0
anstmp = 0
for i in S:
if i == "A" or i == "T" or i == "G" or i == "C":
anstmp = anstmp + 1
ansmax = max(ansmax,anstmp)
else:
ansmax = max(ansmax,anstmp)
anstmp = 0
print(ansmax)
resolve() |
p03086 | s703167453 | Accepted | s = input()
m=[]
t = 0
for i in list(s):
if i == 'A' or i == 'C' or i == 'G' or i == 'T':
t += 1
else:
t = 0
m.append(t)
print(max(m)) |
p03086 | s865979401 | Accepted | import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
s=input()
ans=0
lst=["A","C",... |
p03086 | s485288276 | Accepted | s = input()
ans = 0
for l in range(len(s)):
for r in range(l+1, len(s)+1):
substr = s[l:r]
if set(substr).issubset({"A", "C", "G", "T"}):
ans = max(ans, len(substr))
print(ans)
|
p03086 | s738216278 | Accepted | S = input()
mx = 0
count = 0
for x in S :
if x in "ATGC" :
count += 1
else :
mx = max(mx, count)
count = 0
mx = max(mx, count)
print(mx)
|
p03086 | s268582171 | Accepted | S = str(input())
count = 0
ans = 0
for i in range(len(S)):
if S[i] in "ACGT":
count += 1
ans = max(ans,count)
else:
count = 0
print(ans) |
p03086 | s790801535 | Accepted | cnt, ans = 0, 0
s = input()
for i in s:
if i in ["A", "C", "G", "T"]:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
if cnt > 0:
ans = max(ans, cnt)
print(ans) |
p03086 | s371683437 | Accepted | s=input()
l=len(s)
res=0
cnt=0
for i in range(l):
t=s[i]
if t=="A" or t=="T" or t=="C" or t=="G":
cnt+=1
else:
res=max(res,cnt)
cnt=0
res=max(res,cnt)
print(res) |
p03086 | s138231804 | Accepted | import sys
input = sys.stdin.readline
S = input().rstrip('\r\n')
ans = 0
count = 0
for s in S:
if s == 'A' or s == 'C' or s == 'G' or s == 'T':
count += 1
else:
ans = max(ans, count)
count = 0
ans = max(ans, count)
print(ans) |
p03086 | s897175648 | Accepted | s=input()
n=len(s)
List="ACGT"
count=0
ans=0
flag=0
for i in range(n):
if (List.count(s[i])>0):
count+=1
ans=max(ans,count)
else:
count=0
print(ans) |
p03086 | s902094462 | Accepted | import numpy as np
import sys
input = sys.stdin.readline
S = input()
cnt = 0
acgt = ['A','C','G','T']
x = []
for i in range(len(S)):
if S[i] in acgt:
x.append(True)
else:
x.append(False)
ans = 0
cnt = 0
for i in x:
if i :
cnt+=1
else:
ans = max(ans,cnt)
cnt =... |
p03086 | s506085007 | Accepted | import sys
input = sys.stdin.readline
def check(T, usable: set):
for t in T:
if t not in usable:
return 0
return len(T)
def main():
S = input().rstrip("\n")
usable = {"A", "C", "G", "T"}
candidates = []
for i in range(len(S)):
for j in range(i, len(S)):
... |
p03086 | s274109199 | Accepted | s = input()
n = len(s)
dna = ["A", "C", "G", "T"]
ans = 0
counter = 0
for i in range(n):
if s[i] in dna:
counter += 1
else:
ans = max(ans, counter)
counter = 0
ans = max(ans, counter)
print(ans) |
p03086 | s921201107 | Accepted | S = input()
T = set({'A', 'T', 'C', 'G'})
ans = 0
for l in range(len(S)):
for r in range(l + 1, len(S) + 1):
if set(S[l:r]) <= T:
ans = max(ans, r - l)
print(ans) |
p03086 | s256550360 | Accepted | def resolve():
s=input()
cnt=0
ans=0
for i in s:
if i in ['A','T','C','G']:
cnt+=1
ans=max(ans,cnt)
else:
cnt=0
print(ans)
resolve() |
p03086 | s713879780 | Accepted | def S(): return input()
S = S()
dp = [0]*(len(S)+1)
for i,x in enumerate(S,1):
if x in 'ACGT':
dp[i] = dp[i-1]+1
print(max(dp))
|
p03086 | s103900887 | Accepted | s = input()
d = len(s)
ans = [0] * 10
tmp = 0
for i in range(d):
if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":
ans[tmp] += 1
else:
tmp += 1
print(max(ans)) |
p03086 | s082729018 | Accepted | s=input()
ans = 0
for i in range(len(s)):
for j in range(i+1,len(s)+1):
if s[i:j].count("A")+s[i:j].count("C")+s[i:j].count("G")+s[i:j].count("T")==j-i:
ans = max(ans,j-i)
print(ans)
|
p03086 | s436583695 | Accepted | """
author : halo2halo
date : 9, Jan, 2020
"""
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
AT = {'A', 'C', 'G', 'T'}
S = list(read().decode('utf8').rstrip())
lis = [0] * len(S)
for s in range(len(S)):
if S[s] ... |
p03086 | s028145410 | 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) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.