problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s144079047 | Wrong Answer | s = input().strip()
ans = 0
rep = 0
for c in s:
if c == 'A' or c == 'G' or c == 'C' or c == 'T':
rep += 1
else:
ans = max(ans, rep)
rep = 0
print(ans)
|
p03086 | s752857628 | Wrong Answer | 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
else:
if count > res:
res = count
count = 0
return res
if __name__ == "__main__":
S = str(input())
... |
p03086 | s729198872 | Wrong Answer | S = input()
L = len(S)
ans = 0
for i in range(L-1):
c = 0
for s in S[i:]:
if s in ['A', 'C', 'G', 'T']:
c += 1
else:
break
ans = max(ans, c)
print(ans) |
p03086 | s273914856 | Wrong Answer | S = input()
max = 0
for i in range(len(S)-1):
for j in range(i+1, len(S)+1):
count = 0
print(S[i:j])
for char in S[i:j]:
if char == 'A' or char == 'C' or char == 'G' or char == 'T':
count += 1
else:
count = 0
break
... |
p03086 | s917346185 | Wrong Answer | s = input()
ans = 0
for i in range(len(s)):
for j in range(i,len(s)):
cur = s[i:j]
for val in cur:
if val not in ('A','C','G','T'):
break
else:
ans = max(ans,len(cur))
print(ans)
|
p03086 | s888935741 | Wrong Answer | S = input()
ans = 0
temp = 0
for i in range(len(S)):
if S[i] == 'A' or S[i] == 'C' or S[i] == 'G' or S[i] == 'T':
temp += 1
else:
if ans < temp:
ans = temp
temp = 0
else:
temp = 0
if temp == len(S):
ans = temp
print(ans)
|
p03086 | s514799016 | Wrong Answer | 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
counter=0
print(ans) |
p03086 | s549555340 | Wrong Answer | s = input()
ans = 0
lis = []
for a in s:
if a == "A" or a == "T" or a == "C" or a == "G":
ans += 1
else:
lis.append(ans)
ans = 0
print(lis)
|
p03086 | s267886879 | Wrong Answer | S = input()
S = list(S)
str_max = 0
#print(len(S))
for start in range(len(S)):
for end in range(start+1, len(S)):
if {"A","C","G", "T"} |set(S[start:end+1]) == {"A","C","G", "T" }:
str_max = max(str_max, -start+end+1)
print(str_max) |
p03086 | s390110053 | Wrong Answer | S=input()
l=0
for i in range(len(S)-1):
for j in range(i+1,len(S)):
s = set(S[i:j])
if s <= {'A','C','G','T'} and len(S[i:j])>l:
l = len(S[i:j])
print(l) |
p03086 | s777222018 | Wrong Answer | s=input()
temp=0
ans=0
tar="ACGT"
for ch in s:
if ch in tar:
temp+=1
else:
if ans<temp:
ans=temp
temp=0
print(ans)
|
p03086 | s441651862 | Wrong Answer | s = input()
acgt = ['A','C','G','T']
i = 0
max = 0
count = 0
while i < len(s):
if s[i] in acgt:
count+=1
else:
if count > max:
max = count
count = 0
i+=1
print(max) |
p03086 | s647823895 | Wrong Answer | s = input()
ans = 0
count = 0
for i in range(len(s)):
if s[i] in "ACGT":
count += 1
else:
ans = max(ans, count)
print(ans) |
p03086 | s190235914 | Wrong Answer | def main():
s = input()
l = ['A', 'G', 'T', 'C']
ans = 0
for j in range(len(s)):
cnt = 0
for i in range(j, len(s)):
if s[i] in l:
cnt += 1
else:
ans = max(ans, cnt)
break
print(ans)
if __name__ == '__main__':
... |
p03086 | s176449918 | Wrong Answer | l=input()
if "A" or "G" or "C" or "T" not in l:
print(0)
exit()
ans=0
num=0
for i in l:
if i=="A" or i=="G" or i=="C" or i=="T":
num+=1
else:
ans=max(num,ans)
num=0
print(ans)
|
p03086 | s823352480 | Wrong Answer | #!/usr/bin/env python3
# https://atcoder.jp/contests/abc122/tasks/abc122_b
import re
s = input()
m = re.search(r"([ACGT]+)", s)
if m:
print(len(m.group(1)))
else:
print(0)
|
p03086 | s664649405 | Wrong Answer | S = input()
RES = 0
def countACGT(s):
res = 0
res += s.count("A")
res += s.count("C")
res += s.count("G")
res += s.count("T")
return res
for i in range(len(S)+1):
for j in range(len(S)+1):
RES = max(RES,countACGT(S[i:j]))
print(RES) |
p03086 | s272153524 | Wrong Answer | s=input()
S=[s[i] for i in range(len(s))]
A={'A','C','G','T'}
B=[S[i] in A for i in range(len(S))]
max_length=0
for i in range(len(B)):
if B[i]==1:
count_length=1
count=i
while (count+1)<len(B) and B[count+1]==1:
count_length=1+count_length
count=1+count
max_length=max(max_length,count_... |
p03086 | s688203751 | Wrong Answer | S = input()
src = ["A","T","C","G"]
ok = True
ans = 0
tmp = 0
for s in S:
if s in src:
tmp += 1
ok = True
else:
ok = False
ans = max(ans, tmp)
tmp = 0
continue
print(ans) |
p03086 | s302609105 | Wrong Answer | #!/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
print(ans)
if __name__ == '__main__':
main()
|
p03086 | s253589547 | Wrong Answer | S = input()
ACTG = ["A", "C", "T", "G"]
start = 0
ans = 0
def answer(start):
count = 0
for i in range(start, len(S)):
global ans
if S[i] in ACTG:
count += 1
else:
ans = max(ans, count)
start += 1
answer(start)
break
answer(sta... |
p03086 | s604820386 | Wrong Answer | s=input()
ans = 0
for i in range(len(s)):
for j in range(i+1,len(s)):
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 | s405763913 | Wrong Answer | s=list(input())
n=len(s)
ans=[]
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(ans)
if ans:
print(max(ans))
else:
print(0) |
p03086 | s536017694 | Wrong Answer | s = list(input())
count = []
count.append(0)
x = ["A","T","G","C"]
c = 0
for i in range(len(s)):
if (s[i] in x) == True:
c += 1
else:
count.append(c)
c = 0
count.append(c)
print(count) |
p03086 | s364173765 | Wrong Answer | S = input()
AGCT = ['A', 'G', 'C', 'T']
max_cnt = 0
cnt = 0
for s in S:
if s in AGCT:
cnt += 1
else:
max_cnt = max(cnt, max_cnt)
cnt = 0
print(max_cnt) |
p03086 | s217176944 | Wrong Answer | S = input()
Max = 0
t = 0
for i in range(len(S)):
if(S[i] == 'A')or(S[i]=='C')or(S[i]=='G')or(S[i]=='T'):
k=i
while k<len(S):
if(S[k] not in ['A','C','G','T']):
ans = k-i
if(ans > Max):
Max = ans
break
k+=1
p... |
p03086 | s540859558 | Wrong Answer | ok='AGCT'
s=list(input())
cnt=0
ans=0
for si in s:
if si in ok:
cnt+=1
else:
ans = max(ans,cnt)
print(ans) |
p03086 | s988025771 | Wrong Answer | # ABC122 B - ATCoder
S=str(input())
AC = 'ATGC'
N = []
count=0
for i in range(len(S)):
if S[i] not in AC:
N.append(i)
else:
count+=1
if count == len(S):
print(count)
exit()
M = N[0]
print(N)
for j in range(len(N)-1):
M = max( N[j+1] - N[j]-1,M)
print(M)
|
p03086 | s613599838 | Wrong Answer | s=list(input())
l=[]
cnt=0
for i in s:
if i=='A' or i=='C' or i=='G' or i=='T':
cnt+=1
else:
if cnt!=0:
l.append(cnt)
cnt=0
if not l:
print('0')
else:
print(max(l)) |
p03086 | s887509281 | Wrong Answer | s = input()
code = ['A','T','G','C']
ans = 0
l = len(s)
for i in range(l):
for j in range(i+1,l):
t = s[i:j+1]
if set(t) <= set(code):
ans = max(ans,j-i+1)
print(ans) |
p03086 | s218312240 | Wrong Answer | s = input()
res = 0
cnt = 0
for i in range(len(s)):
if s[i] in 'ATGC':cnt += 1
else:
res = max(res, cnt)
cnt = 0
print(res)
|
p03086 | s571710791 | Wrong Answer | 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
else:
ansmax = max(ansmax,anstmp)
anstmp = 0
print(ansmax)
resolve() |
p03086 | s832470917 | Wrong Answer | 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
print(ans) |
p03086 | s916148452 | Wrong Answer | S = input()
ACGT = ['A','C','G','T']
anss = []
for i in range(len(S)):
tmp_s = ""
if S[i] in ACGT:
tmp_s += S[i]
for j in range(i+1,len(S)-i):
if S[j] in ACGT:
tmp_s += S[j]
else:
break
anss.append([len(tmp_s),tmp_s])
anss.sort()
print(... |
p03086 | s373117083 | Wrong Answer | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
se = {'A', 'C', 'G', 'T'}
S = sr()
cand = []
answer = []
for s in S:
if s in se:
cand.append(s)
else:
if len(cand) > len(answer):
answer = cand
... |
p03086 | s007016703 | Wrong Answer | s = list(input())
l = len(s)
a=0
for i in range(l-1):
if s[i]=='A' or s[i]=='C' or s[i]=='G' or s[i]=='T':
if s[i+1]=='A' or s[i+1]=='C' or s[i+1]=='G' or s[i+1]=='T':
a+=1
if a==0:
print(0)
else:
print(a+1) |
p03086 | s936580439 | Wrong Answer | T=input()
d=["A","T","G","C"]
ans=0
pre=0
for x in T:
if x in d:
pre+=1
else:
ans=(max(ans,pre))
pre=0
print(ans) |
p03086 | s059688254 | Wrong Answer | S = list(input())
temp = 0
ans = 0
letter = ["A", "T", "C", "G"]
for i, val in enumerate(S):
if val in letter:
temp += 1
else:
if ans < temp:
ans = temp
temp = 0
print(ans)
|
p03086 | s325749339 | Wrong Answer | def check_ACGT(S):
length = len(S)
for i in range(length):
if not(S[i] == "A" or S[i] == "G" or S[i] == "C" or S[i] == "T"):
return 0
return length
S = input()
tmp = 0
length = len(S)
for i in range(length):
for j in range(i+1, length):
tmp = max(tmp, check_ACGT(S... |
p03086 | s314202354 | Wrong Answer | s=input()
length=0
for i in range(len(s)):
for j in range(i+1,len(s)):
ans=s[i:j].replace('A','').replace('T','').replace('C','').replace('G','')
if ans=='' and len(s[i:j])>=length:
length=len(s[i:j])
print(length) |
p03086 | s743004620 | Wrong Answer | s=input()
tmp = 0
ans = -1
for i in range(len(s)):
if s[i] in {"A","G","C","T"}:
tmp += 1
else:
if ans <= tmp:
ans = tmp
tmp = 0
print(ans) |
p03086 | s650565150 | Wrong Answer | s=input()
n=int(len(s))
count=1
for i in range(n-1):
if s[i]=='A' or s[i]=='C' or s[i]=='G' or s[i]=='T':
if s[i+1]=='A' or s[i+1]=='C' or s[i+1]=='G' or s[i+1]=='T':
count+=1
if count==1:
print('0')
else:
print(count) |
p03086 | s021381898 | Wrong Answer | # 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
print(ans)
|
p03086 | s671143175 | Wrong Answer | checklist=["A","C","G","T"]
sn = list(input())
answer = 0
for i in range(len(sn)) :
if sn[i] in checklist:
count = 1
for j in range(i+1,len(sn)):
if sn[j] in checklist:
count += 1
else :
if answer < count:
answer = count
break
print(answer) |
p03086 | s429279054 | Wrong Answer | s=input()
n=len(s)
a=["A","G","C","T"]
f=0
m=0
ans=0
for i in range(n):
if f==0:
if s[i] in a:
ans+=1
f=1
elif f==1:
if s[i] in a:
ans+=1
else:
m=max(ans,m)
f=0
ans=0
print(m)
|
p03086 | s669585254 | Wrong Answer | s = input()
maxi = 0
for start in range(len(s)):
for end in range(start, len(s)):
st = s[start:end]
flag = True
for ss in st:
if ss!='A' and ss!='C' and ss!='G' and ss!='T':
flag = False
if flag:
if len(st)>maxi:
... |
p03086 | s533636624 | Wrong Answer | s = input()
ans = 0
temp = 0
for i in range(len(s)):
if s[i]=="A" or s[i]=="G"or s[i]=="T" or s[i]=="C":
temp += 1
else:
ans = max(temp, ans)
temp=0
print(ans) |
p03086 | s259115042 | Wrong Answer | S = input()
ans, cnt = 0, 0
for i in range(len(S)):
if S[i] in ["A", "T", "C", "G"]: cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s210115067 | Wrong Answer | S=input()
DNA=['A','T','C','G']
count=0
v=0
for i in range(len(S)):
if S[i] in DNA:
count+=1
else:
if v < count:
v=count
count=0
else:
count=0
print(v) |
p03086 | s422814242 | Wrong Answer | S=input()
S+="b"
print(S)
ans=0
now=0
l=[i for i in "ACGT"]
for i in range(len(S)):
if S[i] in l:
now+=1
else:
ans=max(ans,now)
now=0
print(ans) |
p03086 | s373751013 | Wrong Answer | s=input()
ans = 0
for i in range(len(s)):
for j in range(i+1,len(s)):
if s[i:j].count("A")==s[i:j].count("C")==s[i:j].count("G")==s[i:j].count("T")==0:
ans = max(ans,j-i)
print(ans)
|
p03086 | s573108478 | Wrong Answer | S=input()
cnt=0
ans=0
A=len(S)
for i in range(A):
ans=max(cnt,ans)
if S[i]=='A':
cnt+=1
elif S[i]=='C':
cnt+=1
elif S[i]=='G':
cnt+=1
elif S[i]=='T':
cnt+=1
else:
cnt=0
print(ans) |
p03086 | s105884380 | Wrong Answer | 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
else:
if cnt > ans:
ans=cnt
cnt=0
print(ans) |
p03086 | s795191867 | Wrong Answer | 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)
prin... |
p03086 | s561965579 | Wrong Answer | 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
print(ans) |
p03086 | s570353993 | Wrong Answer | s = input()
conti_cnt = 0
max_conti = 0
for i in s:
if i in ['A', 'T', 'C', 'G']:
conti_cnt += 1
else:
if max_conti < conti_cnt:
max_conti = conti_cnt
conti_cnt = 0
print(max_conti) |
p03086 | s229876513 | Wrong Answer | s = list(input())
count = 0
answer = 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 count > answer:
answer = count
count = 0
print(answer) |
p03086 | s156882334 | Wrong Answer | s = input() #sys.stdin.readlineは最後が改行
ans = 0
cnt = 0
atgc = ['A','T','G','C']
for i in range(len(s)):
if s[i] in atgc:
cnt+=1
else:
ans = max(ans,cnt)
cnt = 0
print(ans)
|
p03086 | s870949987 | Wrong Answer | S = input()
l = ['A', 'C', 'G', 'T']
start = False
counts = [0]
for i, c in enumerate(S):
if c in l:
if start == False:
start = True
count = 1
else:
count += 1
if i == len(S) - 1:
counts.append(count)
else:
if start == False:
continue
else:
start = False
counts.append(count)
coun... |
p03086 | s201208101 | Wrong Answer | s = input()
acgt = set("ACGT")
ans = 0
for i in range(len(s)):
l = 0
for j in range(i, len(s)):
print(s[j])
if s[j] in acgt:
l += 1
else:
ans = max(ans, l)
break
ans = max(ans, l)
print(ans)
|
p03086 | s935003047 | Wrong Answer | s=input()
l=list("ACGT")
ans=0
for i in range(len(s)-1):
for k in range(i+1,len(s)+1):
if all(j in l for j in s[i:k+1]):
ans=max(ans,len(s[i:k+1]))
print(ans) |
p03086 | s800302819 | Wrong Answer | S = list(input())
ACGT = set(["A","C","G","T"])
ans = 0
acgt_length = 0
for i in range(len(S)):
if S[i] in ACGT:
acgt_length += 1
else:
ans = max(ans,acgt_length)
acgt_length = 0
print(ans) |
p03086 | s938526858 | Wrong Answer | S = input()
count = 0
koremade = 0
for i in range(0,len(S)):
if S[i] in 'ACGT':
count += 1
else:
if koremade <= count:
koremade = count
count = 0
print(koremade) |
p03086 | s963089020 | Wrong Answer | S = input()
ans = 0
i = 0
while i<len(S):
j = 0
if (S[i+j]=='A' or S[i+j]=='G' or S[i+j]=='T' or S[i+j]=='C'):
while i+j<len(S) and (S[i+j]=='A' or S[i+j]=='G' or S[i+j]=='T' or S[i+j]=='C'):
j +=1
if j >= ans:
ans = j
i = i+j
else:
i += i+1
prin... |
p03086 | s640247369 | Wrong Answer | 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
print(score)
|
p03086 | s287854085 | Wrong Answer | S = input()
N = len(S)
maxc = 0
c = 0
for i in range(N):
if S[i] in {'A', 'T', 'G', 'C'}:
c += 1
else:
maxc = max(maxc, c)
c = 0
print(maxc) |
p03086 | s518053049 | Wrong Answer | S = input()
l = []
for i in range(0,len(S)):
if(S[i] == 'A' or S[i] == 'G' or S[i] == 'C' or S[i] == 'T'):
l.append(i)
print(l)
if(len(l) == 0):
print(0)
else:
count = 1
max = 1
for i in range(0,len(l)-1):
if(l[i]+1 == l[i+1]):
count += 1
max = ... |
p03086 | s543184853 | Wrong Answer | s = input()
ans = 0
for i in range(len(s)):
if(s[i] == 'A'):
ans += 1
elif(s[i] == 'C'):
ans += 1
elif(s[i] == 'G'):
ans += 1
elif(s[i] == 'T'):
ans += 1
else:
break
print(ans) |
p03086 | s163858809 | Wrong Answer | s = input()
ans = 0
for i in range(len(s)):
for j in range(i,len(s)):
tmp = s[i:j]
if set(list(tmp)) <= set(["A","C","G","T"]):
ans = max(ans,len(tmp))
print(ans) |
p03086 | s468846441 | Wrong Answer | S = input()
ACGT = ['A','C','G','T']
max_length = 0
for i in range(len(S)):
j = i
while len(S) > j+1 and S[j] in ACGT:
j += 1
if max_length < j - i:
max_length = j - i
print(max_length) |
p03086 | s014503441 | Wrong Answer |
s = input()
n = len(s)
ans = 0
count = 0
for i in range(len(s)):
for j in range(i,n):
if all("ACGT".count(c) == 1 for c in s[i:j + 1]):
ans = max(ans, j +1)
print(ans)
|
p03086 | s402618156 | Wrong Answer | S = input()
L = []
for i in range(len(S)):
if(S[i] in 'ACGT'):
count = 1
else:
continue
for j in range(i + 1, len(S)):
if (S[j] in 'ACGT'):
count += 1
else:
L.append(count)
break
if (len(L) == 0):
print('0')
else:
print(max(L))
|
p03086 | s731984107 | Wrong Answer | s = input()
longest = 0
n_max = 0
for i, x in enumerate(s):
if x in ["A", "C", "G", "T"]:
n_max += 1
else:
longest = max(longest, n_max)
n_max = 0
print(longest) |
p03086 | s110833230 | Wrong Answer | S = input()
max = 0
for i in range(len(S)-1):
for j in range(i+1, len(S)):
count = 0
for char in S[i:j]:
if char == 'A' or char == 'C' or char == 'G' or char == 'T':
count += 1
if count > max:
max = count
print(max) |
p03086 | s788306388 | Wrong Answer | S = input()
num = 0
count = 0
lis = ["A", "G", "C", "T"]
for s in S:
if s in lis:
count += 1
else:
if num < count:
num = count
count = 0
print(num) |
p03086 | s597179777 | Wrong Answer | import sys
input = sys.stdin.readline
S = input().strip()
a = ['A', 'T', 'G', 'C']
ans = 0
j = []
for i in range(len(S)):
j = i
count = 0
while True:
if j >= len(S):
break
if S[j] in a:
count += 1
j += 1
else:
ans = max(ans, count)
break
print(ans) |
p03086 | s863841535 | Wrong Answer | def judacgt(c):
return c=="A" or c=="G" or c=="C" or c=="T"
s = input()
max = 0
for i in range(len(s)):
if judacgt(s[i]):
for j in range(i+1,len(s)):
# print(s[i:j])
if judacgt(s[j])==False:
break
elif j-i+1 > max:
max=j-i+1
print(m... |
p03086 | s296562686 | Wrong Answer | S = input()
count = 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":
count += 1
else:
if max < count:
max = count
count = 0
print(max)
|
p03086 | s513257938 | Wrong Answer | s = input()
ACGT = ['A', 'C', 'G', 'T']
ans = 0
ans_max = 0
flg = False
for c in s:
if c in ACGT:
ans += 1
flg = True
elif flg:
ans_max = max(ans_max, ans)
ans = 0
flg = False
print(ans_max) |
p03086 | s337956607 | Wrong Answer | 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
print(ans) |
p03086 | s756056286 | Wrong Answer | s = input()
len_li = [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:
len_li.append(cnt)
cnt = 0
print(max(len_li)) |
p03086 | s319868006 | Wrong Answer | s = input()
acgt = set("ACGT")
ans = 0
for i in range(len(s)):
for j in range(i, len(s)):
if acgt >= set(s[i:j]):
ans = max(ans, j-i)
print(ans)
|
p03086 | s123704764 | Wrong Answer | s = input()
n = len(s)
ans = 0
for i in range(n):
for j in range(i+1,n):
if all("ACGT".count(c)==1 for c in s[i:j]):
ans = max(ans,j-i)
print(ans) |
p03086 | s441224261 | Wrong Answer | a=input()
total=0
total2=0
i=0
while True:
if i==len(a)-1:
break
elif a[i]=="A" or a[i]=="T" or a[i]=="C" or a[i]=="G":
total+=1
i+=1
else:
i+=1
if total2<total:
total2=total
total=0
print(total2) |
p03086 | s574044793 | Wrong Answer | 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
print(max_chain) |
p03086 | s779501497 | Wrong Answer | s=input()
S=[s[i] for i in range(len(s))]
A={'A','C','G','T'}
B=[S[i] in A for i in range(len(S))]
max_length=0
print(B)
for i in range(len(B)):
if B[i]==1:
count_length=1
count=i
max_length=max(count_length,max_length)
while (count+1)<len(B) and B[count+1]==1:
count_length=1+count_length
... |
p03086 | s582785749 | Wrong Answer | s = input()
pre = False
ans = ''
m = 0
for i in s:
if i==s[0] and i in 'ACGT':
ans+=i
pre=True
continue
if i in 'ACGT' and pre == True:
ans+=i
pre=True
else:
pre=False
m = max(m, len(ans))
ans=''
print(len(ans)) |
p03086 | s274230208 | Wrong Answer | 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(ans)
|
p03086 | s072239058 | Wrong Answer | #ABC122B
S = input()
count_max = 0
count = 0
for i in range(len(S)):
if "A" in S[i] or "C" in S[i] or"G" in S[i] or"T" in S[i]:
count += 1
#最長のACGT文字列が、文字列の末尾にあるときに対応する
if i == len(S) and count>count_max:
count_max = count
#まだ列が途中であって、文字が途切れた時、maxを更新する
else:
if count > count_... |
p03086 | s080980020 | Wrong Answer | 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
if len(num_list)==0:print(0)
else:
print(max(num_list)) |
p03086 | s222823175 | Wrong Answer | 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
print(ans) |
p03086 | s412517200 | Wrong Answer | import random
b = input()
if b =="A":
print("T")
elif b=="T":
print("A")
elif b=="G":
print("C")
elif b=="C":
print("G") |
p03086 | s612683518 | Wrong Answer | S = input()
RES = 0
def countACGT(s):
res = 0
res += s.count("A")
res += s.count("C")
res += s.count("G")
res += s.count("T")
return res
for i in range(len(S)):
for j in range(len(S)):
RES = max(RES,countACGT(S[i:j]))
print(RES) |
p03086 | s165406991 | Wrong Answer | S = input()
N = len(S)
ans = 0
for i in range(N):
for j in range(i+1,N):
if all("ACGT".count(c) == 1 for c in S[i:j+1]):
ans = max(len(S[i:j+1]), ans)
print(ans) |
p03086 | s152435537 | Wrong Answer | S=str(input())
M=['A','C','G','T']
c=0
cmax=0
for i in range(len(S)):
if S[i] in M:
c+=1
else:
if c>cmax:
cmax=c
c=0
print(cmax) |
p03086 | s000101819 | Wrong Answer | S = input()
count = 0
res = 0
for i in S:
if i in ["A", "C", "G", "T"]:
count += 1
else:
res = max(count, res)
count = 0
print(res) |
p03086 | s913181009 | Wrong Answer | S = input()
counter = 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"):
counter += 1
else:
max_ = max(max_,counter)
counter = 0
print(max_) |
p03086 | s774386320 | Wrong Answer |
s = input()
ans = 0
for i in range(len(s)):
count = 0
for j in range(len(s)):
if s[j] in "ACGT":
count += 1
else:
break
if count >= ans:
ans = count
print(ans)
|
p03086 | s332059956 | Wrong Answer | 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
|
p03086 | s004687667 | Wrong Answer | s=input()
l=list("ACGT")
ans=0
for i in range(len(s)):
for k in range(i+1,len(s)):
if all(i in l for i in s[i:k]):
ans=max(ans,len(s[i:k]))
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.