poj 1811 Prime Test

weixin_30883311

于 2019-08-14 06:50:06 发布

阅读量129

点赞数

文章标签： java

原文链接：http://www.cnblogs.com/tangcong/archive/2011/08/14/2137701.html

版权

一直RE, 据说是爆栈啦。。。。

import java.math.BigInteger;
import java.util.Scanner;

public class prime {
public static void main(String args[]) {
int n, flag = 0, i;
        BigInteger a, b, t, c, v;
        Scanner cin = new Scanner(System.in);
        b = BigInteger.valueOf(2);
        n = cin.nextInt();
for (i = 0; i < n; i++) {
            t = cin.nextBigInteger();
if (t.isProbablePrime(1000))
                System.out.println("Prime");
else {
for (;;) {
                    c = t.mod(b);
if (c.compareTo(BigInteger.ZERO) == 0) {
                        System.out.println(b);
break;
                    } else
                        b = b.nextProbablePrime();

                }
            }

        }
    }
}