on
Algorithm - 뒤집은 소수
Algorithm - 뒤집은 소수
public class Main {
public static void main( String [] args) throws IOException {
BufferedReader reader = new BufferedReader( new InputStreamReader( System . in ));
int n = Integer. parseInt (reader.readLine());
StringTokenizer st = new StringTokenizer(reader.readLine(), " " );
StringBuilder builder = new StringBuilder();
int arr[] = new int [n];
for ( int i = 0 ; i < n; i + + ) {
arr[i] = Integer. parseInt (st.nextToken());
}
for ( int i = 0 ; i < n; i + + ) {
String x = Integer. toString (arr[i]);
String temp = "" ;
for ( int j = x. length () - 1 ; j > = 0 ; j - - ) {
if (j = = x. length () - 1 & & x. charAt (j) = = '0' ) {
continue ;
} else {
temp + = x. charAt (j);
}
}
boolean flag = isPrime(Integer. parseInt (temp));
if (flag) {
builder.append(Integer. parseInt (temp) + " " );
}
}
System . out . println (builder);
}
public static boolean isPrime( int n) {
if (n = = 1 ) return false ;
for ( int i = 2 ; i < n; i + + ) {
if (n % i = = 0 ) {
return false ;
}
}
return true ;
}
}
from http://kdg-is.tistory.com/202 by ccl(A) rewrite - 2021-09-19 20:27:28