Project Euler 35

原题：

The number, 197, is called a circular prime because all rotations of the digits:
  197, 971, and 719, are themselves prime.
There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.
How many circular primes are there below one million?

 

分析：

因为这种数的没一位都可能作为各位数。所以每一位的取值必为奇数。(1,3,5,7,9)public class Problem35 { //判断是否为质数 static boolean isPrime(int number){ for(int i=2;i<=Math.sqrt(number);i++){ if(number%i==0) return false; } return true; } //得到当前数所有的循环数都为质数，则返回true static boolean getThemSelvesPrimes(int number){ int length = String.valueOf(number).length(); if(length == 1){ return true; }else{ for(int i=0;i<length-1;i++){ int x = number%10*(int)Math.pow(10, length-1); int y = number/10; number = x+y; if(!isPrime(number)) return false; } } return true; } public static void main(String[] args) { long beginTime = System.currentTimeMillis(); int count = 0; for(int i=2;i<1000000;i++){ if(isPrime(i)&&getThemSelvesPrimes(i)){ System.out.println(i); count++; } } System.out.println("count:"+count);//55 long endTime = System.currentTimeMillis(); System.out.println(endTime-beginTime+"ms"); } }