[SW expert Academy] SWEA 11688번 Calkin-Wilf truee 1 자바(Java)

[D3] Calkin-Wilf tree 1 - 11688

문제 링크

성능 요약

메모리: 52,764 KB, 시간: 272 ms, 코드길이: 553 Bytes

제출 일자

2023-10-28 04:21

출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

 

import java.util.Scanner;
class Solution
{
	public static void main(String args[]) throws Exception
	{
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for(int tc = 1; tc <= T; tc++)
		{
            String commands = sc.next();
            int a = 1, b = 1;
            for(char command : commands.toCharArray()){
                if(command == 'L'){
                    b = a + b;
                }else{
                    a = a + b;
                }
            }
            System.out.println("#" + tc + " " + a + " " + b);
		}
	}
}