【CodeChef】Holes in the text

Problem here
All submissions for this problem are available.

Problem

Chef wrote some text on a piece of paper and now he wants to know how many holes are in the text. What is a hole? If you think of the paper as the plane and a letter as a curve on the plane, then each letter divides the plane into regions. For example letters “A”, “D”, “O”, “P”, “R” divide the plane into two regions so we say these letters each have one hole. Similarly, letter “B” has two holes and letters such as “C”, “E”, “F”, “K” have no holes. We say that the number of holes in the text is equal to the total number of holes in the letters of the text. Help Chef to determine how many holes are in the text.

Input

The first line contains a single integer T <= 40, the number of test cases. T test cases follow. The only line of each test case contains a non-empty text composed only of uppercase letters of English alphabet. The length of the text is less then 100. There are no any spaces in the input.

Output

For each test case, output a single line containing the number of holes in the corresponding text.

Example

Input:

2
CODECHEF
DRINKEATCODE

Output:

2
5

Solution

#include <iostream> #include <string> using namespace std; char tex[] = {'A', 'B', 'D', 'O', 'P', 'Q', 'R', 'a', 'b', 'd', 'e', 'g', 'o', 'p', 'q'}; int main(){ int n; while(cin >> n){ while(n--){ string input; int count = 0; cin >> input; for(int i = 0; i < input.length(); i++){ for(int j = 0; j < sizeof(tex); j++){ if(input[i] == tex[j]){ count++; if(input[i] == 'B'){ count++; } } } } cout << count << endl; } } return 0; }