解题思路：判断素数模板题。 1 #include 2 #include 3 #include 4 using namespace std; 5 const int maxn = 16005; 6 int vis[maxn]; 7 8 void Init() 9 {10 memset(vis...
分类：
其他好文 时间：
2015-11-21 15:55:30
阅读次数：
306
Problem Description
Write a program to read in a list of integers and determine whether or not each number is prime. A number, n, is prime if its only divisors are 1 and n. For this problem, the numbers 1 and 2 are not considered primes.
Input
Each inp...
分类：
其他好文 时间：
2015-03-13 14:24:56
阅读次数：
130
