题解 | #自守数#
自守数
https://www.nowcoder.com/practice/88ddd31618f04514ae3a689e83f3ab8e
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int count = 0;
for (int i = 0; i <= n; i++){
if(isSelfConservative(i)){
count++;
}
}
System.out.print(count);
}
public static boolean isSelfConservative(int num){
String s = new String(""+num);
int sqr = num*num;
int bits = s.length();
int tens = (int) Math.pow(10,bits);
int tail = sqr%tens;
if(num==tail){
return true;
}
return false;
}
}
投递小红书等公司6个岗位 >