[백준 알고리즘] Q8958 OX퀴즈

1. Java 구현

        
import java.io.*;

public class Main {
	public static void main(String[] args) throws NumberFormatException, IOException {
		/* 2018.08.12 */	
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		StringBuilder sb = new StringBuilder();
		
		int caseNum = Integer.parseInt(br.readLine());
		for(int i = 0; i < caseNum; i++) {
			char[] inputArr = br.readLine().toCharArray();
			
			int score = 1;
			int sum = 0;
			sum = inputArr[0] == 'O' ? sum + 1 : sum;
			for(int j = 1; j < inputArr.length; j++) {
				score = inputArr[j - 1] == 'O' ? score + 1 : 1;
				sum = inputArr[j] == 'O' ? sum + score : sum;
			}
			
			sb.append(sum + "\n");
		}
		
		bw.write(sb.toString());
		bw.close();
		br.close();
	}
}