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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
enki_dict={"A":"T","C":"G","T":"A","G":"C"}
b = input()
ans = enki_dict[b]
print(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()
d = dict(
    A='T', T='A', G='C', C='G' 
)
print(d[b])

Submission status: Accepted

Solution code:
import os, sys, re, math

(b) = input()

print('TGCA'['ACGT'.find(b)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data=["A","C","T","G","A","C"]
b=input()
for i in range(4):
    if data[i]==b:
        print(data[i+2])
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

b = sys.stdin.buffer.readline().decode().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:
N = input()
if(N=='A'):
	print('T',end="")
if(N=='C'):
	print('G',end="")
if(N=='G'):
	print('C',end="")
if(N=='T'):
	print('A',end="")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

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

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: 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 = str( input() )
elist = [ "A", "C", "G", "T" ]
print( elist[ 3 - elist.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 = 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()
if s == "A":
    print("T")
elif s == "T":
    print("A")
elif s == "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")
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 == "C" : print("G")
else : print("C")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
b = input()
print('A' if b == 'T' else 'T' if b == 'A' else 'C' if b == 'G' else 'G')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()
if b in "AT":
    s = "AT".index(b)
    print("AT"[s - 1])
else:
    s = "GC".index(b)
    print("GC"[s - 1])

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:
d={"A":"T","T":"A","G":"C","C":"G"}
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==str("A"):
  print("T")
elif b==str("C"):
  print("G")
elif b==str("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, os
import collections

def solve(input_stream):
  table = {
    "A": "T",
    "T": "A",
    "C": "G",
    "G": "C"
  }
  ans = ""
  for i in input_stream.readline().strip():
    ans += table[i]
  return [ans]

if __name__ == "__main__":
    outputs = solve(sys.stdin)
    for line in outputs:
      print(line)

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

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

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

Submission status: Accepted

Solution code:
b = input()

d = {"A": "T", "T": "A", "C": "G", "G": "C"}
print(d.get(b))

Submission status: Accepted

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

p_a()

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#import math.sqrt as sqrt

#S = list(map(int, input().split()))
#B = list(map(int, input().split()))

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()
    
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:
import sys
input = sys.stdin.readline
dictionary = {"A":"T","T":"A","C":"G","G":"C"}
def print_ans(b):
    """Test Case
    >>> print_ans("A")
    T
    >>> print_ans("G")
    C
    """
    print(dictionary[b])


if __name__ == '__main__':
    b = input().rstrip()
    print_ans(b)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
import datetime

# 入力
#N = int(input())
#S = str(input())
#H, W = map(int, input().split())
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:
dic = {
        "A": "T",
        "T": "A",
        "C":"G",
         "G":"C"
        }
b = input()
print(dic[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:
t1 = 'ACGT'
t2 = 'TGCA'

c = input()
i = t1.index(c)
print(t2[i])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ == "__main__":
    main()

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()
l = "ATCG"

if b == l[0]: print(l[1])
if b == l[1]: print(l[0])
if b == l[2]: print(l[3])
if b == l[3]: print(l[2])

Submission status: Accepted

Solution code:
print('ATCG'['TAGC'.find(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:
print({"A": "T", "C": "G", "G": "C", "T": "A"}[input()])

Submission status: Accepted

Solution code:
b = input()
ans = ["0"]*len(b)
convert = {"A":"T","C":"G","G":"C","T":"A"}
for i in range(len(b)):
 	ans[i] = convert[b[i]]
for i in range(len(b)):
 	print(ans[i],end="")

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

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 "AT":print("T" if b=="A" else "A")
else:print("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()
list_one = ["A","T"]
list_two = ["C","G"]
if b in list_one:
    res = "".join(list_one).replace(b,"")
elif b in list_two:
    res = "".join(list_two).replace(b,"")
print(res)

Submission status: Accepted

Solution code:
print('TGCA'['ACGT'.index(input())])

Submission status: Accepted

Solution code:
b = input()

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

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

Submission status: Accepted

Solution code:
#Double Helix
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()

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

Submission status: Accepted

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

base = input()
print(base_pairs[base])

Submission status: Accepted

Solution code:
# 2019-11-12 22:21:08(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np 

def main():
    b = sys.stdin.readline().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:
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")
if b == "T":
    print("A")
    
if b == "C":
    print("G")
if b == "G":
    print("C")

Submission status: Accepted

Solution code:
b = input()

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

print(combination[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:
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 =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()

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

ret = dic[b]


print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC 122: A – Double Helix
bonds_pairs = [['A', 'T'], ['C', 'G']]
b = input()
for pairs in bonds_pairs:
    if b in pairs:
        print(pairs[1 - pairs.index(b)])
        break

Submission status: Accepted

Solution code:
b = input()
c = {"A":"T", "T":"A", "G":"C", "C":"G"}
print(c[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:
def main():
    b = input()
    array = ['A','C','G','T']
    if b == array[0]:
        print(array[3])
    if b == array[1]:
        print(array[2])
    if b == array[2]:
        print(array[1])
    if b == array[3]:
        print(array[0])

if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
b = input()
s = {"A": "T", "C": "G", "G": "C", "T": "A"}

print(s[b])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

s = stdin.readline().rstrip()

li = ["A","T"]
li2 = ["C","G"]

if s in li:
    li.pop(li.index(s))
    print(li[0])
else:
    li2.pop(li2.index(s))
    print(li2[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
b = input()

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

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

Submission status: Accepted

Solution code:
S = "ACGT"
T = "TGCA"

b = input()
print(T[S.index(b)])

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:
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("".join([{'A':'T','T':'A','C':'G','G':'C'}[i] for i in input()]))

Submission status: Accepted

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

if b in x:
    x.remove(b)
    print(x[0])
else:
    y.remove(b)
    print(y[0])

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

Submission status: Accepted

Solution code:
b = str(input())

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

print(di[b])

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:
#!/usr/bin/env python3

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n=str(input())
print("T" if n=="A" else "G" if n=="C" else "C" if n=="G" else "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=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=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:
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()
s = ["A" , "C" , "G" , "T"]

for i in range(4):
    if s[i] == b:
        print(s[3 - i])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    d = {"A": "T", "T": "A", "C": "G", "G": "C"}
    s = str(input().rstrip('\n'))
    print(d[s])


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
a = input()
print("AT".replace(a,"") if a in "AT" else "GC".replace(a,""))

Submission status: Accepted

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

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

print(bd[b])

Submission status: Accepted

Solution code:
b = list(input())
ans = list()
for i in range(len(b)):
    if b[i] == "A":
        ans.append("T")
    elif b[i] == "T":
        ans.append("A")
    elif b[i] == "C":
        ans.append("G")
    else:
        ans.append("C")
print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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=='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:
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()
a, c = "AT", "CG"
print(a.strip(b)) if b in a else print(c.strip(b))

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

Submission status: Accepted

Solution code:
b = input()

if b == 'T':
  print('A')
if b == 'G':
  print('C')
if b == 'A':
  print('T')
if 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:
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:
'''A - Double Helix
https://atcoder.jp/contests/abc122/tasks/abc122_a

>>> main('A')
T
>>> main('G')
C
'''


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


if __name__ == '__main__':
    main(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()
print('A' if B == 'T' else 'T' if B == 'A' else 'C' if B == 'G' else 'G')

Submission status: Accepted

Solution code:
print("TAGC"["ATCG".index(input())])

Submission status: Accepted

Solution code:
b = input()

at,gc = "AT","GC"

if b in at:
    print(at.replace(b, ""))
else:
    print(gc.replace(b, ""))

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    d = {"A": "T", "T": "A", "C": "G", "G": "C"}
    b = str(input().rstrip('\n'))
    print(d[b])


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
b = input()
a = ["A", "T"]
c = ["C", "G"]
if b is a[0]:
  print(a[1])
if b is a[1]:
  print(a[0])
if b is c[0]:
  print(c[1])
if b is c[1]:
  print(c[0])

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

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:
print("TGCA"["ACGT".index(input())])

Submission status: Accepted

Solution code:
b = input()
if b == 'A' or b == 'T':
    print('AT'.replace(b, ''))
elif b == 'C' or b == 'G':
    print('CG'.replace(b, ''))

Submission status: Accepted

Solution code:
S = [['A','C','G','T'],['T','G','C','A']]
print(S[1][S[0].index(input())])