[백준 알고리즘] 1552번 빠른 A+B(Python3, Java)

<Python3>

import sys

n = sys.stdin.readline()
n= int(n)

for i in range(n):
    line= sys.stdin.readline()
    a,b = line.split()
    print(int(a)+int(b))

 

<Java>

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

public class b_15552 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int T = Integer.parseInt(br.readLine());
        StringBuilder sb = new StringBuilder();

        for(int i=0; i<T; i++){
            StringTokenizer st = new StringTokenizer(br.readLine(), " ");
            sb.append(Integer.parseInt(st.nextToken())+Integer.parseInt(st.nextToken()));
            if(i!=(T-1))
                sb.append('\n');
        }
        System.out.println(sb);
    }
}

 문제 설명에는 BufferedReader와 BufferedWriter를 써보라 했지만 그냥 손에 익은 StringBuilder로 코드를 작성해보았다.

 

▼링크

https://www.acmicpc.net/problem/15552

15552번: 빠른 A+B