problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03086 | s125298029 | Wrong Answer | import re
s = input()
len_s = len(s)
max_ACGT = 0
for i in range(len_s):
for j in range(i + 1, len_s):
partial_s = s[i:j]
if len(re.findall('A|C|G|T', partial_s)) == len(partial_s) and len(partial_s) > max_ACGT:
max_ACGT = len(partial_s)
print(max_ACGT)
|
p03086 | s378455409 | Wrong Answer | s=input()
l=len(s)
ans=0
for i in range(l):
if s[i] in ['A','T','G','C']:
ans+=1
print(ans) |
p03086 | s499895857 | Wrong Answer | import sys
input = sys.stdin.readline
def read():
S = input().strip()
return S,
def solve(S):
alphabets = ['A', 'C', 'G', 'T']
max_count = 0
count = 0
for s in S:
if s in alphabets:
count += 1
else:
max_count = max(max_count, count)
count =... |
p03086 | s155108561 | Wrong Answer | s=input()
le=len(s)
lis=[]
for i in range(0,le):
if s[i]!="A" and s[i]!="" and s[i]!="T" and s[i]!="G":
lis.append(i)
lo=0
for j in range(0,len(lis)-1):
if lis[j+1]-lis[j]-1>=lo:
lo=lis[j+1]-lis[j]-1
print(lo) |
p03086 | s008376708 | Wrong Answer | s = input()
L = "ACGT"
ans = ""
ss = ""
for i in range(len(s)):
if s[i] in L:
ans += s[i]
flag = True
else:
if len(ans)>len(ss):
ss = ans
break
print(len(ss)) |
p03086 | s679847765 | Wrong Answer | S = input().strip()
L = len(S)
if len(set(list(S+"ATGC"))) == 4:
print(L)
exit()
l = L-1
while True:
for i in range(L-l):
if len(set(list(S[i:i+l]+"ATGC"))) == 4:
print(l)
exit()
l -= 1
|
p03086 | s615068217 | 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+1]:
if str not in ['A','C','G','T']:
cnt = 0
break
else:
cnt += 1
ans = max(ans, cnt)
print(ans)
|
p03086 | s807365745 | 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 | s055141738 | Wrong Answer | S=input()
acgt=["A","C","G","T"]
max_length = 0
length = 0
for word in S:
if word in acgt:
length+=1
else:
if length!=0:
if max_length<length:
max_length=length
length=0
print(max_length)
|
p03086 | s222501796 | Wrong Answer | def resolve():
S = input()
cnt = 0
maxC = 0
for s in S:
if s in "ACGT":
cnt += 1
else:
maxC = max(maxC, cnt)
cnt = 0
print(maxC)
resolve()
|
p03086 | s348143657 | Wrong Answer | s = input()
i = 0
ans = 0
while i < len(s):
if s[i] == "A" or s[i] == "T" or s[i] == "C" or s[i] == "G":
for j in range(len(s) - i):
if s[i + j] != "A" and s[i + j] != "T" and s[i + j] != "C" and s[i + j] != "G":
break
ans = max(ans, j)
i += 1
print(ans)... |
p03086 | s108117766 | Wrong Answer | s = list(input())
ans = 0
cnt = 0
for i in range(len(s)):
if s[i] not in ["A", "C", "G", "T"]:
ans = max(ans, cnt)
cnt = 0
else:
cnt += 1
print(ans) |
p03086 | s852354175 | Wrong Answer | check = ["A", "C", "G", "T"]
s = input()
ans = 0
tmp = 0
for i in range(len(s)):
if s[i] in check:
tmp += 1
else:
ans = max(ans,tmp)
tmp = 0
print(ans) |
p03086 | s335552160 | 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 | s447996478 | Wrong Answer | s =input()
l =len(s)
count=0
for i in range(l):
x =s[i]
if x =='A' or x =='C' or x =='G' or x =='T':
count +=1
for j in range(i+1, l):
x =s[j]
if x =='A' or x =='C' or x =='G' or x =='T':
count +=1
else:
break
print(count)
|
p03086 | s894397092 | Wrong Answer | S = input()
max_length = 0
length = 0
for s in S:
if s in ["A", "C", "G", "T"]:
length += 1
else:
if length > max_length:
max_length = length
length = 0
print(max_length) |
p03086 | s443608484 | Wrong Answer | import re
pattern = re.compile('[ACGT]+')
S = input()
print(len(max(re.findall(pattern, S), default='')))
|
p03086 | s586464292 | 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 & mx<len(mj):
mx = len(mj)
pr... |
p03086 | s128072161 | 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 | s790950741 | Wrong Answer | 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
else:
if max_word < count:
max_word = count
count = 0
print(max_word) |
p03086 | s853027064 | Wrong Answer | a = list(input())
ans = []
count = 0
for i in a:
if i == 'A':
count +=1
elif i == 'C':
count+=1
elif i == 'G':
count+=1
elif i == 'T':
count+=1
else:
ans.append(count)
count = 0
if len(ans) == 0:
ans.append(count)
print(max(ans)) |
p03086 | s491254358 | Wrong Answer | acgt = ['A', 'T', 'G', 'C']
word = input()
res = 0
count = 0
for s in word:
if s in acgt:
count += 1
elif res < count:
res = count
print(res)
|
p03086 | s646884533 | Wrong Answer | import re
S=input()
ans = sorted((re.findall("[AGCT]*", S)), reverse=True, key=len)
print(ans[0]) |
p03086 | s359991239 | 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 | s269397793 | 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
elif i != "A" and i != "C" and i != "G" and i != "T":
ans = max(ans,cnt)
cnt = 0
print(ans)
|
p03086 | s720053811 | Wrong Answer | S=input()
l=len(S)
x=['A','C','G','T']
a=0
m=0
for i in range(l):
if S[i] in x:
a+=1
else:
if a>m:
m=a
a=0
print(m) |
p03086 | s915426104 | Wrong Answer | s = list(input())
count = [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 | s557431254 | Wrong Answer | s = list(input())
l = len(s)
a=0
m=0
for i in range(l):
if s[i]=='A' or s[i]=='C' or s[i]=='G' or s[i]=='T':
a+=1
else:
a = max(m, a)
print(a) |
p03086 | s378941650 | Wrong Answer | S = input()
S = list(S)
str_max = 0
for start in range(len(S)):
for end in range(start, len(S)+1):
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 | s780035780 | Wrong Answer | s=input()
tmp = 0
ans = -1
flg= 1
for i in range(len(s) -1):
if s[i] in ["A","G","C","T"]:
tmp += 1
else:
if ans <= tmp:
ans = tmp
flg = 0
tmp = 0
if s[-1] in ["A","G","C","T"]:
ans = max(ans, tmp +1)
print(ans if flg==0 else tmp) |
p03086 | s466968443 | Wrong Answer | ans = []
cnt = 0
for s in input():
if not s in "ACGT":
ans.append(cnt)
continue
cnt += 1
ans.append(cnt)
print(max(ans) ) |
p03086 | s183195896 | Wrong Answer | if __name__ == "__main__":
S = input()
word_arr = ["A","T","G","C"]
max_count,count = 0,0
for c in S:
if c in word_arr:
count += 1
else:
max_count = max(count,max_count)
count = 0
print(max_count) |
p03086 | s403106792 | Wrong Answer | try:
S = input()
count = 0
res = []
for i in range(len(S)):
if S[i] in ["A", "C", "G", "T"]:
count += 1
else:
res.append(count)
count = 0
print(max(res))
except:
print(0)
|
p03086 | s942630359 | Wrong Answer | s = input()
cnt = 0
li = [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:
li.append(cnt)
cnt = 0
print(max(li)) |
p03086 | s732984580 | Wrong Answer | checklist=["A","C","G","T"]
sn = list(input())
answer = 0
count = 0
for s in sn :
if s in checklist:
count += 1
else :
answer = max(answer,count)
count = 0
print(answer)
print(sn) |
p03086 | s934733134 | Wrong Answer | s = input()
n = len(s)
acgt = ["A", "C", "G", "T"]
ans = 0
cnt = 0
for i in range(n):
if s[i] in acgt:
cnt += 1
#print(ans, cnt, i)
else:
ans = max(ans, cnt)
#print(ans, cnt, i)
cnt = 0
print(ans)
|
p03086 | s256614568 | 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],M)
print(M)
|
p03086 | s857085512 | Wrong Answer | S = list(input())
ACGT = ["A", "C", "G", "T"]
count = 0
Max = 0
for s in S:
if s in ACGT:
count += 1
else:
if count > Max:
Max = count
count = 0
print(Max) |
p03086 | s606777747 | Wrong Answer | def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [[input().split()] for _ in range(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in ... |
p03086 | s568407878 | Wrong Answer | S=input()
count=0
max_count=-1
for i in range(len(S)):
if S[i]=="A" or S[i]=="C" or S[i]=="G" or S[i]=="T":
count=count+1
else:
if max_count<count:
max_count=count
count=0
print(max_count) |
p03086 | s564246739 | 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 | s240232985 | Wrong Answer | s = list(input())
ans = []
for mozi in s:
if(mozi == "A" or mozi == "G" or mozi == "C" or mozi == "T"):
ans.append(mozi)
else:
break
print("".join(ans)) |
p03086 | s218701101 | Wrong Answer | s = input()
c = []
x = ["A","G","C","T"]
for i in range(0,len(s)-1):
if(s[i] in x):
t = 1
for j in range(i+1,len(s)):
if(s[j] in x):
t = t + 1
elif(s[j] not in x or j == len(s)):
c.append(t)
if(len(c)==0):
c.append(0)
print(max(c))
|
p03086 | s085559014 | 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) |
p03086 | s059902808 | Wrong Answer | S = input()
l = len(S)
max_cnt = 0
for i in range(l):
for j in range(i, l):
max_cnt = max(sum([1 if s == "A" or s == "C" or s == "G" or s == "T" else 0 for s in S[i : j + 1]]), max_cnt)
print(max_cnt) |
p03086 | s082302745 | Wrong Answer | s = input().strip()
ans = 0
tmp = 0
for _, x in enumerate(s):
if x == "A" or x == "C" or x == "G" or x == "T":
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
print(ans)
|
p03086 | s775184002 | Wrong Answer | S = input()
ans = 0
for i in range(len(S)):
tmp = 0
for j in range(len(S)):
if 'ACGT'.count(S[j]) == 1:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
print(ans) |
p03086 | s535837314 | Wrong Answer |
def main():
s = input()
ans = 0
seq = 0
for c in s:
if c == 'A' or c == 'C' or c == 'T' or c == 'G':
seq+=1
else:
ans = max(ans,seq)
seq=0
print(ans)
if __name__ == '__main__':
main() |
p03086 | s453347107 | Wrong Answer |
s = list(input())
ans = 0
tmp = []
for i in range(len(s)):
for j in range(1,len(s)-i):
tmp = s[i:(-1)*j]
# print(tmp)
# print(tmp.count("A"))
# print(tmp.count("C"))
# print(tmp.count("G"))
# print(tmp.count("T"))
if tmp.count("A") + tmp.count("C") + tmp.count(... |
p03086 | s488897409 | Wrong Answer | S=input()
flag =0
ans =0
for i in range(len(S)):
for j in range(len(S)-i):
if S[i+j] == 'A' or S[i+j] == 'G' or S[i+j] == 'T' or S[i+j] == 'C':
flag +=1
else:
ans = max(ans,flag)
flag =0
break
print(ans) |
p03086 | s533213290 | Wrong Answer | if __name__ =='__main__':
s = input()
ans = 0
seq = 0
for c in s:
if c=='A' or c=='T' or c=='G' or c=='C':
seq+=1
else:
ans = max(ans,seq)
ans = max(ans,seq)
print(ans) |
p03086 | s707760618 | 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(1,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 | s652441896 | Wrong Answer | def abc122_b():
s = input()
acgt = ['A', 'C', 'G', 'T']
check = [1 if s[i] in acgt else 0 for i in range(len(s))]
result = 0
for i in range(len(check)):
for j in range(len(check)):
if check[i:j].count(0) == 0:
if result < len(check[i:j]):
res... |
p03086 | s349710385 | Wrong Answer | S = input()
ans = 0
for i in range(len(S)):
for j in range(i,len(S)):
print(S[i:j+1])
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(... |
p03086 | s681216800 | Wrong Answer | S = list(input())
ans = 0
cnt = 0
for s in S:
if s in ['A','C','G','T']:
cnt += 1
else:
ans = max(ans,cnt)
cnt = 0
print(ans) |
p03086 | s626114308 | Wrong Answer | a = 'ATCG'
s = input()
ans = 0
cnt = 0
for i in range(len(s)):
if s[i] in a:
cnt += 1
else :
if cnt > ans:
ans= cnt
cnt = 0
print(ans)
|
p03086 | s704815452 | Wrong Answer | S = input()
ans = 0
cnt = 0
for i in S:
if i in ("A","C","G","T"):
cnt += 1
else:
ans = max(ans,cnt)
cnt = 0
print(ans) |
p03086 | s071153629 | Wrong Answer | s = input()
sl = len(s)
l = [0]*sl
c = 0
ans = 0
for i in range(sl):
if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":
l[i] = 1
for i in range(sl):
if l[i] == 1:
c += 1
else:
ans = max(ans, c)
c = 0
print(ans) |
p03086 | s562749299 | Wrong Answer | s = input()
point = 0
for i in s:
if i in "ACGT":
point += 1
print(point) |
p03086 | s768288387 | 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 | s061047666 | Wrong Answer | s = input()
MAX = 0
m = 0
for i in s:
print(m)
if i == "A" or i == "G" or i == "C" or i == "T":
m += 1
MAX = max(MAX,m)
else:
m = 0
|
p03086 | s216519829 | Wrong Answer | s = input()
result = ""
result_old = ""
#現在の文字列の長さ
#1個前の文字列の長さ
for i in range(int(len(s))):
if s[i] == "A" or s[i] == "C" or s[i] == "G" or s[i] == "T":
result = result +s[i]
else:
if int(len(result_old)) < int(len(result)):
result_old = result
else:
result = ... |
p03086 | s495401360 | Wrong Answer | ans=0
for i in list(input()):
if i in {"A","G","C","T"}:ans+=1
print(ans) |
p03086 | s256121244 | Wrong Answer | S = input()
ans = 0
cnt = 0
for i in range(len(S)):
if S[i] in "ACGT":
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s273722947 | Wrong Answer | s = list(input())
ans = 0
cnt = 0
l = ['A', 'C', 'G', 'T']
for i in range(len(s)):
if s[i] in l:
cnt += 1
else:
ans = max(cnt, ans)
cnt = 0
print(ans)
|
p03086 | s250388968 | Wrong Answer | s = input()
l = list(s)
count = 0
ans = 0
for i in range(len(l)):
if l[i] == "A" or l[i] == "T" or l[i] == "G" or l[i] == "C":
count += 1
continue
ans = max(ans,count)
count = 0
print(ans) |
p03086 | s238564695 | Wrong Answer | S = input()
ACGT = ['A', 'C', 'G', 'T']
count_list = [0]
count = 0
max_count = 0
for s in S:
if s in ACGT:
count += 1
else:
count_list.append(count)
# max_count = max(max_count, count)
count = 0
print(max(count_list)) |
p03086 | s603025327 | Wrong Answer |
s = input()
cnt = 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':
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03086 | s783490427 | 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,max(1,len(s[l:r])))
print(ma)
|
p03086 | s992736383 | Wrong Answer | s=input()
count,ans=0,0
for i in range(len(s)):
if s[i] in 'ACGT':
count+=1
else:
ans=max(ans,count)
count=0
print(ans) |
p03086 | s332655776 | Wrong Answer | ACGT = ['A', 'C', 'G', 'T']
def ok(S):
for c in S:
if c not in ACGT:
return False
return True
def main():
S = input()
res = ''
for i in range(len(S)-1):
for j in range(1, len(S)):
ps = S[i:j]
if ok(ps) and len(ps) > len(res):
res = ... |
p03086 | s502870999 | Wrong Answer | S=input()
l=['A','C','G','T']
cnt=0
for s in S:
if s in l: cnt+=1
print(cnt) |
p03086 | s020655772 | Wrong Answer | s = input()
n = len(s)
ans = -1e9
for i in range(n):
for j in range(i, n):
ok = True
for k in range(i, j + 1):
if s[k] not in ['A', 'T', 'G', 'C']:
ok = False
if ok:
ans = max(ans, j - i + 1)
print(ans)
|
p03086 | s707297607 | 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 | s202391339 | Wrong Answer | s = list(input())
a = ""
ans = 0
for c in s:
if c in ("A", "C", "G", "T"):
ans += 1
a += c
else:
ans = max(ans, len(a))
a = ""
print(ans)
|
p03086 | s996048339 | Wrong Answer | S = input()
T = "ACGT"
ans = 0
cnt = 0
for s in S:
if s in T:
cnt += 1
else:
if cnt > ans:
ans = cnt
cnt = 0
print(ans) |
p03086 | s070257977 | 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
if num==len(l):
print(num)
else:
ans=max(num,ans)
num=0
print(ans)
else:
print(0)
|
p03086 | s099490822 | Wrong Answer | s = input()
L = "ACGT"
ans = ""
ss = ""
for i in range(len(s)):
if s[i] in L:
ans += s[i]
#print(ans,ss)
else:
if len(ans)>len(ss):
ss = ans
ans = ""
print(len(ss)) |
p03086 | s894065993 | Wrong Answer | s = input()
ACGT = ["A","C","G","T"]
ans = 0
ANS = [0]
for i in range(len(s)):
if s[i] in ACGT:
ans += 1
else:
ANS.append(ans)
ans = 0
print(max(ANS)) |
p03086 | s429176046 | 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 | s477633865 | Wrong Answer | s=list(input())
d=["A","C","G","T"]
ans=0
cnt=0
for c in s:
if c in d:
cnt+=1
else:
ans=max(cnt,ans)
cnt=0
print(ans)
|
p03086 | s937463686 | Wrong Answer | s = input()
valid_chars = ["A", "C", "G", "T"]
tmp_ans = 0
ans = 0
for c in s:
if c in valid_chars:
tmp_ans += 1
else:
ans = max(tmp_ans, ans)
tmp_ans = 0
print(ans)
|
p03086 | s016664453 | Wrong Answer | s = input()
ans = 0
for l in range (len(s)-1):
for r in range(l+1, len(s)):
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 | s200276704 | 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 == maxIndex:
if counter > result:
result = counter
... |
p03086 | s881292633 | Wrong Answer | S = input()
S = list(S)
str_list = {"A","C","G","T"}
str_max = 0
print(S)
#print(len(S))
for start in range(len(S)):
for end in range(start+1, len(S)+1):
S_list = S[start:end]
if str_list | set(S_list) == str_list:
str_max = max(str_max, len((S_list)))
# print(str(S_list)+'は... |
p03086 | s631947896 | Wrong Answer | S=input()
start=1
end=0
ans=[]
for _ in range(len(S)):
for i in range(len(S))[end:]:
if S[i] in {"A","C","G","T"}:
start=i
break
for j in range(len(S))[start:len(S)]:
end=len(S)
if S[j] not in {"A","C","G","T"}:
end=j
break
ans.append(e... |
p03086 | s027526703 | Wrong Answer | import re
S = input()
num = len(S)
S = re.sub('[^A|^C|^G|^T]+', ' ', S).split(' ')
print(len(max(S)))
|
p03086 | s543267932 | Wrong Answer | S=input()
cnt=0
ans=0
for i in S:
if i in ["A","C","G","T"]:
cnt+=1
else:
ans=max(ans,cnt)
cnt=0
print(ans) |
p03086 | s065598363 | 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 s in S:
if s in ["A", "C", "G", "T"]:
ans = 1
break
for idx in Idxs:
... |
p03086 | s687019899 | Wrong Answer | S = input()
len_ACGT = 0
canCount = False
max_len = 0
for s in S:
if (s in "ACGT"):
if(canCount == False):
canCount = True
len_ACGT += 1
else:
if(canCount == True):
if(len_ACGT > max_len):
max_len = len_ACGT
canCount = False
len_ACGT = 0
print(max_len) |
p03086 | s910137367 | Wrong Answer | S = input()
tmp=0
ans=0
for s in S:
if s in 'ACGT':
tmp+=1
else:
ans = max(ans,tmp)
tmp=0
print(ans) |
p03086 | s962842385 | Wrong Answer | s = input()
count = 0
for i in range(len(s)-1):
c=0
if s[i]!='A' and s[i]!='C' and s[i]!='G' and s[i]!='T':
continue
c=1
for j in range(i+1,len(s)):
if s[j]!='A' and s[j]!='C' and s[j]!='G' and s[j]!='T':
break
else:
c+=1
count = c if count<c else cou... |
p03086 | s808471489 | Wrong Answer | S = str(input())
sam = ['A','C','G','T']
count = 0
for i in range(len(S)):
if i == 0 and S[i] in sam:
count+=1
elif i > 0:
if count == 0 and S[i] in sam:
count+=1
elif S[i] in sam and S[i-1] in sam:
count+=1
print(count)
|
p03086 | s836576660 | Wrong Answer | S = input()
count = 0
count_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
continue
else:
if count_max <= count:
count_max = count
print(count_max) |
p03086 | s627602354 | Wrong Answer | # -*- 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
else:
ans = max(len, ans)
len = 0
print(ans) |
p03086 | s588701704 | Wrong Answer | S = input()
ans = ''
t = ''
acgt = 'ACGT'
for s in S:
if (s in acgt):
t += s
else:
if (len(ans) < len(t)):
ans = t
if (len(ans) < len(t)):
ans = t
print(ans) |
p03086 | s373452705 | Wrong Answer | S=input()
flag =0
ans =0
for i in range(len(S)):
flag =0
for j in range(len(S)-i):
if S[i+j] == 'A' or S[i+j] == 'G' or S[i+j] == 'T' or S[i+j] == 'C':
flag +=1
else:
ans = max(ans,flag)
flag =0
break
print(ans) |
p03086 | s797955425 | Wrong Answer | s=input()
tmp = 0
ans = -1
flg= 1
for i in range(len(s)):
if s[i] in ["A","G","C","T"]:
tmp += 1
else:
if ans <= tmp:
ans = tmp
flg = 0
tmp = 0
print(ans if flg==0 else tmp) |
p03086 | s565627548 | Wrong Answer | S=input()
res=0
for st in [S[x:y] for x in range(len(S)) for y in range(len(S)) if x<=y]:
for c in st:
if not c in ('A','C','G','T'):
break
else:
if res<len(st):
res=len(st)
print(res)
|
p03086 | s233919485 | Wrong Answer | s = input()
a = ['A','T','G','C']
ans = []
c = 0
for i in s:
if i in a:
c += 1
else:
ans += [c]
c = 0
if ans == []:
print(len(s))
else:
print(max(ans)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.