problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s492619683 | Wrong Answer | s=str(input())
s=list(s)
l=len(s)
ans=0
temp=0
for i in range(0,l):
if s[i]=="A" or s[i]=="C" or s[i]=="G" or s[i]=="T":
temp=temp+1
else:
ans=max(ans,temp)
temp=0
print(ans)
|
p03086 | s657046504 | Wrong Answer | s = input()
ans = 0
for l in range(len(s) - 1):
for r in range(l+1, len(s)):
if set(s[l:r]).issubset({"A", "T", "C", "G"}):
ans = max(ans, len(s[l:r]))
print(ans)
|
p03086 | s734322813 | Wrong Answer | s = input()
cnt = 0
max_cnt = 0
for i in s:
if i in ['A', 'T', 'C', 'G']:
cnt += 1
else:
cnt = 0
max_cnt = max(max_cnt, cnt)
print(cnt) |
p03086 | s322300889 | Wrong Answer | words = input()
lst = ['A', 'C', 'G', 'T']
max_count = 0
count = 0
for i in range(len(words)):
if words[i] in lst:
count += 1
else:
if count > max_count:
max_count = count
count = 0
print(max_count) |
p03086 | s865704871 | Wrong Answer | S = list(input())
M = 0
count = 0
for x in S:
if x =="A" or x =="C" or x =="T" or x =="G":
count += 1
else:
if M<count:
M = count
count = 0
print(M) |
p03086 | s315160385 | Wrong Answer | S = list(input())
N = len(S)
M = ["A","G" ,"C" ,"T"]
cnt = 0
Ans = 0
for i in range(N):
if S[i] in M:
cnt += 1
Ans = max(Ans, cnt)
else:
Ans = max(Ans, cnt)
print(Ans) |
p03086 | s200277857 | Wrong Answer | s = input()
import itertools
def judge(k):
if s[k] == "A" or s[k] == "C" or s[k] == "G" or s[k] == "T":
return True
return False
ans = 0
for comb in itertools.combinations(range(len(s)),2):
i,j = comb
true = 1
for k in range(i,j+1):
if not judge(k):
true = 0
... |
p03086 | s834745472 | 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)
count = 0
print(Max)
|
p03086 | s063837757 | 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]
for j in range(len(N)-1):
M = max( N[j+1] - N[j]-1,M)
print(M)
|
p03086 | s052708864 | Wrong Answer | S = input()
F = "ATGC"
cnt = 0
for i in S:
if i in F:
cnt += 1
print(cnt) |
p03086 | s237643177 | Wrong Answer | S = input()
max = 0
ans = 0
for i in range(len(S)):
if S[i] == 'A' or S[i] == 'T' or S[i] == 'C' or S[i] == 'G':
ans += 1
else:
if ans >= max:
max = ans
else:
ans = 0
print(max) |
p03086 | s209843402 | Wrong Answer | S = input()
T = set(list('AGCT'))
ans = 0
for l in range(len(S)):
for r in range(l + 1, len(S)):
if set(S[l:r]) < T:
ans = max(ans, r - l)
print(ans) |
p03086 | s066537780 | Wrong Answer | 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
print(result) |
p03086 | s853335879 | Wrong Answer | S=list(input())
line=[]
A=["A","C","G","T"]
flag=False
for s in S:
if s in A:
line.append(s)
flag=True
elif flag:break
print(len(line)) |
p03086 | s889468974 | Wrong Answer | s=input()
count=0
ans=0
for i in range(len(s)):
if s[i]=="A" or s[i]=="G" or s[i]=="C" or s[i]=="T":
count+=1
else:
ans=max(ans,count)
count=0
print(ans,count) |
p03086 | s089280399 | Wrong Answer |
def main():
S = input()
candidates = ("A", "C", "G", "T")
ans = 0
tmp = 0
for s in S:
if s in candidates:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
print(ans)
return
if __name__ == "__main__":
main() |
p03086 | s890635762 | Wrong Answer | S = input()
n = len(S)
head, tail, max = 0, 0, 0
list = ['A', 'G', 'C', 'T']
while tail < n and head < n:
if S[head] in list:
head += 1
else:
if max < (head - tail):
max = head - tail
tail = head + 1
head += 1
print(max) |
p03086 | s583398374 | Wrong Answer | s = input()
acgt_list = ["A", "C", "G", "T"]
ans = 0
temp = 0
for c in s:
if c in acgt_list:
temp += 1
continue
if temp > ans:
ans = temp
temp = 0
print(ans) |
p03086 | s088613614 | Wrong Answer | T = input()
word = ['A','C','G','T']
result = []
target_result = []
count = 0
for i in T:
if i in word:
result.append(i)
count += 1
else:
if count == 0:
continue
target = ''.join(result)
reuslt = []
target_result.append(target)
count = 0
print(len(max(target_result)) if target_resu... |
p03086 | s497364057 | Wrong Answer | def main():
S = input()
ans = 0
cnt = 0
for ch in S:
if ch == "A":
cnt += 1
elif ch == "C":
cnt += 1
elif ch == "G":
cnt += 1
elif ch == "T":
cnt += 1
elif cnt > ans:
ans = cnt
print(ans)
if __nam... |
p03086 | s138942974 | Wrong Answer | def main():
s = str(input())
count = 0
count_lst = [0]
flag = False
for i in range(len(s)):
letter = s[i]
string = 'ACGT'
if letter in string:
count += 1
flag = True
else:
if flag:
count_lst.append(count)
... |
p03086 | s329430373 | Wrong Answer | S = input()
N = len(S)
l = []
for i in range(N):
for j in range(i,N):
s = S[i:j]
if s.strip("ACGT") == "":
l.append(s)
m = sorted(l, key=len)
print(m[-1]) |
p03086 | s974587167 | Wrong Answer | S = input()
ans = 0
streak = 0
for i in range(len(S)):
if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":
streak += 1
else:
if ans < streak:
ans = streak
streak = 0
print(ans) |
p03086 | s879448249 | Wrong Answer | import string
str_up = string.ascii_uppercase.replace("A","").replace("C","").replace("G","").replace("T","")
S = input()
part = []
for i in range(len(S)):
for j in range(len(S)-i):
part.append(S[i:j])
max_s = 0
for i in part:
for j in str_up:
if j in i:
break
elif j == "Z":
... |
p03086 | s569207408 | Wrong Answer | l=input()
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 | s557886189 | Wrong Answer | l = ['A','T','C','G']
s = ''
tmp =''
st = input()
for i in st:
if i in l:
s+=i
if i == st[len(st)-1] and len(s) > len(tmp):
tmp = s
s =''
else:
if len(s) > len(tmp):
tmp = s
s =''
print(len(tmp)) |
p03086 | s762638395 | Wrong Answer | l=input()
if "A" or "G" or "C" or "T" in l:
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)
else:
print(0)
|
p03086 | s698828948 | Wrong Answer | s=input()
cnt=0
ans=0
lit=["A","C","G","T"]
for i in range(len(s)):
if s[i] in lit:
cnt+=1
else:
ans=max(cnt,ans)
cnt=0
print(ans) |
p03086 | s814363111 | Wrong Answer | S = input()
m = 0
c = 0
for s in S:
if s in ["A", "C", "G", "T"]:
c += 1
else:
m = max(m, c)
c = 0
print(m)
|
p03086 | s898344862 | Wrong Answer |
s = input()
ans = 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:
if ans <= count:
ans = count
count = 0
print(ans)
|
p03086 | s361301168 | Wrong Answer | s = input()
ans = 0
for c in s:
if c in ('A', 'C', 'G', 'T'):
ans += 1
print(ans)
|
p03086 | s702481832 | Wrong Answer | S = input()
n = len(S)
ans = 0
k = 0
agct = ['A','G','C','T']
for i in range(n):
if S[i] in agct:
k+=1
continue
ans = max(k,ans)
k = 0
print(ans) |
p03086 | s331553719 | Wrong Answer | s=input()
a,b=0,0
for i in range(len(s)):
if s[i]=="A" or s[i]=="C" or s[i]=="G" or s[i]=="T":
a+=1
else:
b=max(a,b)
a=0
print(b) |
p03086 | s245354052 | Wrong Answer | s = input()
list_s = ["A","C","T","G"]
ans = []
count=0
for i in range(-1,len(s)-1):
#List.append(s[i])
#print(s[i])
#print(s[i+1])
if s[i] in list_s and s[i+1] in list_s:
count+=1
if count>0:
print(count+1)
else:
print(0) |
p03086 | s835768481 | Wrong Answer | S = input()
ACGT = ['A', 'C', 'G', 'T']
ans = [0] * len(S)
for i in range(len(S)):
if S[i] in ACGT:
cnt = 1
for j in range(len(S) - i - 1):
if S[i+j+1] in ACGT:
cnt += 1
else:
ans[i] = cnt
break
print(max(ans)) |
p03086 | s171552917 | Wrong Answer | s=input()
tmp=0
length=[]
for i in range(len(s)):
if s[i]=="A" or s[i]=="C" or s[i]=="G" or s[i]=="T":
tmp+=1
if i==len(s)-1:
length.append(tmp)
else:
length.append(tmp)
tmp=0
print(length) |
p03086 | s854416028 | Wrong Answer | s=input()
count=0
a=0
for i in s:
if i=='A' or i=='C' or i=='G' or i=='T':
count+=1
if a<count:
a=count
else:
count=0
print(a) |
p03086 | s879477772 | 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)):
for r in range(l+1, len(S)+1):
if S[r-1] not in acgt:
ans = max(r-1-l, ans)
break
print(ans)
if __... |
p03086 | s228583836 | Wrong Answer | s=input()
print(s.count('A')+s.count('T')+s.count('G')+s.count('C')) |
p03086 | s676142530 | Wrong Answer | s = input()
t = ['A','C','G','T']
ans = 0
for i in s:
if i in t:
ans +=1
print(ans) |
p03086 | s980977066 | Wrong Answer | S=input()
L=['A','C','G','T']
no=0
x=0
for i in S:
if i in L:
x+=1
else:
x=0
ans=max(x,no)
print(ans)
|
p03086 | s235738334 | Wrong Answer | S = input()
ans = 0
for i in range(len(S)):
for j in range(i + 1, len(S)):
sub_s = S[i:j]
is_acgt = True
for s in sub_s:
if s == "A" or s == "C" or s == "G" or s == "T":
continue
else:
is_acgt = False
if is_acgt:
an... |
p03086 | s363081297 | Wrong Answer | s=input()
ans=0
tmp=0
l=['A','C','G','T']
for i in range(len(s)):
if l.count(s[i]) != 0:
tmp+=1
else:
ans=max(tmp,ans)
tmp=0
print(ans) |
p03086 | s915019472 | Wrong Answer | S = input()
N = len(S)
ACGT = []
others = 'BDEFHIJKLMNOPQRSUVWXYZ'
for i in range(N):
fl = True
for j in range(i+1,N):
tmp_S = S[i:j]
M = len(tmp_S)
for k in range(M):
if tmp_S[k] in others:
fl = False
if fl==False:
break
ACGT.appen... |
p03086 | s380641014 | Wrong Answer | import sys
input = sys.stdin.readline # 改行コード「\n」を呼んでしまうため、文字数など、注意！！
s = input().replace("\n","")
ans = 0
for i in range(len(s)):
cnt = 0
for j in range(i,len(s)-i):
# print(s[j])
if s[j] == 'A' or s[j] == 'C' or s[j] == 'G' or s[j] == 'T':
cnt += 1
if cnt > ans:
... |
p03086 | s171687633 | Wrong Answer | s = input()
left, right = 0, 0
ans = 0
for i in range(len(s)):
if s[i] in ["A", "G", "T", "C"]:
right += 1
else:
ans = max(ans, right - left)
right += 1
left = right
if left == 0:
ans = len(s)
print(ans) |
p03086 | s579873001 | Wrong Answer | s = input()
t = "BDEFHIJKLMNOPQRSUVWXYZ"
ans = ""
for x in s:
if x in t:
ans += "0"
else:
ans += x
print(len(max(ans.split("0"))))
|
p03086 | s442975601 | 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
print(ans)
|
p03086 | s115993592 | Wrong Answer | s = input()
max_value = 0
count = 0
for c in s:
if c in "ACGT":
count += 1
else:
max_value = max(max_value, count)
count = 0
print(max_value) |
p03086 | s492842159 | Wrong Answer | s = input()
a = [i for i in s]
cnt = [0]
count=0
for i in range(len(s)):
if a[i] == 'A' or a[i] == 'C' or a[i] == 'G' or a[i] == 'T':
count += 1
else:
cnt.append(count)
count = 0
print(max(cnt)) |
p03086 | s827429571 | Wrong Answer | S = input()
N = len(S)
l = []
for i in range(N):
for j in range(i,N):
s = S[i:j]
if s.strip("A C G T") == "":
l.append(s)
m = sorted(l, key=len)
print(m[-1])
|
p03086 | s470068564 | Wrong Answer | pattern = ["A", "T", "G", "C"]
s = input()
max_count = 0
count = 0
for i in range(len(s)):
if s[i] in pattern:
count+=1
else:
max_count = max(count, max_count)
count = 0
print(max_count) |
p03086 | s341386359 | Wrong Answer | import string
S = input()
target = set({'A', 'T', 'C', 'G'})
ss = ''
for i in range(len(S)):
for d in range(1, min(len(S) - i + 1, 10)):
SS = S[i:i+d]
flag = True
for c in string.ascii_letters:
if c.upper() in SS and c.upper() not in target:
flag = False
... |
p03086 | s188685494 | Wrong Answer | x = list(input())
y = 0
z = 0
for i in range(len(x)):
if x[i] in ['A', 'C', 'G', 'T']:
y += 1
else:
z = max (z,y)
y = 0
print(z) |
p03086 | s713375488 | Wrong Answer | import re
print(len(max(re.split(r'[^ACGT]',input())))) |
p03086 | s035973575 | Wrong Answer | 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)
|
p03086 | s609067260 | Wrong Answer | s = input()
lst = list(s)
cnt = 0
ans = 0
for i in s:
if i in "ATGC":
cnt += 1
else:
ans = max(cnt,ans)
cnt = 0
print(ans) |
p03086 | s428677680 | Wrong Answer | pattern = ["A", "T", "G", "C"]
s = input()
max_count = 0
count = 0
for c in s:
if c in pattern:
count += 1
else:
max_count = max(count, max_count)
count = 0
print(max_count)
|
p03086 | s163424368 | Wrong Answer | S=input()
s=[str(c) for c in(S)]
M=0
a=0
for i in range(len(s)):
if s[i]=='A' or s[i]=='G' or s[i]=='C' or s[i]=='T':
a+=1
else:
if M<a:
M=a
a=0
print(M) |
p03086 | s193043962 | Wrong Answer | s = list(input())
tmp = 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":
tmp += 1
else:
if tmp > ans:
ans = tmp
tmp = 0
print(ans) |
p03086 | s717034961 | Wrong Answer | s = input()
x = ["A","c","G","T"]
ans = 0
cnt = 0
for i in s:
if i not in x:
cnt += 1
else:
ans = max(ans,cnt)
cnt = 0
print(ans) |
p03086 | s548649112 | Wrong Answer | S = input()
N = len(S)
ACGT = []
others = 'BDEFHIJKLMNOPQRSUVWXYZ'
for i in range(N):
fl = True
for j in range(i+1,N+1):
tmp_S = S[i:j]
M = len(tmp_S)
for k in range(M):
if tmp_S[k] in others:
fl = False
if fl==False:
break
ACGT.app... |
p03086 | s166130721 | Wrong Answer | 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
print(maxl)
|
p03086 | s595825808 | 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 | s354324569 | Wrong Answer | s=input()
ans=0
f=0
preans=0
for i in s:
if i=="A"or i=="T"or i=="G"or i=="C" :
if f==0:
f=1
preans=1
else:
preans+=1
else:
ans=max(ans,preans)
f=0
print(ans) |
p03086 | s728649935 | Wrong Answer | s=input()
tmp, cnt = 0, 0
for i in range(12):
try:
if s[i] in {"A", "C", "G", "T"}:
tmp += 1
else:
cnt = max(cnt, tmp)
tmp = 0
except:
print(cnt)
exit()
|
p03086 | s345687700 | Wrong Answer | S = input()
cnt = 0
l = ['A', 'C', 'G', 'T']
for s in S:
res = False
for i in l:
if s == i:
cnt += 1
res = True
if cnt > 0 and res == False:
break
print(cnt) |
p03086 | s454989759 | Wrong Answer | 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 | s400863594 | Wrong Answer | s = input()
ans = 0
if len(s)==1:
if s.count("A")+s.count("G")+s.count("C")+s.count("T") == 1:
print(1)
exit()
for i in range(len(s)-1):
for j in range(i+1, len(s)+1):
x = s[i:j]
print(x)
if x.count("A")+x.count("G")+x.count("C")+x.count("T") == len(x) and len(x) > an... |
p03086 | s011942517 | Wrong Answer | S = input()
n = len(S)
ans = 0
flag = True
for i in range(n):
for j in range(i):
for k in range(i,n+1):
S_part = S[j:k]
for s in S_part:
if not s in "ACGT":
flag = False
if flag:
ans = max(ans,len(S_part))
flag = True
print(ans) |
p03086 | s817779039 | Wrong Answer | print(sum(1 for c in input() if c in 'AGCT'))
|
p03086 | s031438363 | Wrong Answer | s = input()
n = len(s)
dp = [0 for i in range(n+1)]
for i in range(n):
res = 0
if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':
res = 1
dp[i+1] = dp[i]+res
print(dp[n]) |
p03086 | s656093261 | 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):
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 > m... |
p03086 | s912380432 | Wrong Answer | S = input()
tmp = 0
atcgmax = 0
for i in range(len(S)):
if S[i] == 'A' or S[i] == 'T' or S[i] == 'C' or S[i] == 'G':
tmp += 1
else:
atcgmax = max(tmp,atcgmax)
tmp = 0
print(atcgmax) |
p03086 | s066180319 | Wrong Answer | S = input()
ans = 0
for i in range(len(S)):
for j in range(i+1, len(S)):
ok = True
for k in range(i, j+1):
if not (S[k] == "A" or S[k] == "C" or S[k] == "G" or S[k] == "T"):
ok = False
break
if ok:
ans = max(ans, j - i + 1)
print(ans)... |
p03086 | s775556425 | Wrong Answer | s = input()
count = 0
max_count = 0
for c in s:
if c in ['A','C','D','T']:
count = 0
else:
count += 1
if max_count < count:
max_count = count
print(max_count) |
p03086 | s924376156 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
t = 'ATGC'
ans = 0
S = input()
temp = 0
for s in S:
if s in t:
temp += 1
else:
ans = max(ans, temp)
print(ans)
if __name__ == '__main__':
main() |
p03086 | s751163986 | Wrong Answer | 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:
if maxlen<templen:
maxlen=templen
templen=0
... |
p03086 | s810340644 | Wrong Answer | S = input()
C = ['A','T','G','C']
ans = 0
tmp = 0
for i in range(len(S)):
if S[i] in C:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
print(ans) |
p03086 | s503816546 | Wrong Answer | S = input()
acgt = ['A', 'C', 'G', 'T']
ans, cnt = 0, 0
for i in range(len(S)):
if S[i] in acgt:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s851515398 | Wrong Answer | S=input()
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
print(cnt) |
p03086 | s312803653 | Wrong Answer | s = input()
l = len(s)
ans = 0
for i in range(l-1):
for j in range(i+1, l):
for ss in s[i:j]:
if ss not in 'ACGT':
break
else:
ans = max(ans, len(s[i:j]))
print(ans)
|
p03086 | s935134160 | Wrong Answer | s = input()
x = []
for i in range(2**(len(s)-1)):
tmp = [0]*(len(s)-1)
for j in range(len(s)-1):
if i >> j & 1:
tmp[j] = 1
x.append(tmp)
ans = []
temp = []
#print(x)
ss = ["A","T","G","C"]
for i in range(len(x)):
temp = []
for j in range(len(x[i])):
if(x[i][j] == 1 and s[j] in ss):
... |
p03086 | s499278501 | Wrong Answer | 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
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
print(ans) |
p03086 | s682648452 | Wrong Answer | 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(ans,cnt)
|
p03086 | s722465709 | 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
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 | s796784107 | Wrong Answer | 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 | s128956552 | Wrong Answer | s=input()
c=0
m=0
acgt=['A','C','G','T']
for e in s:
if e in acgt:
c+=1
else:
if c > m:
m=c
c=0
print(m) |
p03086 | s515024577 | Wrong Answer | s = input()
from re import findall
res = findall('[ACGT]*', s)
print(res) |
p03086 | s003314824 | Wrong Answer | S = list(input())
maxIndex = len(S)
result = 0
for index in range(len(S)):
counter = 0
for tmp in range(index, maxIndex):
if S[tmp] in ["A", "C", "G", "T"]:
counter += 1
if tmp + 1 == maxIndex:
if counter > result:
result = counter
... |
p03086 | s489117673 | Wrong Answer | 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:
ans = max(ans, cnt)
cnt = 0
print(ans)
|
p03086 | s737009943 | Wrong Answer | import re
split = re.split('[^ACGT]', input())
print(split)
print(max(map(len, split)))
|
p03086 | s689114020 | Wrong Answer | S = input()
cnt = 0
mcnt = 0
for i in S:
print(i)
if i == 'A' or i == 'C' or i == 'G' or i == 'T':
cnt += 1
mcnt = max(mcnt,cnt)
print(mcnt)
|
p03086 | s998865481 | Wrong Answer | import sys
import re
S = input()
if not ( 1 <= len(S) <= 10 ): sys.exit()
if not S.isupper: sys.exit()
result = 0
max = max(re.findall('[A|T|G|C]+', S)) if re.findall('[A|T|G|C]+', S) else ''
if len(max) > 0:result = len(max)
print(result) |
p03086 | s872191182 | Wrong Answer | S=input()
ACGT=['A','C','G','T']
ans=0
tmp=0
for s in S:
if tmp==0:
if s in ACGT: tmp+=1
else:
if s in ACGT:
tmp+=1
if tmp>ans: ans=tmp
else:
tmp=0
print(ans) |
p03086 | s835350150 | Wrong Answer | S = input()
ans = 0
l = 0
for s in S:
if s in ['A', 'T', 'C', 'G']:
l += 1
else:
ans = max(ans, l)
l = 0
print(ans) |
p03086 | s256014386 | Wrong Answer | checklist=["A","C","G","T"]
sn = list(input())
answer = 0
count = 0
for i in range(len(sn)) :
if sn[i] in checklist:
count += 1
else :
answer = max(answer,count)
count = 0
print(answer) |
p03086 | s631390966 | Wrong Answer | S = input()
ACGT = ['A', 'C', 'G', 'T']
ans = [0] * len(S)
for i in range(len(S)):
if S[i] in ACGT:
cnt = 1
for j in range(len(S) - i - 1):
if S[i+j+1] in ACGT:
cnt += 1
else:
ans[i] = cnt
break
print(max(ans)) |
p03086 | s277012639 | Wrong Answer | s=input()
ans=0
ctn=0
for i in range(len(s)):
if s[i]=="A" or s[i]=="T" or s[i]=="G" or s[i]=="C":
ctn+=1
else:
ans=max(ans,ctn)
ctn=0
print(ans) |
p03086 | s839805554 | Wrong Answer | s = input()
l,r = 0,0
ma = 0
for l in range(len(s)):
if(s[l] not in ['A','C','G','T']):continue
for r in range(l,len(s)):
if(s[r] not in ['A','C','G','T']):break
ma = max(ma,len(s[l:r]))
print(ma) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.