鍥炴枃绱犳暟鏄寚涓�涓暟鍚屾椂涓虹礌鏁板拰鍥炴枃鏁般�備緥濡傦細
131
鏄竴涓礌鏁帮紝
鍚屾椂涔熸槸涓�涓洖鏂囩礌鏁般�傛暟瀛?/p>
313
鍜?/p>
757
涔熸槸濡傛銆傜紪鍐欑▼搴忥紝鏄剧ず
鍓?/p>
100
涓洖鏂囩礌鏁般�傛瘡琛屾樉绀?/p>
10
涓暟骞朵笖鏍囧噯瀵归綈锛屽涓嬫墍绀猴細
绋嬪簭濡備笅锛?/p>
public
class
xt {
public
static
void
main(String[] args){
int
count = 1;
int
i = 2 ;
while
(count <= 100){
if
(
isPrime
(i) &&
isPalindrome
(i)){
if
(count % 10 == 0){
System.
out
.printf(
"%10s\n"
, i);
}
else
{
System.
out
.printf(
"%10s"
, i);
}
count ++;
i++;
}
else
{
i++;
}
}
}
//
鍒ゆ柇涓�涓暟鏄惁涓虹礌鏁?/p>
private
static
boolean
isPrime(
int
Number){
boolean
primeBool =
true
;
for
(
int
i = 2;i <= (
int
)(Math.
sqrt
(Number));i++){
if
(Number % i == 0){
primeBool =
false
;
break
;
}
}
return
primeBool;