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: 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:
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:
b = input()

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

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:
b='ATACGC'
print(b[1+b.index(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':
    print('T')

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

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

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

Submission status: Accepted

Solution code:
import sys


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


def main():
    D = list(input())
    dic = {'A': 'T', 'C': 'G', 'G': 'C', 'T': 'A'}
    ans = []
    for d in D:
        ans.append(dic[d])
    print(''.join(ans))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
b = input()

print(b.translate(str.maketrans({'A': 'T', 'C': 'G', 'T': 'A', 'G': 'C'})))

Submission status: Accepted

Solution code:
import sys
def S(): return sys.stdin.readline().rstrip()

b = S()
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:
b = input()

base_map = dict()
base_map["A"] = "T"
base_map["T"] = "A"
base_map["C"] = "G"
base_map["G"] = "C"

print(base_map[b])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! python3
#  solve_122A.py

code_dict = {"A":"T",
             "T":"A",
             "G":"C",
             "C":"G"}

print(code_dict[input()])

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()
base = ['A', 'C', 'T', 'G'] 
print(base[(base.index(b) + 2 ) % 4])

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

Submission status: Accepted

Solution code:
ary = ['A', 'C', 'G', 'T']
ans = ['T', 'G', 'C', 'A']

b = input()

print(ans[ary.index(b)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
n = input()

if n == "A":
  print("T")
if n == "T":
  print("A")
if n == "G":
  print("C")
if n =="C":
  print("G")

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

Submission status: Accepted

Solution code:
# abc122_a.py
# https://atcoder.jp/contests/abc122/tasks/abc122_a

# A - Double Helix /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# AtCoder 星には四種類の塩基 A, C, G, T が存在し、A と T、C と G がそれぞれ対になります。
# 文字 bが入力されます。
# これは A, C, G, T のいずれかです。塩基 bと対になる塩基を表す文字を出力するプログラムを書いてください。

# 制約
#     bは文字 A, C, G, T のいずれかである。

# 入力
# 入力は以下の形式で標準入力から与えられる。
# b

# 出力
# 塩基 bと対になる塩基を表す文字を出力せよ。

# 入力例 1
# A

# 出力例 1
# T

# 入力例 2
# G

# 出力例 2
# C


def calculation(lines):
    line = lines[0]
    # N = int(lines[0])
    # N, M = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[1].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i+1]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    if line == 'A':
        result = 'T'
    if line == 'T':
        result = 'A'
    if line == 'C':
        result = 'G'
    if line == 'G':
        result = 'C'

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['A']
        lines_export = ['T']
    if pattern == 2:
        lines_input = ['G']
        lines_export = ['C']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

def main():

    b = input()

    if b == 'A':
        ans = 'T'

    elif b == 'T':
        ans = 'A'

    elif b == 'C':
        ans = 'G'

    elif b == 'G':
        ans = 'C'


    print(ans)


if __name__ == "__main__":
    main()

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:
b = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
B = {'A':'T', 'T':'A', 'C':'G', 'G':'C'}

print(B[input()])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=["A","C","G","T"]
b=["T","G","C","A"]

s=input()

print(b[a.index(s)])

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    b = input()
    res = {"A": "T", "T": "A", "C": "G", "G": "C"}

    print(res[b])

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()
s = "AGTC"
for i in range(4):
  if s[i] == b:
    print(s[(i+2)%4])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()
d = dict()
d['A'] = 'T'
d['T'] = 'A'
d['C'] = 'G'
d['G'] = 'C'

print(d[b])

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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:
d = {"A": "T", "T": "A", "C": "G", "G": "C"}
print(d[input()])

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

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

def main():
    b = input()
    if b == "A":
        print("T")
    elif b == "T":
        print("A")
    elif b == "C":
        print("G")
    elif b == "G":
        print("C")
            
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
b = input()
if not ( b == 'A' or b == 'T' or b == 'G' or b == 'C' ): sys.exit()
base = { 'A':'T', 'T':'A', 'G':'C', 'C':'G' }

print(base[b])

Submission status: Accepted

Solution code:
import sys
b = input()
if not ( b == 'A' or b == 'T' or b == 'G' or b == 'C' ): sys.exit()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

b = input().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
pair1 = ["A","T"]
pair2 = ["G","C"]

b = input()

if b in pair1:
    pair1.remove(b)
    print(pair1[0])
    
else:
    pair2.remove(b)
    print(pair2[0])

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:
import sys
sys.setrecursionlimit(10**6)

b = input()

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

print(d[b])

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

S = input()
at = 'AT'
gc = 'GC'

if len(at.replace(S, '')) == 1:
    print(at.replace(S, ''))
else:
    print(gc.replace(S, ''))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d = input()

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

Submission status: Accepted

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("".join(b))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
dict_1 = {"A":"T","G":"C"}
dict_2 = {"T":"A","C":"G"}

s = input()
if s in dict_1:
  ans = dict_1[s]
else:
  ans = dict_2[s]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
b = input()
AC = ["A", "C"]
GT = ["G", "T"]

if b in AC:
    b = GT[b == "A"]
    
elif b in GT:
    b = AC[b == "G"]
    
print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
rr = lambda: sys.stdin.readline().rstrip()
a = rr()
if a in 'AT':
  print('AT'.replace(a, ''))
else:
  print('GC'.replace(a, ''))

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:
# a, b = map(int, input().split())
d = {
	'A':'T', 
	'C':'G', 
	'T':'A',
	'G':'C'
}
print(d[input()])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()
x = ['A', 'C', 'T', 'G']

for i in range(4):
    if b == x[i]:
        print(x[(i + 2) % 4])
        break

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print({'A':'T','T':'A','G':'C','C':'G'}.get(input()))

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:
b = input()

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

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:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b=input()

print(b.translate(str.maketrans({"A":"T","T":"A","C":"G","G":"C"})))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 122-A

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print('TCG A'[ord(input())%5])

Submission status: Accepted

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

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:
dic = {"A":"T","T":"A","G":"C","C":"G"}
print(dic[input()])

Submission status: Accepted

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

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

b = str(input())

print(enki[b])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
a = input()
r = ''
if a == 'A':
  print('T')
elif a == 'T':
  print('A')
elif a == 'G':
  print('C')
elif a == 'C':
  print('G')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
B = input()

X = 'ATCG'
Y = 'TAGC'

print(Y[X.index(B)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = str(input())

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

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:
n = input()
print({'A': 'T', 'T': 'A', 'C': 'G', 'G': 'C'}[n])

Submission status: Accepted

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

main()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    d = {"A":"T", "T":"A", "G":"C", "C":"G"}
    print(d[input()])
    
if __name__ == "__main__":
    main()

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:
b=input()
l={'A':'T','T':'A','C':'G','G':'C'}
print(l[b])

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
b = input()
for c in b:
    if c == 'A':
        print('T', end='')
    elif c == 'C':
        print('G', end='')
    elif c == 'G':
        print('C', end='')
    elif c == 'T':
        print('A', end='')
print()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d = {
    'A':'T',
    'T':'A',
    'C':'G',
    'G':'C'}

print(''.join(d[c] for c in input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

b = sys.stdin.readline().strip()
dic = {"A": "T", "T": "A", "C": "G", "G": "C"}
print(dic[b])

Submission status: Accepted

Solution code:
b = input()

d = {"A":"T","C":"G","G":"C","T":"A"}

print(d[b])

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readline_s = sys.stdin.readline
readlines = sys.stdin.buffer.readlines


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

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

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
b = input()
if b == 'A':
    print('T')
elif b == 'T':
    print('A')
elif b == 'G':
    print('C')
else:
    print('G')

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

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

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:
#A
b = input()
t = {"A":"T","T":"A", "C":"G","G":"C"}

result = ""

for i in b:
    result += t[i]
    
print(result)

Submission status: Accepted

Solution code:
b = input()

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

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:
b = input()
AT = ["A", "T"]
CG = ["C", "G"]

if b in AT:
  AT.remove(b)
  print(AT[0])
else:
  CG.remove(b)
  print(CG[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

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

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

Submission status: Accepted

Solution code:
#A と T、C と G
s=input()

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

Submission status: Accepted

Solution code:
s=input()
hairetsu=[["A","T"],["T","A"],["G","C"],["C","G"]]
for i in range(4):
    if s==hairetsu[i][0]:
        print(hairetsu[i][1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

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

Submission status: Accepted

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