๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
Algorithm/๋ฐฑ์ค€ ์•Œ๊ณ ๋ฆฌ์ฆ˜

[๋ฐฑ์ค€ ์•Œ๊ณ ๋ฆฌ์ฆ˜] 11022๋ฒˆ - A+B - 8

by ์ฝ”๋”ฉํ•˜๋Š” ๋ถ•์–ด 2021. 1. 31.
๋ฐ˜์‘ํ˜•

3. for๋ฌธ - A+B - 8

 

 

๋ฌธ์ œ) ๋‘ ์ •์ˆ˜ A์™€ B๋ฅผ ์ž…๋ ฅ๋ฐ›์€ ๋‹ค์Œ, A+B๋ฅผ ์ถœ๋ ฅํ•˜๋Š” ํ”„๋กœ๊ทธ๋žจ์„ ์ž‘์„ฑํ•˜์‹œ์˜ค.

์ž…๋ ฅ ์ถœ๋ ฅ
5
1 1
2 3
3 4
9 8
5 2
Case #1: 1 + 1 = 2
Case #2: 2 + 3 = 5
Case #3: 3 + 4 = 7
Case #4: 9 + 8 = 17
Case #5: 5 + 2 = 7

 

import java.util.Scanner;

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

		for (int i = 1; i <= n; i++) { // i๋Š” 1์ด๊ณ  i๊ฐ€ n๊ณผ ํฌ๊ฑฐ๋‚˜ ๊ฐ™์„๋•Œ๊นŒ์ง€ i๊ฐ’ ์ถœ๋ ฅ ํ›„ 1์”ฉ ์ฆ๊ฐ€
			int a = sc.nextInt();
			int b = sc.nextInt();
			System.out.println("Case #" + i + ": " + a + " + " + b + " = " + (a + b));
		}
	}
}
๋ฐ˜์‘ํ˜•

๋Œ“๊ธ€