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:
l1 = ['A','T']
l2 = ['C','G']
b = str(input())
print(b)
ans = ''
if b in l1:
    l1.remove(b)
    ans = l1[0]
if b in l2:
    l2.remove(b)
    ans = l2[0]
print(ans)

Submission status: Wrong Answer

Solution code:
S=input()
count=0
result=0
for i in S:
    if i in 'AGTC':
        count+=1
    else:
        result=max(result,count)
        count=0
print(result)

Submission status: Wrong Answer

Solution code:
b = input()
b = b.replace('A', 'T')
b = b.replace('T', 'A')
b = b.replace('C', 'G')
b = b.replace('G', 'C')
print(b)

Submission status: Wrong Answer

Solution code:
# coding=utf-8
# Author: lee215

get = lambda: int(raw_input().strip())
gets = lambda: [int(i) for i in raw_input().strip().split()]
getss = lambda n: [gets() for _ in xrange(n)]


C = raw_input().strip()
m = {'A': 'C', 'C': 'A', 'G': 'T', 'T': 'G'}
print m[C]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
b = input()
b.replace('A', 'T')
b.replace('T', 'A')
b.replace('C', 'G')
b.replace('G', 'C')
print(b)

Submission status: Wrong Answer

Solution code:
S=input()
flag=0
count=0
begin=0
max_begin=0
max_count=0
for i in range(len(S)):
    if flag==0:
        
        if S[i]=="A" or S[i]=="T" or S[i]=="C" or S[i]=="G":
            begin=i
            count+=1
            flag=1
            
    else:
        if S[i]=="A" or S[i]=="T" or S[i]=="C" or S[i]=="G":
            count+=1
            
        else:
            if max_count<count:
                max_count=count
                max_begin=begin
            flag=0
            count=0
if max_count<count:
    max_count=count
print(max_count)

Submission status: Wrong Answer

Solution code:
def helix(x):
  if x in 'AT':
    return 'AT'.replace(x, '')
  elif x in 'GC':
    return 'GC'.replace(x, '')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

ma = 0
for i in range(len(s)):
    for j in range(0,len(s)-i+1):
        sbstr = s[i:i+j+1]
        print(i,j,sbstr)
        is_good = True
        for c in sbstr:
            if c not in "AGCT":
                is_good = False
                break
        if is_good:
            if (len(sbstr)) > ma :
                ma = len(sbstr)

print(ma)

Submission status: Wrong Answer

Solution code:
def Main(b):
  if b =='A':
      return 'T'
  elif b =='T':
      return 'A'
  elif b =='G':
     return 'C'
  else:
     return 'G'

Submission status: Wrong Answer

Solution code:
def at_coder(b):
  if b =='A':
      return 'T'
  elif b =='T':
      return 'A'
  elif b =='G':
     return 'C'
  elif b=='C':
     return 'G'
    
  else:
    pass

Submission status: Wrong Answer

Solution code:
def at_coder(b):
  if b =='A':
      return 'T'
  elif b =='T':
      return 'A'
  elif b =='G':
     return 'C'
  else:
     return 'G'

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
current = 0
ret = 0
for x in S:
    if x in 'ACGT':
        current += 1
        ret = max(ret, current)        
    else:
        current = 0
print(ret)

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')
else:
    print('C')

Submission status: Wrong Answer

Solution code:
p = 'ACGT'
s = input()
l = len(s)
r = 0
i = -1
while i < l:
 j = next((i for i in range(i + 1, l) if s[i] in p), l)
 i = next((i for i in range(j + 1, l) if s[i] not in p), l)
 r = max(r, i - j)
print(r)

Submission status: Wrong Answer

Solution code:
import re

S = input()
lmax = 0

for i in range(len(S)):
    for j in range(i, len(S)):
        ss = S[i:j+1]
        l = re.findall(r'[^ACGT]', ss)
        if len(l) == 0:
            lmax = max(lmax, len(ss))
        else:
            continue
print(lmax)

Submission status: Wrong Answer

Solution code:
tmp = input()

out_1 = 0
tmp_s = []
for c in tmp:
        if c == "A" or c == "G" or c == "T" or c == "C":
                tmp_s.append(c)
        else:
                if out_1 < len(tmp_s):
                        out_1 = len(tmp_s)
                tmp_s = []
print(out_1)

Submission status: Wrong Answer

Solution code:
S = input()
 
len = 0
ans = 0
for ch in S:
    if ch in 'ACGT':
        len += 1
        ans = max(ans, len)
    else:
        len = 0
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
tmp = input()

if tmp == "A":
    print("G")
else:
    print("C")

Submission status: Wrong Answer

Solution code:
str = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

length = 0
for target in s:
	if target in acgt:
		length += 1
		if max_length < length:
			max_length = length
	else:
		length = 0

print(max_length)

Submission status: Wrong Answer

Solution code:
import re
len(max(re.sub(r'[^ACGT]', ' ', input()).split()))

Submission status: Wrong Answer

Solution code:
i = input();

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

Submission status: Wrong Answer

Solution code:
S = input()
l= len(S)
ans = 0

for i in range(l):
    for j in range(l-i+1):
        seq = S[i:i+j]
        seq2 = seq.replace("A","").replace("G","").replace("T","").replace("C","")
        if seq2 == "":
            ans = max(ans, len(seq))

print(ans)

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=='T': print("C")

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:
#coding: utf-8
S = list(input())
enki = ["A", "T", "G", "C"]
a = []
ans = ""
for i in range(len(S)):
    if S[i] == enki[0] or S[i] == enki[1] or S[i] == enki[2] or S[i] == enki[3]:
        ans += S[i]
    else:
        ans = ""
    a.append(ans)
print(len(max(a)))

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-

s = input()


count = 0
max = 0
for i in range(len(s)):
    if s[i] == "A" or s[i] == "G" or s[i] == "T" or s[i] == "C":
        count += 1
        if (i == len(s)-1) and (max < count):
          max = count
    else:
        if max < count:
            max = count
        count = 0
print(max)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from operator import itemgetter
import collections


def r(s):
    if s == 'A':
        return 'T'
    elif 'T':
        return 'A'
    elif 'G':
        return 'C'
    elif 'C':
        return 'G'


def main():
    input = sys.stdin.readline
    s = str(input()).strip()

    print(r(s))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

data= sys.stdin.readline().upper()

if data == "A":
  print("T")
elif data == "T":
  print("A")
elif data == "G":
  print("C")
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')
else:
    print('T')

Submission status: Wrong Answer

Solution code:
S = input()
count = 0
list = []

for c in S:
  if c == 'A' or c == 'C' or c == 'G' or c == 'T':
    count+=1
  else:
    list.append(count)
    count = 0

if len(list)==0:
    print('0')
else:
    print(max(list))

Submission status: Wrong Answer

Solution code:
def main():    
    seq = input()
    seq = list(seq)
    for char in seq :
        if char == "A":
            char2 = "T"
        elif char == "T":
            char2 = "A"
        elif char == "G":
            char2 = "C"
        elif char == "C":
            char2 = "G"
    return(char2)

Submission status: Wrong Answer

Solution code:
b = input('A,C,G,T?:')

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

Submission status: Wrong Answer

Solution code:
S = input()
count = 0
list = []

for c in S:
  if c == 'A' or c == 'C' or c == 'G' or c == 'T':
    count+=1
  else:
    list.append(count)
    count = 0

if not list:
    print('0')
else:
    print(max(list))

Submission status: Wrong Answer

Solution code:
S = input()
count = 0
x = [0]

for i in S:
  if i in ('A','C','G','T'):
    count += 1
  else:
    x.append(count)
    count = 0
x.append(count)

print(max(x))

Submission status: Wrong Answer

Solution code:
def main():
  seq = input()
  for char in seq :
      if char == "A":
          char2 = "T"
      elif char == "T":
          char2 = "A"
      elif char == "G":
          char2 = "C"
      elif char == "C":
          char2 = "G"
  return(char2)

Submission status: Wrong Answer

Solution code:
ans = input("Please enter either A or T or C or G :")

while ans == "A" or "T" or "C" or "G":

    
    if ans == "A":
        print("T")
        break

    elif ans == "T":
        print("A")
        break

    elif ans == "C":
        print("G")
        break

    elif ans == "G":
        print("C")
        break

    else:
        print("Type it again")

    
    ans = input("Please enter either A or T or C or G :")

Submission status: Wrong Answer

Solution code:
def main():
  seq = input()
  seq_list = []
  for char in seq :
      if char == "A":
          char2 = "T"
      elif char == "T":
          char2 = "A"
      elif char == "G":
          char2 = "C"
      elif char == "C":
          char2 = "G"
      seq_list.append(char2)
  return("".join(seq_list))

Submission status: Wrong Answer

Solution code:
s = input()
li = ["A","T","C","G"]

cnt = 0
cntli = []
for i in range(len(s)):
    if s[i] in li:
        cnt += 1
    else:
        cntli.append(cnt)
        cnt = 0
else:
    cntli.append(cnt)

print(max(cntli))

Submission status: Wrong Answer

Solution code:
S = input()
count = 0
list = []

for c in S:
  if c == 'A' or c == 'C' or c == 'G' or c == 'T':
    count+=1
  else:
    list.append(count)
    count = 0

if len(list)==0:
    print(0)
else:
    print(max(list))

Submission status: Wrong Answer

Solution code:
S = input()
count = 0
list = []

for c in S:
  if c == 'A' or c == 'C' or c == 'G' or c == 'T':
    count+=1
  else:
    list.append(count)
    count = 0

if not list:
    print(0)
else:
    print(max(list))

Submission status: Wrong Answer

Solution code:
s = input()
m = 0
c = 0
S = {"A", "C", "G", "T"}
for i in range(len(s)):
    if s[i] in S:
        c += 1
    else:
        if c != 0:
            if c > m:
                m = c
            c = 0

if c > m:
    m = c

print(m)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
# import bisect
# import math
# import itertools
# import numpy as np
# import collections

"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        # 参考
        # https://blog.rossywhite.com/2018/08/06/bit-search/
        # https://atcoder.jp/contests/abc105/submissions/4088632
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    # output.append(a[j])
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)


"""ここからメインコード"""


def main():
    # 1文字に省略
    r, e = range, enumerate
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    b = ip.S()
    if b == "A":
        print("T")
    elif b == "T":
        print("A")

    elif b == "C":
        print("G")
    else:
        print("C")


main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
str = input()
cnt = 0
max = 0

for i in range(len(str)):
  if str[i] == 'A' or str[i] == 'C' or str[i] == 'G' or str[i] == 'T':
    cnt += 1
  else:
    if max < cnt:
      max = cnt
      cnt = 0

if max < cnt:
   max = cnt
   cnt = 0

print(max)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
# import bisect
# import math
# import itertools
# import numpy as np
# import collections

"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        # 参考
        # https://blog.rossywhite.com/2018/08/06/bit-search/
        # https://atcoder.jp/contests/abc105/submissions/4088632
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    # output.append(a[j])
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)


"""ここからメインコード"""


def main():
    # 1文字に省略
    r, e = range, enumerate
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    b = ip.S()
    if b == "A":
        print("T")
    elif b == "T":
        print("A")
    elif b == "C":
        print("G")
    else:
        print("C")


main()

Submission status: Wrong Answer

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

li = ["A","T","G","C"]
max = 0
ct = 0
s = input()
for ch in s:
    if ch in li:
        ct += 1
        if max < ct:
            max = ct
    else:
        ct = 0
print(max)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

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:
s = input()
if str(s) == 'A':
  print('T')
elif s == 'C':
  print('G')
elif s == 'C':
  print('G')
else:
  print('C')

Submission status: Wrong Answer

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

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("T")

Submission status: Wrong Answer

Solution code:
b = input()

if (b == 'A'):
    print('T')
if (b == 'C'):
    print('G')
if (b == 'G'):
    print('C')
if (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")
else:
    print("G")

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
def main():
    s = input()
    s = s.replace("A", "T").replace("T", "A").replace("G", "C").replace("C", "G")
    print(s)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-


import sys
import math

# 1整数
n = input()

if n == 'A':
    print('T')
if n == 'T':
    print('!')
if n == 'G':
    print('C')
if n == 'C':
    print('G')

Submission status: Wrong Answer

Solution code:
# coding: utf-8

str = input()

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

print(str)

Submission status: Wrong Answer

Solution code:
b = map(int, input().split())

if b == "A":
    print("T")
elif b == "T":
    print("A") 
elif b == "C":
    print("G") 
else:
    print("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 == 'G':
    print('C')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(input().replace('A', 'T').replace('T', 'A').replace('C', 'G').replace('G', 'C'))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
b = input()

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
b = input()
ans = ''
for i in range(len(b)):
    tmp = b[i]
    if tmp == 'A':
        ans += 'T'
    elif tmp == 'A':
        ans += 'T'
    elif tmp == 'C':
        ans += 'G'
    elif tmp == 'G':
        ans += 'C'

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

b = input()

print(b)

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 =="T":
	print("A")
elif b == "C":
	print("G")
else:
	print("G")

Submission status: Wrong Answer

Solution code:
a = input()

if a == "A":
  print("F")
if a == "F":
  print("A")
if a == "G":
  print("C")
if a == "C":
  print("G")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
B = input()
ans = ""

for b in B:
    if b == 'A':
        ans += 'A'
    if b == 'C':
        ans += 'T'
    if b == 'G':
        ans += 'C'
    if b == 'T':
        ans += 'G'

print(ans)

Submission status: Wrong Answer

Solution code:
b = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Accepted

Solution code:
moji = str(input())
correct = ["A","C","G","T"]
ind = correct.index(moji) + 1
print(correct[ind*-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
def f(c):
  if c == "A":
    return "T"
  elif c == "T":
    return "A"
  elif c == "C":
    return "G"
  else:
    return "C"

print(f(input()))

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

Solution code:
d = dict()
d["A"] = "T"
d["T"] = "A"
d["C"] = "G"
d["G"] = "C"
S = input()
print(d[S])

Submission status: Accepted

Solution code:
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)]
    if s == "A":
        print("T")
    if s == "T":
        print("A")
    if s == "C":
        print("G")
    if s == "G":
        print("C")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = ['A','C','G','T']
b = ['T','G','C','A']
asn = ''
s = str(input())
for i in range(4):
    if s == a[i]:
        print(b[i])

Submission status: Accepted

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: Accepted

Solution code:
b = input()

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

Submission status: Accepted

Solution code:
# ABC122
# A Double Helix
# AT CG
b = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(input().replace("A","a").replace("T","A").replace("a","T").replace("G","g").replace("C","G").replace("g","C"))

Submission status: Accepted

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