poj 1811 Prime Test
摘要：
一直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.ne 阅读全文
posted @ 2011-08-14 09:15 more think, more gains 阅读(169) 评论(0) 推荐(0) 编辑
