Project Euler Problem 7

public class E7 {
    public static void main(String[] args) {
        int count=0;
        boolean finish=true;
        boolean isPrime=true;
        int i=2;
        while (finish)
        {
            int middle=(int)Math.sqrt(i);
            for(int j=1;j<=middle;j++)
            {
                if(i%j==0&&j!=1)
                {
                    isPrime=false;
                    break;
                }
            }
            if(isPrime)
                count++;
            if(count==10001)
                finish=false;
            i++;
            isPrime=true;
        }
        System.out.println(i-1);
    }
}

应该可以再改进