[SW Expert Academy] 제곱 팰린드롬 수 (D3)

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

SW Expert Academy

 

import java.util.Scanner;

public 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 count = 0;

			int a = sc.nextInt();
			int b = sc.nextInt();

			for (int i = a; i <= b; i++) {

				String str = Integer.toString(i);

				boolean isPossible = true;

				int s = 0;
				int e = str.length() - 1;

				while (s <= e) {
					if (str.charAt(s) != str.charAt(e)) {
						isPossible = false;
						break;
					}
					s++;
					e--;
				}

				if (isPossible == false)
					continue;

				if (Math.sqrt(i) % 1 != 0) {
					continue;
				}

				String str1 = Integer.toString((int) Math.sqrt(i));

				s = 0;
				e = str1.length() - 1;

				while (s <= e) {
					if (str1.charAt(s) != str1.charAt(e)) {
						isPossible = false;
						break;
					}
					s++;
					e--;
				}

				if (isPossible == true) {
					//System.out.println(i);
					count++;
				}

			}
			
			System.out.println("#"+tc+" "+count);

		}

	}
}

 

 

 

아래는 함수화한 코드

import java.util.Scanner;

public 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 count = 0;

			int a = sc.nextInt();
			int b = sc.nextInt();

			for (int i = a; i <= b; i++) {

				String str = Integer.toString(i);

				if (Math.sqrt(i) % 1 != 0) {
					continue;
				}

				boolean isPossible = true;

				int s = 0;
				int e = str.length() - 1;

				isPossible = isPalindrome(str, s, e);

				if (isPossible == false)
					continue;

				String str1 = Integer.toString((int) Math.sqrt(i));

				s = 0;
				e = str1.length() - 1;

				isPossible = isPalindrome(str1, s, e);

				if (isPossible == true) {
					// System.out.println(i);
					count++;
				}

			}

			System.out.println("#" + tc + " " + count);

		}

	}

	public static boolean isPalindrome(String str, int s, int e) {
		while (s <= e) {
			if (str.charAt(s) != str.charAt(e)) {
				return false;
			}
			s++;
			e--;
		}

		return true;
	}

}

 

제곱근이 정수일 때 팰린드롬 검사를 실시했다.