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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>

int main()
{
	int N, Q;
	char S[131072];
	scanf("%d %d\n%s\n", &N, &Q, S);

	int count = 0;
	int res[131072];
	res[0] = 0;
	for(int n=1; n<N; n++){
		if(S[n-1] == 'A' && S[n] == 'C'){
			count++;
		}
		res[n] = count;
	}

	for(int q=0; q<Q; q++){
		int l, r;
		scanf("%d%d", &l, &r);
		printf("%d\n", res[r-1]-res[l-1]);
	}
}