Problem:


Score : 100 points

Problem Statement

On the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.

You are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.

Constraints

b is one of the letters A, C, G and T.

Input

Input is given from Standard Input in the following format:

b

Output

Print the letter representing the base that bonds with the base b.

Sample Input 1

A

Sample Output 1

T

Sample Input 2

G

Sample Output 2

C



Sample input:
A


Sample output:
T

Submission status: Wrong Answer

Solution code:
a = input()
if a == 'A':
  print('T')
elif a == 'T':
  print('A')
elif a == 'C':
  print('g')
else:
  print('C')

Submission status: Wrong Answer

Solution code:
a = input()
if a == 'A':
  print('T')
elif a == 'T':
  print('A')
elif a == 'c':
  print('g')
else:
  print('C')

Submission status: Wrong Answer

Solution code:
b = input ()

if b == "A":
    print("T")
    
elif b == "C":
    print("G")

Submission status: Wrong Answer

Solution code:
b = input()
if b == 'A':
    print('C')
elif b == 'C':
    print('A')
elif b == 'G':
    print('T')
elif b == 'T':
    print('G')

Submission status: Wrong Answer

Solution code:
b = input()
print("A" if b=="C" else "C" if b=="G" else "T" if b=="A" else "G")

Submission status: Wrong Answer

Solution code:
b=input()

#AとTが対になる

if b == 'A':
    print('T')
elif b == 'T':
    print('A')

#GとCが対になる

elif b == 'G':
    print('C')
elif b == 'G':
    print('C')

Submission status: Wrong Answer

Solution code:
b=input()

#AとTが対になる

if b == ('A'):
    print('T')
elif b == ('T'):
    print('A')

#GとCが対になる

elif b == ('G'):
    print('C')
elif b == ('G'):
    print('C')

Submission status: Wrong Answer

Solution code:
b=input()

#AとTが対になる

if b == ('A'):
    print('T')
elif b==('T'):
    print('A')

#GとCが対になる

elif b==('G'):
    print('C')
elif b==('G'):
    print('C')

Submission status: Wrong Answer

Solution code:
# A - Double Helix
b = input()
if b =='A':
    print('T')
elif b =='T':
    print('a')
elif b =='C':
    print('G')
elif b =='G':
    print('C')

Submission status: Wrong Answer

Solution code:
b = input()

if b == 'A':
    print('T')
elif b == 'G':
    print('C')

Submission status: Wrong Answer

Solution code:
b = str(input())
dic = {'A':'C', 'C':'A', 'G':'T', 'T':'G'}
bz = dic[b]
print(bz)

Submission status: Wrong Answer

Solution code:
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

if ans<temp: ans=temp
print(ans)

Submission status: Wrong Answer

Solution code:
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

if ans>temp: ans=temp
print(ans)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
s=input()
temp=0
ans=0
tar="ACGT"
for ch in s:
  if ch is tar:
    temp+=1
  else:
    if ans<temp:
      ans=temp
    temp=0


print(ans)

Submission status: Wrong Answer

Solution code:
s=str(input())
temp=0
ans=0
tar="ACGT"
for ch in s:
  if ch is tar:
    temp+=1
  else:
    if ans<temp:
      ans=temp
    temp=0


print(ans)

Submission status: Wrong Answer

Solution code:
b=input()
if "A" in b:
    print("T")
elif "G" in b:
    print("C")

Submission status: Wrong Answer

Solution code:
a=input()
if a=='G':
  print('C')
elif a=='G':
  print('G')
elif a=='A':
  print('T')
else:
  print('A')

Submission status: Wrong Answer

Solution code:
b = input()
if b == "A":
    print("A")
elif b == "C":
        print("T")
elif b == "G":
            print("C")
elif b == "T":
                print("G")

Submission status: Wrong Answer

Solution code:
b = list(input())

for i in range(len(b)):
  if b[i] == "A":
    b[i] = "T"
  elif b[i] == "T":
    b[i] = "A"
  elif b[i] == "C":
    b[i] = "G"
  else:
    b[i] = "C"
    
print(b)

Submission status: Wrong Answer

Solution code:
a = {'A':'C','C':'A','G':'T','T':'G'}
print(a[input()])

Submission status: Wrong Answer

Solution code:
x=input()
if x=="A":
  print("T")
if x=="T":
  print("A")
if x=="G":
  print("C")
else:
  print("G")

Submission status: Wrong Answer

Solution code:
def resolve():
    '''
    code here
    '''
    S = input()

    front = -1
    end = 0
    for i in range(len(S)):
        if S[i] in ['A', 'C', 'G', 'T']:
            front = i
            break

    for i in range(len(S)):
        if S[-1*(i+1)] in ['A', 'C', 'G', 'T']:
            end = i
            break
    if front == -1:
        print(0)
    else:
        print(len(S) - end - front)

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
s=input()
if s=='A':
    print('T')
elif s=='T':
    print('A')
elif s=='C':
    print('G')
elif s=='G':
    print('G')

Submission status: Wrong Answer

Solution code:
k = input()
if k == "A":
  print("A")
if k == "C":
  print("T")
if k == "G":
  print("C")
if k == "T":
  print("G")

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline


def main():
    b = input().rstrip()

    if b == "A":
        ans = "C"
    elif b == "C":
        ans = "A"
    elif b == "G":
        ans = "T"
    else:
        ans = "G"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
b=input
if b=='A':
    print('T')
elif b=='T':
    print('A')
elif b=='C':
    print('G')
elif b=='G':
    print('C')

Submission status: Wrong Answer

Solution code:
b=input()
d={"A":"T","T":"A","C":"G","G":"T"}
print(d[b])

Submission status: Wrong Answer

Solution code:
b = input()
print("A" if b=="T" else "T" if b=="A" else "C" if b=="G" else "C")

Submission status: Wrong Answer

Solution code:
s = input()
count = 0
max_count = 0
for c in s:
  if c in ['A','C','G','T']:
    count = 0
  else:
    count += 1
    if max_count < count:
      max_count = count
print(max_count)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
b = input()

print('T' if b == 'A' else 'T' if b =='A' else 'C' if b == 'G' else 'C')

Submission status: Wrong Answer

Solution code:
b = str(input())
print("A" if b == "T" else "T" if b == "A" else "C" if b == "G" else "C")

Submission status: Wrong Answer

Solution code:
from collections import defaultdict, deque
import sys

INF = float('inf')
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


b = S()
ans = 'T' if b == 'A' else 'A' if b == 'T' else 'C' if b == 'G' else 'C'
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
acgt = ['A','C','G','T']
i = 0
max = 0
count = 0

while i < len(s):
    if s[i] in acgt:
        count+=1
        if count > max:
            max = count
    else:
        count = 0
    i+=1

print(max)

Submission status: Wrong Answer

Solution code:
ans = {
    "A": "T",
    "C": "G",
    "G": "C",
    "T": "S",
}
print(ans[input()])

Submission status: Wrong Answer

Solution code:
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(len(m[-1]))

Submission status: Wrong Answer

Solution code:
letter = input()

dict = {'A': 'A', 'C':'T', 'G':'C', 'T':'G'}
if letter in dict:
  print(dict[letter])

Submission status: Wrong Answer

Solution code:
letter = input()
dict = {'A': 'A', 'C':'T', 'G':'C', 'T':'G'}
for letter in dict:
  print(dict[letter])

Submission status: Wrong Answer

Solution code:
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
                    break
            continue
        if counter > result:
            result = counter
            break
    if result == maxIndex: break

print(result)

Submission status: Wrong Answer

Solution code:
s=input()
clist=['A','C','G','T']
count=0
a=[]
for i in s:
  if i in clist:
    count+=1
  else:
    a.append(count)
    count=0
if len(a) == 0:
  print(0)
else:
  print(max(a))

Submission status: Wrong Answer

Solution code:
S = input()
if S == 'A':
  print('T')
if S == 'T':
  print('A')
if S == 'G':
  print('C')
else:
  print('G')

Submission status: Wrong Answer

Solution code:
S = input().rstrip()
d = {'A':'A','C':'T','G':'C','T':'G'}
print(d[S])

Submission status: Wrong Answer

Solution code:
s=input()
if s=="A":
    print("T")
if s=="T":
    print("A")
if s=="C":
    print("G")
else:
    print("C")

Submission status: Wrong Answer

Solution code:
l = {'A':'C','C':'A','G':'T','T':'G'}
print(l[input()])

Submission status: Wrong Answer

Solution code:
S = input()
acgt = ['A', 'C', 'G', 'T']
ans = 0
for i in range(len(S), 0, -1):
    for j in range(len(S) - i + 1):
        for k, s in enumerate(S[j:i + j]):
            if not s in acgt:
                break
            if k == len(S[j:i + j]) - 1:
                ans = len(S[j:i + j])
            
        if ans != 0:
            break
    else:
        continue
   
    break    
    
print(ans)

Submission status: Wrong Answer

Solution code:
def resolve():
    s=input()
    num=0
    for i in range(len(s)):
        for j in range(len(s)+1):
            s1=s[i:j]
            if 'B' not in s1 and 'D' not in s1 and 'E' not in s1 and 'F' not in s1\
                    and 'H' not in s1 and 'I' not in s1 and 'J' not in s1 and 'K' not in s1 and 'L' not in s1 and\
                    'M' not in s1 and 'N' not in s1 and 'O' not in s1 and 'P' not in s1 and 'Q' not in s1 and\
                    'R' not in s1 and 'S' not in s1 and 'U' not in s1 and 'X' not in s1 and 'Y' not in s1 and\
                    'Z' not in s1 and len(s1)>=num:
                num=len(s1)
    print(num)
resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    s=input()
    num=0
    for i in range(len(s)):
        for j in range(len(s)+1):
            s1=s[i:j]
            if 'B' not in s1 and 'D' not in s1 and 'E' not in s1 and 'F' not in s1\
                    and 'H' not in s1 and 'I' not in s1 and 'J' not in s1 and 'K' not in s1 and 'L' not in s1 and\
                    'M' not in s1 and 'N' not in s1 and 'O' not in s1 and 'P' not in s1 and 'Q' not in s1 and\
                    'R' not in s1 and 'S' not in s1 and 'U' not in s1 and 'X' not in s1 and 'Y' not in s1 and\
                    'Z' not in s1 and len(s1)>num:
                num=len(s1)
    print(num)
resolve()

Submission status: Wrong Answer

Solution code:

b = str(input())
if b == 'A':
  print('T')
elif b == 'C':
  print('G')
elif b == 'G':
  print('C')
else:
  print('G')

Submission status: Wrong Answer

Solution code:
b=input();print('A'if b=='C' else 'C' if b=='A' else 'G' if b=='T' else 'T')

Submission status: Wrong Answer

Solution code:
s = input() + 'n'
ans = 0
fans = 0
for i in range(len(s)):
    if s[i] in 'ACGT':
        ans += 1
    elif fans < ans:
        fans = ans
        ans = 0
print(fans)

Submission status: Wrong Answer

Solution code:
s = input()
#print(s)
count = 0
count_list = [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:
        count_list.append(count)
        count = 0
count_list.append(count)  # 最後の文字がのカウントが追加されていないのでここで追加
#print(count_list)
print(max(count_list))

Submission status: Wrong Answer

Solution code:
S=input()
acgt=['A','C','G','T']

c=0
ans=0

for i in S:
    if i in acgt:
        c+=1
        ans=max(ans,c)
    else:
        c=0
print(ans)

Submission status: Wrong Answer

Solution code:
import math
import collections
import sys
 
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
 
b=input()
if b=="A":
    print("T")
elif b=="T":
    print("A")
elif b=="G":
    print("C")
elif b=="C":
    print("G")

Submission status: Wrong Answer

Solution code:
import math
import collections
import sys

input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

b=input()
if b=="A":
    print("T")
elif b=="T":
    print("A")
elif b=="G":
    print("C")
elif b=="C":
    print("G")

Submission status: Wrong Answer

Solution code:
import math
import collections
import sys

input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

b=input()
if b=="A":
    print("T")
elif b=="T":
    print("A")
elif b=="G":
    print("C")
elif b=="C":
    print(G)

Submission status: Wrong Answer

Solution code:
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 = 0
        
    ANS.append(ans)
        
print(max(ANS))

Submission status: Wrong Answer

Solution code:
S = str(input())
ans = 0
for i in range(len(S)):
    count = 0
    fr = 0
    if S[i] == "A" or S[i]=="T" or S[i]=="C" or S[i]=="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:
                fr += 1
    if ans < count:
        ans = count
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
readline = sys.stdin.readline
read = sys.stdin.read

b = readline()
if b == 'A':
	print('T')
elif b == 'T':
	print('A')
elif b == 'G':
	print('C')
else:
	print('G')

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    b = input()
    at = ('A', 'T')
    cg = ('C', 'G')
    revAT = lambda x: at[0] if x != 'A' else at[1]
    revCG = lambda x: cg[0] if x != 'A' else cg[1]
    if b == 'A' or b == 'T': print(revAT(b))
    else: print(revCG(b))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
b=input()
if b=="A":
    print("T")
elif b=="T":
    print("A")
elif b=="G":
    print("C")
else:
    print("C")

Submission status: Wrong Answer

Solution code:
b = input()
if b == "A": print("T")
elif b == "C": print("G")  
elif b == "T": print("A")
else: print("G")

Submission status: Wrong Answer

Solution code:
b = input()

if b=='A':
  print('G')
elif b=='G':
  print('A')
elif b=='T':
  print('C')
elif b=='C':
  print('T')

Submission status: Wrong Answer

Solution code:
# ABC 122: A – Double Helix
b = input()
if b == 'A':
    print('T')
elif b == 'C':
    print('G')
elif b == 'G':
    print('C')
elif b == 'T':
    print('T')

Submission status: Wrong Answer

Solution code:
b = input()
l = ['A','C','G','T']
rev = ['T','G','A','C']
print(rev[l.index(b)])

Submission status: Wrong Answer

Solution code:
b = input()

if b == 'A':
    print('T')
elif b == 'T':
    print('A')
elif b == 'G':
    print('T')
elif b == 'T':
    print('G')

Submission status: Wrong Answer

Solution code:
b = input()

if b == 'A':
    print('T')
elif b == 'T':
    print('A')
elif b == 'G':
    print('T')
else:
    print('T')

Submission status: Wrong Answer

Solution code:
b=str(input())
print(b.translate(b.maketrans({'A':'x','C':'y','T':'A','G':'C','x':'T','y':'G'})))

Submission status: Wrong Answer

Solution code:
b=str(input())
print(b.translate(b.maketrans({'A':'x','C':'y','T':'A','G':'C','x':'C','y':'G'})))

Submission status: Wrong Answer

Solution code:
b = input()
e = 'ACGT'
print(e[e.index(b)])

Submission status: Wrong Answer

Solution code:
b = input()

if b == "A" :
	answer = "T"

if b == "C" :
	answer = "G"

if b == "G" :
	answer = "C"

if b == "T" :
	answer = "T"

print(answer)


#等しいというときは　==
#b == A だと　A は　箱だと思われてしまうので　b == "A" と書くこと！！！！

Submission status: Wrong Answer

Solution code:
s = input()
if s == "A":
    print("C")
elif s == "C":
    print("A")
elif s == "G":
    print("T")
elif s == "T":
    print("G")

Submission status: Wrong Answer

Solution code:
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:
        max(count_max,count)

print(count_max)

Submission status: Wrong Answer

Solution code:
b = input()

big = ["A","T","G","C"]
cou = ["T","A","C","G"]

ans = cou.index(b)
print(ans)

Submission status: Wrong Answer

Solution code:
b = input()

big = ["A","T","G","C"]
end = ["T","A","C","G"]

ans = end.index(b)
print(ans)

Submission status: Wrong Answer

Solution code:
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):
      canCount = False
      len_ACGT = 0

  if(len_ACGT > max_len):
    max_len = len_ACGT

print(max_len)

Submission status: Wrong Answer

Solution code:
S=list(input())
max_count=0
count=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]=='T' or S[j]=='G':
            count+=1
            max_count=max(max_count,count)
        else:
            count=0
            break
    count=0
print(max_count)

Submission status: Wrong Answer

Solution code:
'''わからん'''
S=list(input())
max_count=0
count=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]=='T' or S[j]=='G':
            count+=1
            max_count=max(max_count,count)
        else:
            count=0
            break
    count=0
print(max_count)

Submission status: Wrong Answer

Solution code:
b = input()

ans = ''
if b == 'A':
  ans = 'T'
elif b == 'T':
  ans = 'A'
elif b == 'G':
  ans = 'G'
elif b == 'C':
  ans = 'C'
else:
  raise '???'

print(ans)

Submission status: Wrong Answer

Solution code:
b = input()

a = ['A', 'C', 'G', 'T']
for i in range(len(a)):
  if a[i] == b:
    print(a[i])
    break

Submission status: Wrong Answer

Solution code:
b = input()
print( "AT".strip(b) if b == "A" or "T" else "CG".strip(b))

Submission status: Wrong Answer

Solution code:
x = input()
print('T' if x == 'A' else 'C')

Submission status: Wrong Answer

Solution code:
b = input()
if b == "A":
    print("T")
elif b == "T":
    print("A")
elif b == "C":
    print("G")
elif b == "C":
    print("G")

Submission status: Wrong Answer

Solution code:
base = ["A","C","T","G"]
b = input()
n =  int(base.index(b))
print(base[3-n])

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 15, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

d = {'A': 'C', 'C': 'A', 'G': 'T', 'T': 'G'}
b = readline().decode('utf8').split()
print(b[0])
print(d[b[0]])

Submission status: Wrong Answer

Solution code:
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 
        if i == (len(S)-1):
            ans_lis.append(ans)
    else:
        ans_lis.append(ans)
        ans = 0 

print(max(ans_lis))

Submission status: Wrong Answer

Solution code:
b = str(input())

data = {'A':'T','T':'A','C':'G','G':'T'}

print(data[b])

Submission status: Wrong Answer

Solution code:
b = input()

c = ""

for d in b:
    if d=="A":
        c = c + "T"
    elif c=="C":
        c = c + "G"
    elif c=="G":
        c = c + "C"
    else:
        c = c + "A"
    
print(c)

Submission status: Wrong Answer

Solution code:
b = input()

c = ""

for d in b:
    if d=="A":
        c = c + "T"
    elif c=="C":
        c = c + "G"
    else:
        c = c + d
    
print(c)

Submission status: Wrong Answer

Solution code:
a = 'ACGT'
b = 'ATCG'
x = input()
for i in range(0, 4):
  if x[0] == a[i]:
    print(b[i])

Submission status: Wrong Answer

Solution code:
b = input()
i = ['A','C','G','T']
o = ['C','A','T','G']
print(o[i.index(b)])

Submission status: Wrong Answer

Solution code:
S = input()
ltrs = "ACGT"
curr_max = 0
curr_len = 0
for ltr in S:
    if ltr in ltrs:
        curr_len += 1
    else:
        curr_max = max(curr_max, curr_len)
        curr_len = 0
print(max(curr_len, curr_max))

Submission status: Wrong Answer

Solution code:
import math

b = input()
print("A" if b == "T" else "C" if b == "G" else "G" if b == "c" else "T")

Submission status: Wrong Answer

Solution code:
b = str( input() )
elist = [ "A", "C", "G", "T" ]
print( elist[ 2 - elist.index( b ) ] )

Submission status: Wrong Answer

Solution code:
b=input()
if "A":
  print("T")
elif "T":
  print("A")
elif "C":
  print("G")
else:
  print("C")

Submission status: Wrong Answer

Solution code:
a=["A","C","G","T"]
b=input()
if b == "A":
    print("T")
elif b == "C":
    print("G")
else:
    print(b)

Submission status: Wrong Answer

Solution code:
A = list(input())
S = ['A','C','G','T']
count = 0
a = []
a.append(count)
for i in A:
  if i in S:
    count += 1
    a.append(count)
  else:
    count = 0
print(max(a))

Submission status: Wrong Answer

Solution code:
dict={"A":"T","C":"G","T":"A","G":"C"}
dict[input()]

Submission status: Wrong Answer

Solution code:
Helix=input()
if Helix=='A':
    print ("G")
elif Helix=="G":
    print ("A")
elif Helix=="G":
    print ("C")
elif Helix=="C":
    print ("G")

Submission status: Wrong Answer

Solution code:
import sys

a = 'ATCG'
b = 'TAGC'
bond = dict(zip(a, b))

print(bond)
def main():
    b = sys.stdin.readline().rstrip()
    print(bond[b])

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
b = input()

if b == "A":
    print("T")
elif b == "T":
    print("C")
elif b == "C":
    print("G")
elif b == "G":
    print("C")

Submission status: Wrong Answer

Solution code:
b=input()
print("A" if b=="A" else "T" if b=="C" else "C" if b=="G" else "G")

Submission status: Wrong Answer

Solution code:
a = input()

b = {"A":"T", "C":"G", "G":"G", "T":"T"}
print ( b[a])

Submission status: Wrong Answer

Solution code:
a = input()

b = {"A":"A", "C":"T", "G":"C", "T":"G"}
print ( b[a])

Submission status: Wrong Answer

Solution code:
b=input()

if b=="A":
  print("T")
elif b=="C":
  print("G")
else:
  print(b)

Submission status: Wrong Answer

Solution code:
b=input()

if b=="A":
  print("A")
elif b=="C":
  print("T")
elif b=="G":
  print("C")
elif b=="T":
  print("G")

Submission status: Wrong Answer

Solution code:
base_list = ['A','C','G','T']
base = str(input())

if base == 'A':
  print('T')
elif base == 'C':
  print('G')
elif base == 'G':
  print('C')
elif base == 'T':
  print('T')

Submission status: Wrong Answer

Solution code:
#ABC122B
S = input()
SC= S.replace('C','A')
SCG = SC.replace('G','A')
SCGT = SCG.replace('T','A')
ans = 0
wk = 0
for i in range(int(len(S))):
    if SCGT[i:i+1] == 'A':
        wk += 1
    else:
        if wk >= ans:
            ans = wk
        wk =0

if wk >= ans:
    ans = wk
print(ans)

Submission status: Wrong Answer

Solution code:
b = input()
print('A' if b=='T' else 'T' if b=='A' else 'C' if b=='G' else 'C')

Submission status: Wrong Answer

Solution code:
b=input()
print('A' if b=='T' else 'T' if b=='A' else 'C' if b=='C' else 'G')

Submission status: Wrong Answer

Solution code:
S=input()
N=[0]*len(S)
 
for i in range(len(S)):
  if S[i]=="A" or S[i]=="C" or S[i]=="G" or S[i]=="T":
    N[i]=N[i-1]+1

print(max(N))

Submission status: Wrong Answer

Solution code:
s = input()
 
ans = [0]
cnt = 0
for i in s:
    if (i == "A" or i == "C" or i == "G" or i == "T"):
        cnt+=1
    else:
        if (cnt > 0):
            ans.append(cnt)
            cnt = 0
ans.append(cnt)
print(max(ans))

Submission status: Wrong Answer

Solution code:
s = input()

ans =[0]
cnt = 0

for i in s:
	if (i == "A" or i == "C" or i == "G" or i == "T"):
		cnt+= 1
	else:
		if cnt>0:
			ans.append(cnt)
			cnt=0
ans.append(cnt)
print(max(ans))

Submission status: Wrong Answer

Solution code:
s = input()

ans = [0]
cnt = 0
for i in s:
    if (i == "A" or i == "C" or i == "G" or i == "T"):
        cnt+=1
    else:
        if (cnt > 0):
            ans.append(cnt)
            cnt = 0
ans.append(cnt)
print(max(ans))

Submission status: Wrong Answer

Solution code:
S = input()
ans = 0
cnt = 0
for i in range(len(S)):
  if S[i] == "A" or S[i] =="G" or S[i] =="C" or S[i] =="T":
    cnt += 1
  else:
    ans = max(ans,cnt)
    cnt = 0

print(max(ans,cnt))

Submission status: Wrong Answer

Solution code:
b=str(input)
if b=="T":
  b="A"
elif b=="A":
  b="T"
elif b=="G":
  b="C"
elif b=="C":
  b="G"
print(b)

Submission status: Wrong Answer

Solution code:
b=str(input)
if b=="T":
  b="A"
elif b=="A":
  b="T"
elif b=="G":
  b="C"
elif b=="C":
  b="G"

Submission status: Wrong Answer

Solution code:
b = input()
ans,pair = ['A','C','G','T'],['C','A','T','G']
for i,j in zip(ans,pair):
    if j == b:
        print(i)

Submission status: Wrong Answer

Solution code:

a = input()

if a == 'A':
    print('C')
elif a == 'C':
    print('A')
elif a == 'G':
    print('T')
else:
    print('G')

Submission status: Wrong Answer

Solution code:
b = input()
if b == 'A' or b == 'G':
  if b == 'A':
    print('G')
  else:
    print('A')
else:
  if b == 'C':
    print('G')
  else:
    print('C')

Submission status: Wrong Answer

Solution code:
import sys
input=sys.stdin.readline

def main():
    b = input().strip()
    if b == "A":
        print("C")
    elif b == "C":
        print("A")
    elif b == "G":
        print("T")
    else:
        print("G")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
b=input()

if b=='A':
  print('T')
elif b=='T':
  print('A')
elif b=='C':
  print('G')
elif b=='G':
  print('C')

Submission status: Wrong Answer

Solution code:
def func():
    b = input()

    if b == 'A':
        print('G')
    if b == 'G':
        print('A')
    if b == 'G':
        print('T')
    if b == 'T':
        print('G')


if __name__ == '__main__':
    func()

Submission status: Wrong Answer

Solution code:
b = input()

if b == 'A':
    b = 'C'
elif b == 'C':
    b = 'A'
elif b == 'G':
    b = 'T'
elif b == 'T':
    b = 'G'

print(b)

Submission status: Wrong Answer

Solution code:
#ABC122 A - Double Helix
b=input()
print("A" if b=="A" else "T" if b=="C" else "C" if b=="G" else "G")

Submission status: Wrong Answer

Solution code:
b=input()
print("A" if b=="A" else "T" if b=="C" else "C" if b=="G" else "G")

Submission status: Wrong Answer

Solution code:
b=input()
print("A" if b=="A" else "T" if b=="C" else "C" if b=="G" else "T")

Submission status: Wrong Answer

Solution code:
s = input()
l = 0
lenmax = 0

for i in s:
  if i in "ACGT":
    l += 1
  else:
    lenmax = max(lenmax,l)
    l = 0
lenmax = max(lenmax,l)
print(l)

Submission status: Wrong Answer

Solution code:
s = input()
l = 0
lenmax = 0

for i in s:
  if i in "ACGT":
    l += 1
  else:
    lenmax = max(lenmax,l)
    l = 0
print(lenmax)

Submission status: Wrong Answer

Solution code:
N = input()
a=0
b=0
for i in range(len(N)):
	if N[i] == 'A' or N[i] ==  'T' or N[i] ==  'C' or N[i] ==  'G' :
		a+=1
	else: 
		if a > b: b = a
		a=0

print(b)

Submission status: Wrong Answer

Solution code:
b=input()
print('A' if b=='T' else 'T' if b=='A' else 'C' if b=='G' else 'C')

Submission status: Wrong Answer

Solution code:
a = input()
print('A' if a=='A' else 'T' if a == 'C' else 'C' if a=='G' else 'G')

Submission status: Wrong Answer

Solution code:
import sys
input=sys.stdin.readline

b = input()
if b == 'A':
	print('T')
elif b == 'T':
	print('A')
elif b == 'G':
	print('C')
elif b == 'C':
	print('G')

Submission status: Wrong Answer

Solution code:
s = list(input())
count = 0
m = 0
for i in range(len(s)):
  if s[i] == "A" or s[i] == "T" or s[i] == "C" or s[i] ==  "G":
    count += 1
  else:
    if m < count:
      m = count
      count == 0
    else:
      count = 0
print(m)

Submission status: Wrong Answer

Solution code:
s = list(input())
count = 0
m = 0
for i in range(len(s)):
  if s[i] == "A" or s[i] == "T" or s[i] == "C" or s[i] ==  "G":
    count += 1
  else:
    if m >count:
      m = count
      count == 0
    else:
      count = 0
print(m)

Submission status: Wrong Answer

Solution code:
b = input()
if b == "A":
  print("C")
if b == "C":
  print("A")
if b == "T":
  print("G")
if b == "G":
  print("T")

Submission status: Wrong Answer

Solution code:
D = {"A": "C", "C": "A", "G": "T", "T": "G"}
print(D[input()])

Submission status: Wrong Answer

Solution code:
b=input()
print("T" if b=="A" else "A" if b=="T" else "C" if b=="G" else "C")

Submission status: Wrong Answer

Solution code:
s = input()

print ("A" if s =="G" else "G" if s =="A" else "C" if s=="T" else "T")

Submission status: Wrong Answer

Solution code:
b = input()
if b in ["A","T"]:
    print("A" if b=="T" else "T")
else:
    print("C" if b=="G" else "C")

Submission status: Wrong Answer

Solution code:
print("C")

Submission status: Wrong Answer

Solution code:

b=input()
if "AT".find(b):
    print("A" if b == 'T' else "T")
if "CG".find(b):
    print("C" if b == 'G' else "G")

Submission status: Wrong Answer

Solution code:
rec = []
cnt = 0
S_arr = [S for S in input()]
for i in range(len(S_arr)):
    if S_arr[i] == 'A' or S_arr[i] == 'T' or S_arr[i] == 'C' or S_arr[i] == 'G':
        cnt += 1
    elif cnt > 0 and S_arr[i] != 'A'or S_arr[i]!='T'or S_arr[i]!='C'or S_arr[i]!='G':
        rec.append(cnt)
        cnt = 0
if len(rec) == 0:
    rec.append(0)
rec_sort = sorted(rec)
print(rec_sort[len(rec) - 1])

Submission status: Wrong Answer

Solution code:
b=input()

if b=="A":
    print("C")
elif b=="C":
    print("A")
elif b=="G":
    print("T")
elif b=="T":
    print("G")

Submission status: Wrong Answer

Solution code:
n = input()
max_ = 0
m = 0
for i in range(len(n)):
    if n[i] == "A" or n[i] == "C" or n[i] == "T" or n[i] == "G":
        m += 1
        if i == len(n) - 1:
            max_ = max(m,max_)
    else:
        max_ = max(m,max_)
        m = 0
print(max_)

Submission status: Wrong Answer

Solution code:
s=input()
if s=="A":
  print("T")
elif s=="T":
  print("G")
elif s=="C":
  print("A")
elif s=="G":
  print("T")

Submission status: Wrong Answer

Solution code:
b=input()

if "b"=="A":
	print("T")
elif "b"=="T":
	print("A")
elif "b"=="C":
	print("G")
elif "b"=="G":
	print("C")

Submission status: Wrong Answer

Solution code:
def main():
    k = input()
    if k == "A":
        print("C")
    if k == "C":
        print("A")
    if k == "T":
        print("G")
    if k == "G":
        print("T")


if __name__ == "__main__":
    main()