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

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <string>

using namespace std;

int main () {
  int Q, N;
  string S;
  int dp[100005];

  cin >> N >> Q;
  cin >> S;

  dp[0] = 0;
  for (int i=1; i<N; i++) {
    dp[i] = dp[i-1];
    if (S[i-1] == 'A' && S[i] == 'C') {
      dp[i]++;
    }
  }

  for (int i=0; i<Q; i++) {
    int l,r;
    cin >> l >> r;
    cout << dp[r-1] - dp[l-1] << endl;
  }

  return 0;
}