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

X=['A','C','G','T']
Y=['T','G','C','A']

for i in range(4):
  if b==X[i]:
    print(Y[i])

Submission status: Accepted

Solution code:
b = input()

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

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

print(pattern[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')
else:
    pass

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:

# @ maspy
d = {'A':'T', 'T':'A', 'C':'G', 'G':'C'}
print(d[input()])

Submission status: Accepted

Solution code:
print('ACGT'['TGCA'.find(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={'A':'T','C':'G','G':'C','T':'A'}
print(b[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:
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")
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 == 'C': print('G')
elif b == 'G': print('C')

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:
# 初期入力
import sys
input = sys.stdin.readline
b =input().strip()
ans =""
if b=="A":
    ans="T"
elif b =="T":
    ans ="A"
elif b =="C":
    ans ="G"
elif b =="G":
    ans ="C"
print(ans)

Submission status: Accepted

Solution code:
a='ACGT';b='TGCA'
print(b[a.index(input())])

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():
    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()
number1 = ['A','T']
number2 = ['C','G']
print(number1[number1.index(b)-1]) if b in number1 else print(number2[number2.index(b)-1])

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()
#atcg
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:
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=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()
d={'A':'T','T':'A','C':'G','G':'C'}
print(d[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=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 = 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:
ans = {
    "A": "T",
    "C": "G",
    "G": "C",
    "T": "A",
}
print(ans[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:
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(int,input().split()))
LS=lambda:list(map(str,input().split()))

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

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

Submission status: Accepted

Solution code:
# input
b = input()

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

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:
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()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

Solution code:
print('TAGC'['ATCG'.find(input())])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
letter = input()

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

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

Submission status: Accepted

Solution code:
b = input()

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

print(convert[b])

Submission status: Accepted

Solution code:
b = input()

def tog(s):
    if s=="A":
        return "T"
    elif s=="T":
        return "A"
    elif s=="C":
        return "G"
    elif s=="G":
        return "C"
    else:
        return None

print(tog(b))

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy
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()
print('A' if b == 'T' else 'T' if b == 'A' else 'C' if b == 'G' else 'G')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    b = input()
    table = str.maketrans({'A':'T', 'T':'A', 'C':'G', 'G':'C'})
    print(b.translate(table))

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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 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)))
import numpy as np
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

b = input()

at = ["A", "T"]
gc = ["G", "C"]

if b == "A" or b == "T":
	at.remove(b)
	print(at.pop())
else:
	gc.remove(b)
	print(gc.pop())

Submission status: Accepted

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

print(versus[base.index(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:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
b = S()
ans = ''
if b == 'A':
    ans = 'T'
if b == 'C':
    ans = 'G'
if b == 'G':
    ans = 'C'
if b == 'T':
    ans = 'A'
print(ans)

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:
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:
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
import bisect

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

Submission status: Accepted

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

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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')
# ----------------------------------------------------------- #

b = S()
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
def input(): return sys.stdin.readline().strip()


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:
pairs = {
    'A': 'T',
    'T': 'A',
    'C': 'G',
    'G': 'C',
}

print(pairs[input()])

Submission status: Accepted

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

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

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

if __name__ == '__main__':

    ABC_122_A()

Submission status: Accepted

Solution code:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

    b = input()
    i = ATCG.index(b)
    print(ATCG[i ^ 1])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(['A','T','C','G'][((ord(input())+1)%5)])

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
b=input()
n=len(b)
l=[""]*n
for i in range(n):
    if b[i]=="A":
        l[i]="T"
    if b[i]=="T":
        l[i]="A"
    if b[i]=="G":
        l[i]="C"
    if b[i]=="C":
        l[i]="G"
print(*l)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()

dic={'A':'T','T':'A','G':'C','C':'G'}
print(dic[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:
D = {"A":"T","T":"A","C":"G","G":"C"}
b = input().strip()
x = ""
for i in range(len(b)):
    x += D[b[i]]
print(x)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
S = input()[: -1]
t = ["A", "C", "G", "T"]
for i in range(4):
  if S == t[i]:
    print(t[-1 - i])
    exit(0)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
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)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
#s=input().rstrip()
u=input().rstrip()
if u=="A":
    print("T")
elif u=="T":
    print("A")
elif u=="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:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    b = input()

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

b = readline().rstrip().decode()
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=""
for s in S:
    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:
def main():
    b = input()
    dic = {"A": "T", "T": "A", "C": "G", "G": "C"}
    print(dic[b])


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

Submission status: Accepted

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

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:
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", "T" : "A", "C" : "G", "G": "C"}

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

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

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

Submission status: Accepted

Solution code:
s = input()
ls = ['A', 'T', 'A', 'C', 'G', 'C']
print(ls[ls.index(s)+1])

Submission status: Accepted

Solution code:
b = input()
l1 = ['A','T']
l2 = ['C','G']
if b in l1:
  l1.remove(b)
  print(l1[0])
else:
  l2.remove(b)
  print(l2[0])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC122A

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
b=input()
bl=["A",'T','G','C']
bbb=["T",'A','C','G']
a=bl.index(b)
print(bbb[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:
b=input()
ans=""
for i in range(len(b)):
    if b[i]=="A":
        ans+="T"
    elif b[i]=="T":
        ans+="A"
    elif b[i]=="C":
        ans+="G"
    elif b[i]=="G":
        ans+="C"
print(ans)