problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s052449161 | Wrong Answer | S=input()
C = 0
cnt = 0
for i in range(len(S)):
if S[i] in ["A","C","G","T"]:
cnt+=1
else:
C = max(C,cnt)
cnt = 0
print(C) |
p03086 | s667415152 | Wrong Answer | S = input()
mode = 0
now = 0
k = []
for i in range(len(S)):
if str(S[i]) == "A" or str(S[i]) == "T" or str(S[i]) == "G" or str(S[i]) == "C":
if mode == 0:
mode = 1
now += 1
else:
now += 1
else:
k.append(now)
now = 0
mode = 0
if len(k) =... |
p03086 | s777291308 | Wrong Answer | S = input()
cut = 0
total = ''
for s in S:
for i in ['A', 'C', 'G', 'T']:
if i == s:
total = total + i
if total:
print(len(total))
else:
print(0) |
p03086 | s698252064 | Wrong Answer | s=input()
mx=0
for i in range(len(s)):
a=s[:-i]
for j in range(len(s)-i):
b=a[j:]
if b.count('A')+b.count('C')+b.count('G')+b.count('T')==len(b):
mx=max(mx,len(b))
print(mx) |
p03086 | s568874514 | Wrong Answer | l = ('A', 'T', 'C', 'G')
S = input()
ans = [0]
res = 0
for i in range(len(S)):
if S[i] in l:
res += 1
elif res != 0:
ans.append(res)
res = 0
print(max(ans)) |
p03086 | s601949505 | Wrong Answer | s = list(input())
m = 0
for i in range(len(s)):
c = 0
if s[i] == "A" or s[i] == "T" or s[i] == "G" or s[i] == "C":
c += 1
for j in range(1,len(s)-i-1):
if s[i+j] == "A" or s[i+j] == "T" or s[i+j] == "G" or s[i+j] == "C":
c += 1
else:
if c >... |
p03086 | s281837658 | Wrong Answer | s = input()
max_len=0
for i in range(len(s)):
for j in range(i+1, len(s)):
cut = s[i:j]
flag = True
for k in range(len(cut)):
if cut[k] not in ["A", "C", "G", "T"]:
flag = False
if flag:
max_len = max(max_len, len(cut))
print(max_len) |
p03086 | s144522110 | Wrong Answer | S = input()
ACGT = ["A","C","G","T"]
count=0
ans=0
for i in range(len(S)):
if S[i] in ACGT:
count+=1
else:
ans=max(ans,count)
ans=max(ans,count)
print(ans) |
p03086 | s993571911 | Wrong Answer | S = input()
count = 0
maxlength = 0
for s in S:
if s in ['A','C','G','T']:
count += 1
else:
maxlength = max(count, maxlength)
count = 0
print(maxlength) |
p03086 | s230227729 | Wrong Answer | S = str(input())
ans = 0
for i in range(len(S)):
count = 0
fr = 0
if S[i] == "A" or "T" or "C" or "G":
count += 1
for j in range(i+1, len(S)):
if fr == 0 and S[j] == "A" or S[j] == "T" or S[j] == "C" or S[j] == "G":
count += 1
print(S[j])
... |
p03086 | s259647151 | Wrong Answer | string = input()
char = ["A", "C", "G", "T"]
count = 0
lengths = [0]
for s in string:
if s in char:
count += 1
else:
lengths.append(count)
count = 0
print(max(lengths))
|
p03086 | s601279243 | Wrong Answer | n = input()
li = []
count = 0
s = ""
for i in range(len(n)):
if n[i] == "A" or n[i] == "G" or n[i] == "C" or n[i] == "T":
s += "a"
else:
s += "b"
for i in range(len(n)):
if s[i] == "a":
count += 1
else:
li.append(count)
count = 0
li.append(count)
print(max(li))
pr... |
p03086 | s264440163 | Wrong Answer | S = input()
answer = ''
for char in S:
includes = ['A', 'C', 'G', 'T']
is_included = char in includes
if not is_included: continue
answer += char
answer = len(answer)
print(answer)
|
p03086 | s678919730 | Wrong Answer | s = input()
acgt = ["A","C","G","T"]
ans = 0
for i in range(len(s)):
for l in range(1,len(s)):
t = s[i:l].replace("A","").replace("C","").replace("G","").replace("T","")
if len(t) == 0:
if len(s[i:l]) > ans:
ans = len(s[i:l])
print(ans) |
p03086 | s995837954 | Wrong Answer | s = input()
acgt = ['A', 'C', 'G', 'T']
count = 0
ans = 0
for i in range(len(s)):
if s[i] in acgt:
count += 1
else:
ans = max(ans, count)
count = 0
print(ans) |
p03086 | s189689882 | Wrong Answer | S = input()
T = set(list('AGCT'))
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 | s580534620 | Wrong Answer | 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 += 1
else:
c = max(c, b)
b = 0
print(c) |
p03086 | s190318709 | Wrong Answer | S = input()
ACGT = 'ACGT'
ans = 0
temp = 0
for x in S:
if x in ACGT:
temp += 1
else:
ans = max(ans, temp)
temp = 0
print(ans) |
p03086 | s517946534 | Wrong Answer | s = input()
ACGT = ["A", "C", "G", "T"]
cnt = 0
ans = 0
for i in range(len(s)):
if s[i] in ACGT:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s756507188 | Wrong Answer | 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 = ""
print(len(max(l))) |
p03086 | s572186874 | Wrong Answer | S = input()
ans, cnt = 0, 0
for x in list(S):
if x in ['A', 'C', 'G', 'T']:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s822230631 | Wrong Answer | a=str(input())
count=0
ans=0
for i in range(len(a)):
if a[i]== "A" or a[i]== "C" or a[i]== "G" or a[i]== "T" :
count+=1
else:
ans=max(ans,count)
count=0
print(ans) |
p03086 | s872975372 | 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
if total2<total:
print(total)
else:
print(total2) |
p03086 | s060561275 | Wrong Answer | acgt = ["A", "C", "G", "T"]
ans = 0
count = 0
for i in input():
if i in acgt:
count += 1
else:
ans = max(ans, count)
count = 0
print(ans) |
p03086 | s729901187 | Wrong Answer | S=input()
T='ATCG'
flag =0
ans =0
for i in range(len(S)):
flag =0
for j in range(i,len(S)-i):
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 | s669593811 | Wrong Answer | s = input()
ans=0
for i in range(len(s)-1):
ch=0
for j in range(i,len(s)):
if s[j] in 'ACGT':
ch+=1
else:
ans=max(ans,ch)
ch=0
ans=max(ans,ch)
print(ans)
|
p03086 | s007133170 | Wrong Answer | S = list(input())
ans = 0
for i in range(len(S)):
res = 0
for j in range(i, len(S)):
if S[j] in ["A", "T", "G", "C"]:
res += 1
else:
ans = max(ans, res)
break
print(ans) |
p03086 | s261695620 | Wrong Answer | n = input()
count=0
m = 0
for s in n:
if s =="A" or s == "C" or s == "G" or s== "T" :
count+=1
else:
m =max(m,count)
count=0
print(m) |
p03086 | s043889809 | Wrong Answer | s = list(input())
max = 0
cnt = 0
D = ["A","C","G","T"]
for i in s:
if i in D:
cnt += 1
else:
if max < cnt:
max = cnt
cnt = 0
print(max) |
p03086 | s896225787 | Wrong Answer | S = input()
N = len(S)
cnt = 0
ans = 0
for i in range(N):
for j in range(i, N):
if S[j] in ['A', 'C', 'G', 'T']:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s095952674 | Wrong Answer | s = input()
acgt = ["A","C","G","T"]
tmp = 0
ans = 0
for x in list(s):
if x in acgt:
tmp += 1
else:
ans = max(ans,tmp)
tmp = 0
print(ans)
|
p03086 | s065348495 | Wrong Answer | s=input()
count = 0
ans = 0
for i in s:
if i in ['A','C','G','T']:
count += 1
else:
ans = max(ans, count)
count = 0
print(ans) |
p03086 | s023364946 | Wrong Answer | import re
S = str(input())
acgt = re.compile(r"[A,C,G,T]*")
s = re.findall(acgt, S)
print(len(max(s))) |
p03086 | s444162190 | Wrong Answer | S = input()
n = len(S)
length = 0
for s in range(n-1):
if S[s] not in ["A", "C", "G", "T"]:
continue
length = 1
for e in range(s+1, n):
if S[e] not in ["A", "C", "G", "T"]:
break
length = max(length, e-s+1)
print(length) |
p03086 | s449804077 | Wrong Answer | target = set(["A", "C", "G", "T"])
S = list(input())
tmp = 0
ans = 0
for i in S:
print(i)
if i in target:
print("aaa")
tmp+=1
else:
ans = max(tmp,ans)
tmp = 0
ans = max(tmp,ans)
print(ans) |
p03086 | s510567002 | Wrong Answer | n = input()
l = []
v = []
for t in n:
if t == 'A' or t == 'C' or t == 'G' or t == 'T':
v.append(t)
else:
l.append(v)
v = []
l.append(v)
print(len(max(l))) |
p03086 | s655364239 | Wrong Answer | a=[i for i in input()]
st=['A','C','G','T'] ; ct=0 ; maxx=0
for i in a:
if i in st:
ct+=1
else:
maxx=max(maxx,ct)
ct=0
print(maxx)
|
p03086 | s376111286 | Wrong Answer | S = input()
length = 0
count = 0
for i in range(len(S)):
for char in S[:i]:
if char in "AGCT":
count += 1
else:
length = max(length, count)
count = 0
count = 0
print(length) |
p03086 | s542853234 | Wrong Answer | S = list(input())
P = set(["A","C","T","G"])
count = 0
if P&set(S) == set():
print(0)
exit()
else:
for i in range(0,len(S)-1):
for j in range(i+1, len(S)):
if set(S[i:j+1])-P == set():
count = max(count,j+1-i)
print(count)
|
p03086 | s853020765 | Wrong Answer | s=list(input())
num=0
check=["A","T","C","G"]
ans_list=[]
num=0
ans=0
for i in range(len(s)):
if s[i] in check:
num=num+1
else:
ans=max(ans,num)
ans_list.append(ans)
num=0
print(ans)
|
p03086 | s723002689 | Wrong Answer | S = input()
ans = 0
l = 0
for c in S:
if c in 'ATCG':
l += 1
else:
ans = max(ans, l)
l = 0
print(ans)
|
p03086 | s306842167 | Wrong Answer | s=input()
cnt=0
ans=0
for i in s:
if i=="A" or i=="C" or i=="G" or i=="T":
cnt += 1
else:
ans = max(ans, cnt)
cnt=0
print(ans) |
p03086 | s672268426 | Wrong Answer | S = list(map(str,input()))
count = 0
ans = 0
for i in range(len(S)):
if S[i] in ["A","T","G","C"]:
count += 1
else:
ans = max(ans,count)
count = 0
print(ans) |
p03086 | s518417370 | Wrong Answer | def li():
return list(map(int, input().split()))
def mi():
return map(int, input().split())
def ii():
return int(input())
S = input()
ACGT = ["A", "C", "G", "T"]
length = 0
for i in range(len(S)):
if S[i] in ACGT:
for j in range(i, len(S)):
if S[j] not in ACGT:
... |
p03086 | s032681541 | Wrong Answer | s = input()
items = ['A', 'T', 'G', 'C']
length = 0
maxLen = 0
for i in s:
if i in items:
length += 1
else:
if length > maxLen:
maxLen = length
length = 0
print(maxLen)
|
p03086 | s040010733 | Wrong Answer | s=input()
ans=0
count=0
for i in s:
if i in 'ACGT':count+=1
else:
ans=max(ans,count)
count=0
print(ans)
|
p03086 | s584762305 | Wrong Answer | 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
elif S[i] not in ACGT:
ans_lis.append(ans)
ans = 0
print(max(ans_lis)) |
p03086 | s011120637 | Wrong Answer | 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()
ans = 0
temp = 0
for i in s:
if i in 'ACGT':
temp += 1
... |
p03086 | s598545343 | Wrong Answer | s = list(input())
for i in range(len(s)):
if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":
s[i] = 1
else:
s[i] = 0
ans = []
for i in range(0,len(s)-2):
for j in range(i,len(s)):
if 0 not in s[i:j+1]:
ans.append(j+1-i)
if ans == []:
print(0)
else:
print(max(ans))
|
p03086 | s479092997 | Wrong Answer | S = list(input())
count = 0
record = 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 > record:
record = count
print(record) |
p03086 | s787803112 | Wrong Answer | s = input()
c = ["A","C","G","T"]
ans = 0
count = 0
f = False
for i,ss in enumerate(s):
if i == 0 and s[i] in c:
count = 1
f = True
continue
if f:
if s[i] in c:
count += 1
else:
ans = max(count,ans)
count = 0
f = False
e... |
p03086 | s758644016 | Wrong Answer | import sys
input = lambda: sys.stdin.readline().rstrip()
def resolve():
S = input()
acgt = ['A', 'C', 'G', 'T']
ans = 0
for l in range(len(S)-1):
for r in range(l+1, len(S)+1):
if S[r-1] not in acgt:
ans = max(r-l-1, ans)
break
print(ans)
if __... |
p03086 | s668692888 | Wrong Answer | s = list(input())
max = 0
cnt = 0
D = ["A","C","G","T"]
for i in s:
if i in D:
cnt += 1
else:
if max > cnt:
max = cnt
cnt = 0
print(max) |
p03086 | s563966460 | Wrong Answer | S = input()
ans = 0
ans_lis = [0]
for i in range(len(S)):
if S[i] in "ACGT":
ans = ans + 1
else:
ans_lis.append(ans)
ans = 0
ans_lis.append(ans)
print(max(ans_lis)) |
p03086 | s054741538 | Wrong Answer | #<3>
S = input()
result = 0
ans = 0
word = ["A","G","C","T"]
for i in S:
if i in word:
ans += 1
else:
result = max(result,ans)
ans = 0
print(result) |
p03086 | s992511465 | Wrong Answer | lngs = input()
ACGT = ["A", "C", "G", "T"]
out_list = []
out_list_long = []
for lng in lngs:
if lng in ACGT:
out_list += lng
else:
if len(out_list) > len(out_list_long):
out_list_long = out_list
out_list = []
print(len(out_list_long)) |
p03086 | s514054247 | Wrong Answer | s = input()
count = 0
ans =0
for i in s:
if i in 'ACGT':
count +=1
else:
ans = max(ans,count)
count = 0
print(ans)
|
p03086 | s451501582 | Wrong Answer | S = list(input())
F = ["A", "C", "G", "T"]
count = 0
flag = 0
for i in S:
for j in F:
if j == i:
count += 1
if flag < count:
flag = count
else:
count = 0
print(flag) |
p03086 | s070781931 | Wrong Answer | b=list(str(input()))
E={"A","C","G","T"}
count=0
ans=0
for moji in b:
if moji in E:
count+=1
else:
ans=max(ans,count)
count=0
print(ans) |
p03086 | s988138906 | Wrong Answer | s=list(input())
t=[]
for i in range(len(s)):
if s[i]!="A" and s[i]!="C" and s[i]!="G"and s[i]!="T":
t.append(i)
if len(t)==0:
print(0)
else:
t=[-1]+t
u=[]
for i in range(len(t)-1):
u.append(t[i+1]-t[i])
print(max(u)-1)
|
p03086 | s339523931 | Wrong Answer | S = input()
F = "ATGC"
cnt = 0
n = len(S)
for i in range(n-1):
for j in range(i+1, n):
flg = True
for k in range(i, j):
flg *= (S[i] in F)
if flg:
cnt = max(cnt, j - i)
print(cnt) |
p03086 | s289436348 | Wrong Answer | import sys
sys.setrecursionlimit(10**6)
s = input()
l = ['A', 'C', 'G', 'T']
ans = 0
tmp = 0
for ch in s:
if ch in l:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
print(ans) |
p03086 | s405993278 | Wrong Answer | c,m=0,0
for i in input():
if i in "AGCT":
c+=1
else:
if c > m:
m=c
c=0
print(m) |
p03086 | s024456029 | Wrong Answer | # -*- coding: utf-8 -*-
S = list(str(input()))
tmp = []
for i in range(len(S)):
if S[i] == 'A' or S[i] == 'C' or S[i] == 'G' or S[i] == 'T':
tmp.append(1)
else:
tmp.append(0)
ans = 0
num = 0
for i in range(len(S)):
if tmp[i] == 1:
num += 1
else:
ans = max(ans, num)
... |
p03086 | s936839217 | 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 | s991156572 | Wrong Answer | S = input()
ans = 0
for i in range(len(S)):
for j in range(i+1,len(S)):
flag = True
for k in S[i:j+1]:
if not (k=='A' or k=='C' or k=='G' or k=='T'):
flag = False
break
if flag:
ans = max(ans, len(S[i:j+1]))
print(ans) |
p03086 | s948409322 | Wrong Answer | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
s = input().strip()
ans = 0
tmp = 0
for v in s:
if v in ('A', 'C', 'G', 'T'):
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
print(ans)
|
p03086 | s708517830 | Wrong Answer | S = input()
target = list('ACGT')
count_list = [0] * len(S)
for i in range(len(S)):
if S[i] in target:
count_list[i] = 1
max_length = 0
for start in range(len(S)):
if count_list[start] == 0:
continue
for end in range(start, len(S)):
if count_list[end] == 0:
break
... |
p03086 | s011422848 | Wrong Answer | n = list(input())
count = 0
for i in range(len(n)):
word = 0
flag = 0
for j in range(i, len(n)):
if(flag == 0):
if(n[j] == 'A' or n[j] == 'C' or n[j] == 'T' or n[j] == 'G'):
word += 1
flag = 1
else:
if(n[j] != 'A' and n[j] != 'C' and n[j] != 'T' and n[j] != 'G'):
if(c... |
p03086 | s647339885 | Wrong Answer | S = input()
count = 0
li =[0]
for i in range(len(S)-1):
if "A" == S[i] or "C"==S[i] or "G"==S[i] or "T"==S[i]:
count += 1
else:
if count >0:
li.append(count)
count = 0
print(max(li)) |
p03086 | s707854173 | Wrong Answer | from math import gcd
s=input()
n=len(s)
ans=0
tmp=0
for i in range(n):
if s[i]=="A" or s[i]=="C" or s[i]=="G" or s[i]=="T":
tmp+=1
else:
ans=max(tmp,ans)
tmp=0
print(ans) |
p03086 | s708101905 | Wrong Answer | S = input()
n = len(S)
ans = 0
for i in range(1, n+1):
for j in range(n-i):
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 | s491939977 | Wrong Answer | def main():
s = input()
n = len(s)
ans = 0
for i in range(n):
for j in range(i + 1, n):
if set(s[i:j]) - {"A", "C", "G", "T"} == set():
ans = max(ans, len(s[i:j]))
print(ans)
if __name__ == "__main__":
main()
|
p03086 | s510180327 | Wrong Answer |
S = input()
N = len(S)
m = 0
for i in range(N):
for j in range(i+1):
s = S[j:i]
l = list(s)
l = [k for k in l if k not in ["A", "G", "C", "T"]]
if len(l) == 0:
m = max(m, i-j)
print(m) |
p03086 | s585615943 | Wrong Answer | S=str(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:
ans=max(ans,temp)
print(ans)
|
p03086 | s084089319 | Wrong Answer | import sys
from collections import deque
from itertools import *
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... |
p03086 | s015974302 | Wrong Answer | s=input()
ans=0
cur=0
ACGT=["A","C","G","T"]
for ss in s:
if ss in ACGT:
cur+=1
else:
ans=max(cur,ans)
cur=0
print(ans) |
p03086 | s975028981 | Wrong Answer | s = input()
ans = 0
cnt = 0
for i in range(len(s)):
if s[i] in ("A", "C", "G", "T"):
cnt += 1
else:
if ans < cnt:
ans = cnt
cnt = 0
print (ans)
|
p03086 | s232881463 | Wrong Answer | s = input()
ans = 0
for i in range(len(s) - 1):
if s[i] not in {'A', 'C', 'G', 'T'}:
continue
length = 1
for j in range(i + 1, len(s)):
if s[j] not in {'A', 'C', 'G', 'T'}:
break
length += 1
ans = max(ans, length)
print(ans) |
p03086 | s844646790 | Wrong Answer | *s, = input()
s.append("")
c = 0
ans = 0
for i in range(len(s)):
if s[i] not in "ACGT":
ans = max(ans, i - c)
c = i + 1
print(ans)
|
p03086 | s728110117 | Wrong Answer | 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
print(ans)
|
p03086 | s017657476 | Wrong Answer | s = input()
sum = 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':
sum += 1
else:
if(sum >= max): max = sum
sum = 0
print(max)
|
p03086 | s613878097 | Wrong Answer | def main():
s = input()
l = ['A', 'G', 'T', 'C']
cnt = 0
ans = 0
for j in range(len(s)):
for i in range(j, len(s)):
if not s[i] in l:
ans = max(ans, cnt)
cnt = 0
break
cnt += 1
print(ans)
if __name__ == '__main__':... |
p03086 | s405101504 | Wrong Answer | S = input()
n = len(S)
Max = 0
count = 0
for i in range(n):
if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":
count += 1
else:
Max = max(count,Max)
print(Max) |
p03086 | s509369033 | 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
print(ans)
|
p03086 | s548108181 | Wrong Answer | S = input()
tmp=''
ans=0
for s in S:
if s in 'ACGT':
tmp+=s
else:
ans = max(ans,len(tmp))
tmp=''
print(ans) |
p03086 | s760031257 | Wrong Answer | S = input()
mx = 0
count = 0
for x in S :
if x in "ATGC" :
count += 1
else :
mx = max(mx, count)
count = 0
max = max(mx, count)
print(mx)
|
p03086 | s684237632 | Wrong Answer | 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:
if ans <= count:
... |
p03086 | s633784531 | Wrong Answer | s = str(input())
ans = 0
memo = 0
for i in range(len(s)):
if s[i] != "A" and s[i] !="C" and s[i] != "G" and s[i] !="T":
if i-memo > ans:
ans = i-memo
memo = i+1
#print(memo, ans, i)
print(ans) |
p03086 | s981892602 | Wrong Answer | import re
pattern = re.compile('[ACGT]+')
S = input()
print(len(max(re.findall(pattern, S), default='')))
|
p03086 | s824206289 | Wrong Answer | 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)-1):
r = l+1
while (r < len(S)+1) and (S[r-1] in acgt):
r += 1
ans = max(r-1-l, ans)
l += 1
print(ans)
if... |
p03086 | s499298449 | Wrong Answer | s = input()
t = "ACGT"
ans = 0
cnt = 0
for ss in s:
if ss in t:
cnt += 1
else:
ans = max(cnt, ans)
cnt = 0
print(ans)
|
p03086 | s607974148 | Wrong Answer | S=str(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:
ans=max(ans,temp)
temp=0
print(ans)
|
p03086 | s558590959 | Wrong Answer | s = input()
_s = {"A", "C", "G", "T"}
t = 0
ans = 0
for i in s:
if i in _s:
t += 1
else:
ans = max(ans, t)
t = 0
print(ans)
|
p03086 | s329885935 | Wrong Answer | S = input()
ans = 0
for i in range(0,len(S)):
tmp = S[i]
if(tmp == "A" or tmp == "G" or tmp == "C" or tmp == "T"):
ans += 1
else:
ans = 0
print(str(ans)) |
p03086 | s566701652 | Wrong Answer | s=input()
cnt=0
ans=0
for i in s:
if i =='A' or i =='C' or i =='G' or i=='T':
cnt+=1
else:
ans=max(ans,cnt)
cnt=0
print(ans) |
p03086 | s161637826 | Wrong Answer | S=list(input())
a=0
b=[0]
for i in range(len(S)-1):
if S[i]=='A' or S[i]=='C' or S[i]=='G' or S[i]=='T':
b[len(b)-1]+=1
if (S[i]=='A' or S[i]=='C' or S[i]=='G' or S[i]=='T') and (S[i+1]!='A' and S[i+1]!='C' and S[i+1]!='G' and S[i+1]!='T'):
b.append(0)
print(max(b)) |
p03086 | s151038303 | Wrong Answer | max_len = 0
tmp = 0
S = input()
atcg = ['A', 'T', 'C', 'G']
for i in range(len(S)):
if S[i] in atcg:
tmp += 1
else:
max_len = max(max_len, tmp)
tmp = 0
print(max_len)
|
p03086 | s655055827 | Wrong Answer | S = input()
M = 0
con = 0
L = ["A","C","G","T"]
for i,s in enumerate(S):
if S[i] in L:
con += 1
elif S[i] not in L:
M = max(M,con)
con = 0
print(M) |
p03086 | s077374617 | Wrong Answer | S=input()
count=0
max_count=-1
for i in range(len(S)):
if S[i]!="A" and S[i]!="C" and S[i]!="G" and S[i]!="T":
count=count+1
else:
if max_count<count:
max_count=count
count=0
print(max_count) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.