코딩테스트 디폴트폼

코딩테스트를 위한 기본틀

import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class Main{
    public static void main(String[] args) throws IOException{
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(in.readLine());

        try{
            int a = Integer.parseInt(st.nextToken());
            int b = Integer.parseInt(st.nextToken());
            int ret = 0;

            if(0 >= a)   {
                System.out.println("A에 잘못된 값 입력");
            }
            if(b >= 10)  {
                System.out.println("B에 잘못된 값 입력");
            }

            ret = a+b;
            System.out.println(ret);

        }catch(NumberFormatException e){
            System.out.println("You have entered an invalid number");
        }

    }
}

import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class Main{
    
    private static int zeroCount = 0;
    private static int oneCount = 0;
    
    public static void main(String[] args) throws IOException{
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(in.readLine());
        
        try{
            int testCount = Integer.parseInt(st.nextToken());
            
            for(int i = 0; i < testCount; ++i){
                int fiboArgu = Integer.parseInt(st.nextToken());
                zeroCount = 0;
                oneCount = 0;
                
                fibonacci(fiboArgu);
                System.out.println(zeroCount + " " + oneCount);
            }
        }catch(NumberFormatException e){
            System.out.println("You have entered an invalid number");
        }

    }
    
    private static int fibonacci(int n) {
        if (n == 0) {
            ++zeroCount;
            return 0;
        } else if (n == 1) {
            ++oneCount;
            return 1;
        } else {
            return fibonacci(n-1) + fibonacci(n-2);
        }
    }
}