[SW Expert Academy] 구구단 1 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AXkcWgFa8sADFAS8&categoryId=AXkcWgFa8sADFAS8&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=8

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();
			
			boolean isExist=false;
			
			for(int i=1;i<=9;i++) {
				for(int j=1;j<=9;j++) {
					if(i*j==n) {
						isExist=true;
						break;
					}
				}
				if(isExist==true) break;
			}
			
			if(isExist==true) {
				System.out.println("#"+tc+" "+"Yes");
			}
			else {
				System.out.println("#"+tc+" "+"No");
			}
			
		}
		
		
	}
}

 

반복문을 2번 돌리면 되는 간단한 완전탐색 문제이다.