[SW Expert Academy] 1차원 정원 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AX_N3oSqcyUDFARi&categoryId=AX_N3oSqcyUDFARi&categoryType=CODE&problemTitle=1%EC%B0%A8%EC%9B%90+%EC%A0%95%EC%9B%90&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1

SW Expert Academy

 

 

import java.util.Scanner;

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

		for (int tc = 1; tc <= t; tc++) {
			int n = sc.nextInt();
			int d = sc.nextInt();

			int range = 2 * d + 1; // 뿌릴 수 있는 범위
			System.out.println("#" + tc + " " + (n % range == 0 ? n / range : n / range + 1));
		} 
		
		//딱 맞으면 끝나고, 남으면 1번 더 뿌려야함

	}
}