[SWEA] 10570. 제곱 팰린드롬 수_JAVA

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

SW Expert Academy

 

 

회문 간단하게 구하기 

static boolean is_par(String str) {
        String tmp = new StringBuilder(str).reverse().toString();
        if(str.equalsIgnoreCase(tmp)){
            return true;
        }
        else return false;
    }

 

 

전체 코드 

import java.util.Scanner;
class Solution{
    public static void main(String args[]) throws Exception{
        Scanner sc = new Scanner(System.in);
        int T=sc.nextInt();
        for(int test_case = 1; test_case <= T; test_case++) {
            boolean arr[]=new boolean[1001];
            for(int num=1;num<=35;num++){
                if(is_par(String.valueOf(num)) && is_par(String.valueOf(num*num))){
                    arr[num*num]=true;
                }
            }
//           3
            int A = sc.nextInt();
            int B = sc.nextInt();
            int cnt = 0;

            for (int num = A; num <= B; num++) if (arr[num]) cnt++;
            System.out.println("#"+test_case+" "+cnt);
        }
    }
    static boolean is_par(String str) {
        String tmp = new StringBuilder(str).reverse().toString();
        if(str.equalsIgnoreCase(tmp)){
            return true;
        }
        else return false;
    }
}