[SW Expert Academy] Calkin-Wilf tree 1 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AXgZSOn6ApIDFASW&categoryId=AXgZSOn6ApIDFASW&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

 

import java.util.Scanner;

public class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {

			int a = 1;
			int b = 1;
			

			String s = sc.next();

			for (int i = 0; i < s.length(); i++) {
				if (s.charAt(i) == 'L') {
					b=(a+b);
				} else {
					a=(a+b);
				}
			}
			
			System.out.println("#"+tc+" "+a+" "+b);

			

		}

	}
}

 

처음에는 복잡한 문제인가 싶었는데 읽어보니 간단한 문제였다.