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:
def main():
    n=input()
    #=[int(i) for i in input().split()]
    if n == "A":
        print("T")
    elif n == "T":
        print("A")
    elif n == "C":
        print("G")
    else:
        print("C")

main()

Submission status: Accepted

Solution code:
N = 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:
import sys
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

s = ns()

if s == 'A':
  a = 'T'
  
if s == 'T':
  a = 'A'
  
if s == 'G':
  a = 'C'
  
if s == 'C':
  a = 'G'

print(a)

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:
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:
print(*map((lambda x: "TGCA"["ACGT".index(x)]), input()), sep='')

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

b = input()
pair = {"A":"T", "C":"G", "G":"C", "T":"A"}

print(pair[b])

Submission status: Accepted

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

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()
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:
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = s_inpl()   |	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = inpl()	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]

import math
import numpy as np
import copy
from collections import defaultdict, Counter
from itertools import product
from bisect import bisect_left, bisect_right

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

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

Submission status: Accepted

Solution code:
from math import *





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:
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

s = S()

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

Submission status: Accepted

Solution code:
h = input()

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

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

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:
n = 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:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


#A
def A():
    n = input()
    if n == "A":
        print("T")
    elif n == "C":
        print("G")
    elif n == "G":
        print("C")
    else:
        print("A")
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

Solution code:
b = input()
#a = [int(i) for i in input().split()]
#s = [[int(j) for j in input().split()] for i in range(N)]

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

print(listB[listA.index(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:
# coding:utf-8

import sys
# from collections import Counter, defaultdict

INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


def main():
    b = SI()
    tmp = {'A': 'T', 'T': 'A', 'C': 'G', 'G': 'C'}

    return tmp[b]


print(main())

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
b = input()
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 == "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 == 'G':
  print("C")
elif s == "C":
  print("G")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x =raw_input()

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

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
from operator import itemgetter
#以下てんぷら
def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")

def ip():
    return int(input())

def pne(n):
    print(n,end='')

rem = pow(10,9)+7

#n = ip()                                     #入力整数1つ
#x,y= (int(i) for i in input().split())       #入力整数横2つ以上
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[input() for i in range(n)]    #入力セット(整数改行あり)(2/2)

#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
#こっから本文
a = ["A","C","T","G"]
n =input()
l = a.index(n)
print(a[(l+2)%4])

Submission status: Accepted

Solution code:
#=map(int,input().strip().split())
#=int(input().strip())
#=list(map(int,input().strip().split()))
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=='G':
    print('C')
elif a=='C':
    print('G')

Submission status: Accepted

Solution code:
def main():
    b = input()
    # a, b = [int(q) for q in input().split()]
    # print(2)
    if b == "A":
        print("T")
    if b == "T":
        print("A")
    if b == "C":
        print("G")
    if b == "G":
        print("C")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
B = input()
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:
print(input().translate(str.maketrans("ATGC","TACG")))

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:
# N,M = map(int, input().split())
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()

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

print(d[b])

Submission status: Accepted

Solution code:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def pf(s): return print(s, flush=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

buff = io.BytesIO()
sys.stdout = buff


@atexit.register
def write():
    sys.__stdout__.write(buff.getvalue())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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


import itertools
import collections
import bisect

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

Submission status: Accepted

Solution code:
b = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18

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

Submission status: Accepted

Solution code:
dna = input()
if dna == "A": print("T")
elif dna == "T": print("A")
elif dna == "C": print("G")
elif dna == "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:
if __name__ == "__main__":
    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:
from collections import deque, defaultdict as ddic
from itertools import combinations, permutations, product
from heapq import heappush, heappop, heapify
import sys
stdout = sys.stdout
rr = lambda: input().strip()
rri = lambda: int(rr())
rrm = lambda: list(map(int, rr().split()))

def solve(S):
    if S=='A': return 'T'
    if S=='T': return 'A'
    if S=='C': return 'G'
    if S=='G': return 'C'
    

T = 1 #rri()
for tc in range(1, T+1):
    S = rr()
    ans = solve(S)
    print(ans)
    #print("Case #{}: {}".format(tc, ans))

Submission status: Runtime Error

Solution code:
s = int(input())

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

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

b = input()

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

if b == "A":
    answer = "T"
elif b == "T":
    anawer = "A"
elif b == "C":
    answer = "G"
elif b == "G":
    answer = "C"

print(answer)

Submission status: Runtime Error

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

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

b = input()

# 塩基bと対になる塩基を表す文字を出力せよ。
if b =="A":
    answer = "T"
elif b == "T":
    anawer = "A"
elif b == "C":
    answer = "G"
elif b == "G":
    answer = "C"

print(answer)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# 塩基 A, C, G, T が存在し、A と T、C と G がそれぞれ対

b = input()

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

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

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

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

Submission status: Runtime Error

Solution code:
# 塩基 A, C, G, T が存在し、A と T、C と G がそれぞれ対

b = input()

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

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

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

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

Submission status: Runtime Error

Solution code:
b=input()

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
b = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
if n==1:print("Hello word")
a=int(input())
b=int(input())
if n==2 :print(a+b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
b = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = input()

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

Submission status: Runtime Error

Solution code:
n, q = map(int, input().split())
s = input()
keep = [0]*(n)

for i in range(1, n):
    l, r = i-1, i+1
    if s[l:r] == "AC":
        keep[i] = 1

for j in range(q):
    l, r = map(int, input().split())
    print(sum(keep[l:r]))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
 
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	char s;
	cin>>s;
	if(s=='A'){
		cout<<"T";
	}
	else if(s=='T'){
		cout<<"A";
	}
	else if(s=='C'){
		cout<<"G";
	}
	else{
		cout<<"C";
	}
	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
b = list(input())

for i in len(b):
  if b[i] == "A":
    b[i] = "T"
  elif b[i] == "T":
    b[i] = "A"
  elif b[i] == "C":
    b[i] = "G"
  else:
    b[i] = "C"
    
print(b)

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
ls = []
sum,ans = 0,0
for w in range(N):
    ls1 = list(map(int,input().split()))
    ls.append(list(ls1))
    ls1.clear()
    ten = 0

for i in range(M-1):
    for j in range(i+1,M):
        for k in range(N):
            #print(i,j,k)
            if ls[k][i] >= ls[k][j]:
                ten = ls[k][i]
                sum += ten
                #print(ten,sum,i,j,k)
            else:
                ten = ls[k][j]
                sum += ten
                #print(ten,sum,i,j,k)
                #print(i)
                #print(j)
                #print(k)
        ans = max(sum,ans)
        sum = 0
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(versus[base.index(b)])

Submission status: Runtime Error

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: Runtime Error

Solution code:
n,q=(map(int,input().split()))
s=input()
count=0
for _ in range(q):
    l,r=(map(int,input().split()))
    for i in range(l,r):
        if s[i-1]=="A":
            if s[i]=="C":
               count+=1 
    print(count)
    count=0

Submission status: Runtime Error

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: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a <= k:
    print('Yay!')
else:
    print(':(')

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

Solution code:
from itertools import accumulate
N,Q = list(map(int,input().split()))
S = list(input())
cnt = [0]*(N)
for i in range(N-1):
    if S[i] == 'A' and S[i+1] == 'C':
        cnt[i] = 1
R = [0]+list(accumulate(cnt))
for k in range(Q):
    x,y = list(map(int,input().split()))
    print(R[y-1]-R[x-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
s=input()
le=len(s)
lis=[]
for i in range(0,le):
  if s[i]!="A" and s[i]!="" and s[i]!="T" and s[i]!="G":
    lis.append(i)
lo=0
for j in range(0,len(lis)-1):
  if lis[j+1]-lis[j]-1>=lo:
    lo=lis[j+1]-lis[j]-1
if lis[0]>=lo:
  lo=lis[j]
if le-lis[-1]-1>=lo:
  lo=le-lis[-1]-1
print(lo)

Submission status: Runtime Error

Solution code:
s=input()
le=len(s)
lis=[]
for i in range(0,le):
  if s[i]!="A" and s[i]!="" and s[i]!="T" and s[i]!="G":
    lis.append(i)
lo=0
for j in range(0,len(lis)-1):
  if lis[j+1]-lis[j]-1>=lo:
    lo=lis[j+1]-lis[j]-1
if lis[0]>=lo:
  lo=lis[j]
if len(lis)-lis[-1]+1>=lo:
  lo=len(lis)-lis[-1]-1
print(lo)

Submission status: Runtime Error

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

print(dict[b])

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
b = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
N, Q = map(int, input().split())
S = input()

for _ in range(Q):
    start, end = map(int, input().split())
    print(S.count('AC', start - 1, end))

Submission status: Runtime Error

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