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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main(void){
    static char str[100001];
    int len;//N 文字列の長さ
    int q;//Q 問の個数
    //scope[i][0]:l, scope[i][1]:r
    static int scope[100000][2];
    static int ans[100000];
    int i,j,count;
    
    scanf("%d %d", &len, &q);
    scanf("%s", str);
    for(i = 0; i < q; i++){
        scanf("%d %d", &scope[i][0], &scope[i][1]);
    }
    
    
    for(i = 0; i < q; i++){
        //1から数える文化
        count = 0;
        
        for(j = scope[i][0] - 1; j < scope[i][1] - 1; j++){
            if(str[j] == 'A' && str[j+1] == 'C'){
                count++;
                j++;
            }
        }
        ans[i] = count;
    }
    
    
    for(i = 0; i < q; i++){
        printf("%d\n", ans[i]);
    }
    
    return 0;
}