[SW Expert Academy] 원 안의 점 (D3)

https://swexpertacademy.com/main/solvingProblem/solvingProblem.do

SW Expert Academy

 

import java.util.Scanner;

class Solution {
	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 count=0;
			
			for(int i=-n;i<=n;i++) {
				for(int j=-n;j<=n;j++) {
					if(i*i+j*j<=n*n) {
						count++;
					}
				}
			}
			
			System.out.println("#"+tc+" "+count);
			
		}
		
	}
}