摘要：
http://poj.org/problem?id=3641 1 #include"iostream" 2 #include"cmath" 3 using namespace std; 4 bool isprime(long long n){ 5 if(n==2) 6 return true; 7 if(n<=1||n%2==0) 8 return false; 9 long long j = 3;10 while(j<=(long long )sqrt((double)n)){11 if(n%j==0)12 ... 阅读全文
