import java.io.*;
import java.util.*;

public class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

		int cnt = Integer.parseInt(br.readLine());
		int a,b;
		for (int i=1; i<=cnt ; i++){
			String line = br.readLine();
			StringTokenizer st = new StringTokenizer(line, " ");
			a=Integer.parseInt(st.nextToken());
			b=Integer.parseInt(st.nextToken());
			bw.write("Case #" + i + ": "+a +" + " + b + " = " + (a+b) +"\n");
		}
		bw.flush();//남아있는 데이터를 모두 출력시킴
		bw.close();//스트림을 닫음
	}
}

'알고리즘 > acmicpc.net' 카테고리의 다른 글

10871  (0) 2020.07.08
2439  (0) 2020.07.08
11021.  (0) 2020.07.08
2741. N찍 & 2742.N반대로찍  (0) 2020.07.08
15552. Fast A+B  (0) 2020.07.08

+ Recent posts