problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s288507640 | Wrong Answer | S = input()
ls = len(S)
count = 0
ans = 0
for i in range(ls):
if S[i] == 'A' or S[i] == 'T' or S[i] == 'G' or S[i] == 'C':
count += 1
else:
if count >= ans:
ans = count
count = 0
print(ans) |
p03086 | s705460949 | Wrong Answer | s='A'
clist=['A','C','G','T']
count=0
a=[]
for i in s:
if i in clist:
count+=1
else:
a.append(count)
count=0
a.append(count)
print(max(a)) |
p03086 | s604958930 | 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
if count>record:
record = count
print(record) |
p03086 | s485840128 | 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
break
print(ans) |
p03086 | s917023254 | Wrong Answer | s = input()
cnt = 0
ans = 0
for x in s:
if x in ['A', 'C', 'G', 'T']:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s837860982 | 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
else:
if count > count_max:
count_max = count
print(count_max) |
p03086 | s133302126 | Wrong Answer | S = input ()
S = S.replace('A', 'a')
S = S.replace('T', 'a')
S = S.replace('C', 'a')
S = S.replace('G', 'a')
ans = 0
x = 0
for i in range (len(S)):
if S[i] == 'a':
x += 1
else:
if ans < x:
ans = x
print (ans) |
p03086 | s092263124 | Wrong Answer | S = input()
L = len(S)
ACGT = ['A', 'C', 'G', 'T']
ans = 0
for i in range(L):
for j in range(i+1, 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 | s879621198 | Wrong Answer | 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 = ''
print(len(output)) |
p03086 | s721613797 | Wrong Answer | S = list(input())
c = 0
ans = 0
for i in S:
if i=='A' or i=='C' or i=='G' or i=='T':
c += 1
else:
if ans < c:
ans = c
c = 0
print(ans) |
p03086 | s970280106 | Wrong Answer | s = input()
cnt = 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':
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans)
|
p03086 | s681583954 | Wrong Answer | S = input()
t, m = 0, 0
for s in S:
if s in ["A", "C", "G", "T"]:
t += 1
else:
m = max(m, t)
t = 0
print(m) |
p03086 | s917726053 | Wrong Answer | def main():
# n = int(input())
# n, m = map(int, input().split())
# a = list(map(int, input().split()))
s = input()
# h = [int(input()) for _ in rane(n)]
count = 0
maxi = 0
for string in s:
if string == "A" or string == "C" or string == "G" or string == "T":
count += ... |
p03086 | s994102308 | Wrong Answer | S = list(input())
ACGT = ["A", "C", "G", "T"]
count = 0
Max = 0
if len(S) == 1:
if S in ACGT:
print(1)
else:
print(0)
else:
for s in S:
if s in ACGT:
count += 1
if count > Max:
Max = count
else:
if count > Max:
... |
p03086 | s303168195 | Wrong Answer | 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
print(max(ACGT)) |
p03086 | s965077945 | Wrong Answer | s = list(input())
acgt = ['A', 'C', 'G', 'T']
c = 0
m = 0
for i in range(len(s)):
if not s[i] in acgt:
if m < c:
m = c
c = 0
else:
c += 1
print(m)
|
p03086 | s162211612 | Wrong Answer | S = input()
cnt = 0
ans = 0
for s in S:
if s in ['A', 'C', 'G', 'T']:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s304741933 | Wrong Answer | S = list(input())
cnt=0
ans=0
for x in S:
if x=="A" or x=="C" or x=="G" or x=="T":
cnt+=1
else:
if ans < cnt:
ans = cnt
cnt=0
print(ans) |
p03086 | s561308947 | Wrong Answer | import itertools
S = list(input())
Idxs = list(itertools.combinations(range(len(S)), 2))
def ACGT(Word):
for w in Word:
if w not in ["A", "C", "G", "T"]:
return 0
return len(Word)
ans = 0
for idx in Idxs:
tmp = S[idx[0]:idx[1]]
ans = max(ans, ACGT(tmp))
print(ans) |
p03086 | s386617044 | Wrong Answer | s = input()
n = len(s)
ans = 0
res = 0
for i in range(n):
if s[i] in ['A','C','G','T']:
res += 1
else:
ans = max(ans,res)
res = 0
print(ans)
|
p03086 | s257813203 | Wrong Answer | s = input()
list_s = list(s)
ans = 0
for c in list_s:
if c == "A" or c == "C" or c == "G" or c == "T":
ans += 1
print(ans) |
p03086 | s119515402 | Wrong Answer | S = input()
max_len = 0
for i in range(len(S)):
for j in range(i, len(S)):
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 | s464148933 | Wrong Answer | a = input()
ans = []
count = 0
for i in range(len(a)):
if a[i] == 'A':
count +=1
elif a[i] == 'C':
count+=1
elif a[i] == 'G':
count+=1
elif a[i] == 'T':
count+=1
else:
ans.append(count)
count = 0
if len(ans) == 0:
ans.append(count)
print(max(ans)) |
p03086 | s828200445 | Wrong Answer | 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
print(ans)
for i in ans:
if set(i) <= set(d):
x.append(len(i))
else:
pass
if x:
print(max(x))
else:
print(0) |
p03086 | s212935830 | Wrong Answer | s = input()
count = 0
count_max = 0
for k in range(len(s)):
if s[k] == "A" or s[k] == "C" or s[k] == "G" or s[k] == "T":
count += 1
else:
if count_max < count:
count_max = count
else:
count = 0
print(count_max) |
p03086 | s913884562 | 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(1,len(s)-2):
for j in range(i,len(s)-1):
if 0 not in s[i:j+1]:
ans.append(j+1-i)
if ans == []:
print(0)
else:
print(max(ans)) |
p03086 | s407328882 | Wrong Answer | S = input()
L = [s in "ACGT" for s in S]
ans, cnt = 0, 0
for l in L:
if l == True:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s433741540 | Wrong Answer | S = input()
cnt = 0
cntmax = 0
for i in range(len(S)):
if S[i] == "A" or S[i] == "T" or S[i] == "G" or S[i] == "C":
cnt+=1
if cnt>cntmax:
cntmax = cnt
print(cntmax) |
p03086 | s215917442 | Wrong Answer | s = input()
n = len(s)
ans = 0
for i in range(n-1):
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 | s285878832 | Wrong Answer | # ABC122
# B ATCoder
# ACGT
S =input()
ct = 0
ctM = [0]
for i in range(len(S)):
if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":
ct +=1
else:
ctM.append(ct)
ct = 0
print(max(ctM))
|
p03086 | s988760571 | Wrong Answer | a=input()
count=0
s=0
for i in range(len(a)):
if a[i]=='A' or a[i]=='T' or a[i]=='C' or a[i]=='G':
count+=1
else:
if count>s:
s=count
count=0
print(s)
|
p03086 | s722884877 | Wrong Answer | S=list(input())
p=0;q=0
for i in range(len(S)):
for j in range(i,len(S)):
if S[j]=="A" or S[j]=="C" or S[j]=="G" or S[j]=="T":
q=q+1
p=max(p,q)
else:
q=0
break
print(p) |
p03086 | s275870648 | Wrong Answer | S=input()
ans=0
for i in range(len(S)):
tmp=0
if S[i] in ("A","C","G","T"):
tmp+=1
else:
ans=max(ans,tmp)
tmp=0
print(ans) |
p03086 | s188856934 | Wrong Answer | l = ['A','T','C','G']
s = ''
tmp =''
for i in input():
if i in l:
s+=i
else:
if len(s) > len(tmp):
tmp = s
s =''
print(len(tmp)) |
p03086 | s515791101 | Wrong Answer | S = input()
ans = 0
ACGT = 0
for i in range(len(S)):
if S[i]=='A' or S[i]=='G' or S[i]=='C' or S[i]=='T':
ACGT += 1
else:
ans = max(ans,ACGT)
ACGT = 0
print(ans)
|
p03086 | s362697058 | Wrong Answer | S = input()
N = len(S)
ACGT = ['A', 'C', 'G', 'T']
count_list = []
count = 0
if S[0] in ACGT:
count += 1
for i in range(1, N):
if S[i] in ACGT:
count += 1
else:
if count > 0:
count_list.append(count)
count = 0
if len(count_list) > 0:
ans = max(count_list)
else:
... |
p03086 | s575967905 | Wrong Answer | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
strings = input()
answers=[]
counter=0
for string in strings:
if "A" in string or "C" in string or "G" in string or "T" in string:
counter+=1
else:
answers.append(counter)
counter=0
... |
p03086 | s157989568 | Wrong Answer | s=input()
import re
ans=re.search("(A|T|G|C)+",s)#matchは文字列先頭のみ、searchは文字列中の位置にかかわらずマッチ。
if ans==None:#noneでエラーが出かねないので事前に排除しておく。
print(0)
else:
print(len(ans.group(0)))#何も指定しなければ貪欲マッチで一番長くなるはず。
|
p03086 | s382232178 | Wrong Answer | S = input()
st = set(['A', 'C', 'G', 'T'])
ans, tmp = 0, 0
for s in S:
if s in st:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
print(ans) |
p03086 | s005017720 | Wrong Answer | import re
pattern = re.compile('[ACGT]+')
S = input()
print(re.findall(pattern, S))
print(len(max(re.findall(pattern, S), key=len, default=''))) |
p03086 | s559437881 | Wrong Answer | S=str(input())
S2=[]
ans=0
for i in range(len(S)):
for j in range(len(S)+1):
S2=S[i:j]
print(S2)
que=len(S2)
S2=S2.replace("A","")
S2=S2.replace("G","")
S2=S2.replace("C","")
S2=S2.replace("T","")
if S2=="":
if que>ans:
ans=que
S2=[]
print(ans) |
p03086 | s456533660 | Wrong Answer | #ABC122B
def main():
import sys
S = sys.stdin.readline().rstrip()
#print(S)
L = ['A', 'C', 'G', 'T']
cnt, ans = 0, 0
for s in S:
if s in L:
cnt+=1
else:
if ans < cnt:
ans = cnt
#print(ans)
cnt=0
print(ans)
if _... |
p03086 | s776640719 | Wrong Answer | S = input()
ans = 0
ans_lis = [0]
for i in range(0,len(S)-1):
if S[i] in "ACGT":
ans = ans + 1
else:
ans_lis.append(ans)
ans = 0
ans_lis.append(ans)
print(max(ans_lis)) |
p03086 | s308173699 | Wrong Answer | s = input()
chrlis = []
for i in range(len(s)):
if s[i]=="A" or s[i]=="C" or s[i]=="G" or s[i]=="T":
start = i
for j in range(i,len(s)):
if s[j]=="A" or s[j]=="C" or s[j]=="G" or s[j]=="T":
end = j
else:
break
else:
continue
chrlis.append(s[start:end+1])
ans = 0
for i in r... |
p03086 | s421348994 | Wrong Answer | import sys
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = read()
count=0
cnt_max=0
for i in range(len(S)):
if S[i] in ['A', 'C', 'G', 'T']:
count +=1
else:
cnt_max = max(cnt_max,count)
count=0
print(cnt_max)
|
p03086 | s451413107 | 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 | s727011385 | Wrong Answer | s = input()
word = ['A', 'C', 'G', 'T']
count = 0
tmp = 0
for i in s:
if word.count(i) == 1:
tmp += 1
else:
tmp = 0
if count < tmp:
count += tmp
print(count) |
p03086 | s142745298 | Wrong Answer | s = input()
ans = 0
cnt = 0
for i in s:
if i in 'ATCG':
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s721219895 | Wrong Answer | S = input()
N = len(S)
ans = 0
for i in range(N):
for j in range(i+1, N):
is_ACGT = True
for k in range(i, j+1):
if S[k] not in ['A', 'C', 'G', 'T']:
is_ACGT = False
break
if is_ACGT:
ans = max(ans, j-i+1)
print(ans) |
p03086 | s599313237 | Wrong Answer | s = input()
ans1 = 0
ans2 = 0
for a in s:
if a == "A" or a == "T" or a == "C" or a == "G":
ans2 += 1
else:
if ans1 < ans2:
ans1 = ans2
ans2 = 0
else:
ans2 = 0
print(ans1) |
p03086 | s464849792 | Wrong Answer | S = input()
cnt = 0
max_cnt = 0
for i in S:
if i == "A" or "C" or "G" or "T":
cnt +=1
if cnt > max_cnt:
max_cnt = cnt
else:
cnt = 0
print(max_cnt)
|
p03086 | s470413940 | 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 | s002783825 | Wrong Answer | s = list(input())
t = ["A", "C", "G", "T"]
c, m = 0, 0
for i in s:
if i in t:
c += 1
else:
if m < c:
m = c
c = 0
print(m) |
p03086 | s753346010 | Wrong Answer | S = input()
ma = 0
ma_ = 0
for c in S:
if c == 'A' or c == 'C' or c == 'G' or c == 'T':
ma_ += 1
else:
ma = max(ma, ma_)
ma_ = 0
print(ma)
|
p03086 | s896222347 | Wrong Answer | #python3
def main():
s = input()
n = len(s)
ans = 0
cnt = 0
for i in range(n-1):
if not ((s[i] == 'A') or (s[i] == 'T') or (s[i] == 'C') or (s[i] == 'G')):
cnt = 0
else:
cnt += 1
ans = max(cnt, ans)
print(ans)
main() |
p03086 | s814276570 | Wrong Answer | S = input()
ACGT = 'A C G T'.split()
result = 0
tmp = 0
for i in S:
if i in ACGT:
tmp += 1
else:
if tmp > result:
result = tmp
tmp = 0
print(result)
|
p03086 | s803631324 | Wrong Answer | s = input()
ans = 0
for l in range (len(s)-1):
for r in range(l+1, len(s)+2):
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 | s828564615 | Wrong Answer | S = list(input())
ls = len(S)
ans = 0
now = 0
for i in range(ls):
if S[i] in {"A", "C", "G", "T"}:
now += 1
else:
ans = max(ans, now)
now = 0
print(ans) |
p03086 | s401109413 | Wrong Answer | import re
s = input()
ans = ""
tmp_ans = ""
for i in range(len(s)):
if re.fullmatch(r"[ATGC]", s[i]):
tmp_ans += s[i]
else:
if len(ans) < len(tmp_ans):
ans = tmp_ans
tmp_ans = ""
print(len(ans))
|
p03086 | s142848325 | Wrong Answer | s = input()
ans = 0
a = 0
for i in s:
if i in ["A","C","G","T"]:
a += 1
else:
ans = max(ans,a)
a = 0
print(ans) |
p03086 | s965320920 | Wrong Answer | S = input()
count = 0
max = 0
ans = 0
for i in range(len(S)):
if S[i] != "A" and S[i] != "C" and S[i] != "G" and S[i] != "T":
max = count
count = 0
if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":
count += 1
print(i,count)
if max > ans:
ans = max
print(ans) |
p03086 | s559256308 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
S = input()
result = 0
for i in range(len(S)):
for j in range(len(S)):
if len(set(list(S[i:j])) - set(['A', 'C', 'G', 'T'])) == 0:
if result < len(list(S[i:j])):
result = len(list(S[i:j]))
... |
p03086 | s430516439 | 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])-P == set():
count = max(count,j-i)
print(count) |
p03086 | s686347005 | Wrong Answer | s = input()
res, ans = 0, 0
for i in s:
if i == "A" or i == "C" or i == "G" or i == "T":
res += 1
else:
ans = max(res, ans)
res = 0
print(ans) |
p03086 | s002688374 | 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 | s532452426 | Wrong Answer | s = input()
lst = ["A", "C", "G", "T"]
flag = 0
cnt = 0
cnt_lst = []
for i in s:
if flag:
if i not in lst:
cnt_lst.append(cnt)
flag = 0
cnt = 0
else:
cnt += 1
else:
if i in lst:
flag = 1
cnt += 1
print(max(cnt_lst)... |
p03086 | s388746927 | Wrong Answer | S = input()
ans=0
res=0
for i in range(0, len(S)):
if(S[i]=='A' or S[i]=='C' or S[i]=='G' or S[i]=='T'):
res+=1
else:
ans = max(res, ans)
print(ans) |
p03086 | s282440781 | Wrong Answer | # -*- coding: utf-8 -*-
s = input()
max_length=0
length=0
for c in s:
if c in 'AGCT':
length+=1
else:
max_length=max(max_length, length)
length=0
print(max_length) |
p03086 | s340321915 | Wrong Answer | S=input()
ACGT=["A","C","G","T"]
ans=0
count=0
for x in S:
if x in ACGT:
count+=1
else:
ans=max(ans,count)
count=0
print(ans)
|
p03086 | s199938178 | Wrong Answer | S=str(input())
lst=['A','C','G','T']
cnt=0
for s in S:
if s in lst:
cnt+=1
print(cnt) |
p03086 | s468086447 | Wrong Answer | def main():
# n = int(input())
# n, m = map(int, input().split())
# a = list(map(int, input().split()))
s = input()
# h = [int(input()) for _ in rane(n)]
count = 0
maxi = 0
for string in s:
if string == "A" or string == "C" or string == "G" or string == "T":
count += ... |
p03086 | s930642477 | Wrong Answer | s = list(input())
cnt,ans = 0,[]
agct = ["A","G","C","T"]
for i in range(len(s)):
if s[i] in agct:
cnt += 1
else:
ans.append(cnt)
cnt = 0
if ans == []:
ans.append(0)
for j in ans:
if j == 1:
j = 0
print(max(ans))
|
p03086 | s001248600 | Wrong Answer | s = input()
possible_answers = [0]
possible_answer = 0
acgt = ['A', 'C', 'G', 'T']
for i in range(len(s)):
if s[i] in acgt:
possible_answer += 1
else:
possible_answers.append(possible_answer)
possible_answer = 0
print(max(possible_answers)) |
p03086 | s951885899 | Wrong Answer | import re
s=input()
ans=re.findall(r"((A|T|G|C)+)",s)#先に(が手てくる方から行列が形成される。
if ans==[]:#リストではなくてタプルなので注意・
print(0)
else:
print(len(max(ans[0],key=len))) |
p03086 | s898299378 | 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)
print(ans) |
p03086 | s444747614 | Wrong Answer | s=input()
ans=0
for i in range(len(s)-1):
for j in range(i,len(s)):
if s[i:j].count("A")+s[i:j].count("T")+s[i:j].count("C")+s[i:j].count("G")==len(s[i:j]):
ans=max(ans,len(s[i:j]))
print(ans) |
p03086 | s395263448 | Wrong Answer | s=input()
cnt=0
temp=0
for i in s:
if i in 'ATGC':
temp+=1
continue
if cnt<temp:cnt=temp
temp=0
print(cnt) |
p03086 | s042313434 | Wrong Answer | S=input()
N=len(S)
ans=0
d=set(list("AGCT"))
for i in range(N+1):
for j in range(N+1):
s=S[i:j]
print(s)
if set(list(s))<=d:
ans=max(ans,len(s))
print(ans) |
p03086 | s764042058 | Wrong Answer | S = input()
acgt = ["A","C","G","T"]
ans = 0
ok = False
tmp = 0
for s in S:
if not ok:
if s in acgt:
ok = True
tmp += 1
else:
pass
elif ok:
if s in acgt:
tmp += 1
else:
ok = False
ans = max(tmp,ans)
... |
p03086 | s466988967 | 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
else:
... |
p03086 | s663113258 | Wrong Answer | s = input()
mx = 0
n = len(s)
kensa = ["A", "C", "G", "T"]
for i in range(n):
for j in range(i,n-1):
mj = s[i:j+1]
bl = True
for l in range(len(mj)):
if mj[l] not in kensa:
bl = False
break
if bl and mx<len(mj):
mx = len(mj)
... |
p03086 | s930818276 | Wrong Answer | b = input()
base_pairs = {
'A': 'T',
'C': 'G',
'G': 'C',
'T': 'A',
}
pair = base_pairs.get(b)
print(pair)
|
p03086 | s796258386 | Wrong Answer | 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
print(ans)
|
p03086 | s740219922 | Wrong Answer | pattern = ["A", "T", "G", "C"]
s = input()
max_count = 0
count = 0
for c in s:
if s in pattern:
count += 1
else:
max_count = max(count, max_count)
count = 0
max_count = max(count, max_count)
print(max_count)
|
p03086 | s509766341 | Wrong Answer | S = input()
cnt = 0
mcnt = 0
for i in S:
if i == 'A' or i == 'C' or i == 'G' or i == 'T':
cnt += 1
mcnt = max(mcnt,cnt)
print(mcnt)
|
p03086 | s148509478 | Wrong Answer | 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)
print(maxx) |
p03086 | s065085711 | 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+1):
part.append(S[i:i+j])
max_s = 0
print(part)
for i in part:
for j in str_up:
if j in i:
break
... |
p03086 | s653772724 | Wrong Answer | S = input()
m = 0
for i in range(len(S)):
for j in range(i, len(S)):
if S[j] not in ["A", "C", "G", "T"]:
m = max(m, j-i)
break
print(m) |
p03086 | s347303706 | Wrong Answer | S = input()
ans = 0
for s in S:
if s in ["A", "C", "G", "T"]:
ans += 1
print(ans) |
p03086 | s885109274 | Wrong Answer | s = input()
ans = 0
leng = 0
t = ('A','C','G','T')
for i in range(len(s)):
if s[i] in t:
leng += 1
else:
ans = max(ans,leng)
leng = 0
print(ans)
|
p03086 | s597446932 | Wrong Answer | s = input()
ans = 0
for l in range (len(s)-1):
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 | s411160526 | Wrong Answer | b=list(str(input()))
E={"A":"T","T":"A","C":"G","G":"C"}
count=0
ans=0
for moji in b:
if moji in E:
count+=1
else:
ans=max(ans,count)
count=0
print(ans) |
p03086 | s238080455 | Wrong Answer | S = list(input())
ans = 0
ans_ = 0
for s in S:
if s=="A" or s=="C" or s=="G" or s=="T":
ans_ += 1
else:
if ans < ans_:
ans = ans_
ans_ = 0
print(ans)
|
p03086 | s454599410 | 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):
S_part = S[j:k+1]
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 | s377402633 | Wrong Answer | S = input()
l = len(S)
count=0
ans= 0
for i in range(l):
if S[i] in ["A" ,"C" ,"G","T"]:
count +=1
ans = max(count,ans)
print(ans) |
p03086 | s439444987 | Wrong Answer | S = input()
Count = [0 for _ in range(len(S))]
count = 0
reset = 1
for i, s in enumerate(S):
if s in 'ACGT':
if reset == 0:
count += 1
Count[i] = count
reset = 0
else:
count += 1
Count[i] = 1
reset = 0
else:
reset =... |
p03086 | s717965975 | 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) 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 += ... |
p03086 | s723331128 | Wrong Answer | 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
else:
print("0") |
p03086 | s982557611 | Wrong Answer | print(len(input().replace("A","").replace("G","").replace("C","").replace("T","")))
|
p03086 | s915290341 | Wrong Answer | s=input()
#for i in range(len(s),0,-1):
# for j in range(0,len(s)-i+1):
# #print(j,i+j)
# s1=s[j:i+j:]
m=0
s1=""
for x in s:
if x=='A' or x=='G' or x=='T' or x=='C':
s1+=x
else:
m=max(m,len(s1))
s1=""
print(m)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.