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()
lst = [["A", "T"], ["G", "C"]]
print(lst[0][lst[0].index(b) - 1]) if b in lst[0] else print(lst[1][lst[1].index(b) - 1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
dic={"A":"T","G":"C"}
s=input()
for l,(i,j) in enumerate(dic.items()):
    if i==s:print(j)
    if j==s:print(i)

Submission status: Accepted

Solution code:
# A - Double Helix

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:
def double_helix(b):

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

    return acgt[b]
def main():
    b = str(input())
    print(double_helix(b))

if __name__ == '__main__':
    main()

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:
import sys
import math
from collections import Counter
import itertools
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

# ###########################################

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

Submission status: Accepted

Solution code:
b = input()

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

print(m[b])

Submission status: Accepted

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

print(dict[b])

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()
enki = {
  'A': 'T'
  , 'T': 'A'
  , 'C': 'G'
  , 'G': 'C'
}
print(enki[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:
#copy

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
bases = [{'A', 'T'}, {'C', 'G'}]
b = input()
for i in bases:
    if b in i:
        print((i - set(b)).pop())

Submission status: Accepted

Solution code:
def main():
    b = input()
    for i in range(len(b)):
        if b[i] == "A":
            print("T",end="")
        elif b[i] == "T":
            print("A",end="")
        elif b[i] == "C":
            print("G",end="")
        elif b[i] == "G":
            print("C",end="")
    print()
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
b=str(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()

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

print(base[b])

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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 = "AT"
g = "GC"
b = input()

if a.count(b) :
    print(a.replace(b,""))
else:
  print(g.replace(b,""))

Submission status: Accepted

Solution code:
b = input()

at = "AT"
cg = "CG"

if at.count(b) == 1:
  print(at.replace(b, ""))
else:
  print(cg.replace(b, ""))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b=str(input())
strings="A","C","G","T"
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();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 = str(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:
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().rstrip()
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()

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

pair = base_pairs.get(b)

print(pair)

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

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:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

dic = {'A': 'T', 'T': 'A', 'C': 'G', 'G': 'C'}
B = sr()
answer = dic[B]
print(answer)
# 04

Submission status: Accepted

Solution code:
dic={'A':'T','C':'G','T':'A','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:
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:
#!/usr/bin/env python3
d = {"A":"T", "T":"A", "C":"G", "G":"C"}
print(d[input()])

Submission status: Accepted

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


if b == e[0]:
  print(e[1])
elif b == e[1]:
  print(e[0])
elif b == e[2]:
  print(e[3])
else:
  print(e[2])

Submission status: Accepted

Solution code:
at = "AT"
cg = "CG"
b = input()

if at.count(b) == 1:
  print(str(at.strip(b)))
else:
  print(str(cg.strip(b)))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    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:
print({"A":"T","T":"A","G":"C","C":"G"}[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=input()
if b=='A':
  s='T'
elif b=='T':
  s='A'
elif b=='G':
  s='C'
else:
  s='G'
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
im = input()

if (im == 'A'):
    ans = 'T'
elif (im == 'T'):
    ans = 'A'
elif (im == 'C'):
    ans = 'G'
else:
    ans = 'C'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
B = input().rstrip()
d = {
    "A":"T",
    "T":"A",
    "C":"G",
    "G":"C"
}
print(d[B])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(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 = str(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()
dict1 = {"A":"T","T":"A","C":"G","G":"C"}
print(dict1[s])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()
if "A" in b:
    print("T")
elif "T" in b:
    print("A")
elif "C" in b:
    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:
A=str(input())
s={"A":"T","T":"A","G":"C","C":"G"}
print(s[A])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix

# strlist = "abcdefghijklmnopqrstuvwxyz"
b = input()

AT = set(["A","T"])
CG = set(["C","G"])
if b in AT:
    ans = AT - set(b)
else:
    ans = CG -set(b)

print(ans.pop())
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(ans))

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'
else:
    b = 'C'

print(b)

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

Submission status: Accepted

Solution code:
b=input()

enki={"A":"T","T":"A","G":"C","C":"G"}
ans=""
for i in b:
    ans+=enki[i]
print(ans)

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()
i = list('TGCA')
j = list('ACGT')
print(i[j.index(b)])

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:
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 != 'C' else cg[1]
    if b == 'A' or b == 'T': print(revAT(b))
    else: print(revCG(b))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = "ACTG"
print(s[s.index(input())-2])

Submission status: Accepted

Solution code:
b = input()
s = list("ACTG")

print(s[(s.index(b)+2)%4])

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')
b = input()
c = []
for i in range(len(b)):
  if b[i] == 'A':
    c.append('T')
  elif b[i] == 'T':
    c.append('A')
  elif b[i] == 'G':
    c.append('C')
  else:
    c.append('G')
print(''.join(c))

Submission status: Accepted

Solution code:
b=input()
d={"A":"T","C":"G","G":"C","T":"A"}
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:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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()
lis=["A","G","T","C"]
print(lis[(int(lis.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:
b = input()
if b == "A": print("T")
elif b == "C": print("G")  
elif b == "T": print("A")
else: print("C")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

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

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:
# 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('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

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

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:
a = input()
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:
import itertools
import fractions
def main():
  b = input()
  if b == 'A':
    print('T')
  elif b == 'T':
    print('A')
  elif b == 'G':
    print('C')
  elif b == 'C':
    print('G')
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

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

list={"A":"T","T":"A","G":"C","C":"G"}
b = input().strip()
print(list[b])

Submission status: Accepted

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

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

pair = dict(zip('ACGT', 'TGCA'))

b = sys.stdin.readline().rstrip()

def main():
    print(pair[b])

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

d = {}
d['A'] = 'T'
d['T'] = 'A'
d['C'] = 'G'
d['G'] = 'C'

print(d[b])

Submission status: Accepted

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

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a =input()

    if a =="A":
        print("T")
    if a == "C":
        print("G")
    if a == "T":
        print("A")
    if a == "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()
l = ['A','C','G','T']
rev = ['T','G','C','A']
print(rev[l.index(b)])

Submission status: Accepted

Solution code:
#conding utf-8
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:
b = input()
dic = {"A": "T", "C": "G"}
if b in dic:
    print(dic[b])
else:
    print(*[k for k, v in dic.items() if v == b])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
def main():
  #n = int(input())
  s = input()
  #s = input().split()
  #a,b = list(map(int,input().split()))
  #a = [input() for i in range(n)]
  #a = [int(input()) for i in range(n)]
  #a = [input().split() for i in range(n)]
  #a = [list(map(int,input().split())) for i in range(n)]
  ans = 0
  count = 0
  lis = []
  
  if s == "A" or s == "T":
    print("AT".replace(s,""))
  else:
    print("CG".replace(s,""))
    

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
b=input()
A="ACGT"
B="TGCA"
print(B[A.index(b)])

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

def f(c):
    if c == 'A': return 'T'
    if c == 'T': return 'A'
    if c == 'C': return 'G'
    if c == 'G': return 'C'

print(''.join(map(f, 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:
# coding: utf-8

b = input()
# print(b)

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

print(dic[b])

Submission status: Accepted

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

if b=='A' or b=='T':
    l.remove(b)
    print(l[0])
if b=='C' or b=='G':
    m.remove(b)
    print(m[0])

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:
print(["A","C","G","T"][["T","G","C","A"].index(input())])

Submission status: Accepted

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

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:
import sys
import os

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    b = sys.stdin.buffer.readline().decode().rstrip()
    print('A' if b == 'T' else 'T' if b == 'A' else 'C' if b == 'G' else 'G')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
b = input()

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

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

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

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

print(answer)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(["T","A","C","G"][["A","T","G","C"].index(input())])

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

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

Submission status: Accepted

Solution code:
# ABC122 A

def main():
    b = input()

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

    print(pairs[b])

if __name__ == '__main__':
    main()

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