1
public class Problem3 {

    public static void main (String args[]) {
        System.out.print(primeMod(60085147514L));
    }

    public static double primeMod(long d) {
        long max = 0;
        int count = 0;

        for (long i = 2; i < d; i++) {
            if (d % i == 0) { 
                boolean isPrime = primeCounter(i);
                if(isPrime == true) { 
                    max = i;
                    System.out.println(max);
                }
            } else {
                max = max;
            }
        }

        return max;
    }

    public static boolean primeCounter(long x) {
        int count = 0;
        for (int s = 1; s <= x; s++) {
            if (x % s == 0) {
                count++;
            }
        }

        if (count == 2) {
            return true;
        } else {
            return false;
        }
    }
}

我的程序适用于较小的数字,但是当它不被零除时,它会抛出除以 0 的算术异常。请不要给我答案,只是想理解它并提高我的技能谢谢

4

1 回答 1

4

我的猜测s是溢出,最终导致除以零。换s一个long

于 2012-09-26T22:23:41.960 回答