题解 | #KiKi求质数个数#
KiKi求质数个数
http://www.nowcoder.com/questionTerminal/d3a404ee0f8d41f98bf4707035d91086
#include <bits/stdc++.h> using namespace std; bool isPrime(long long n) { if (n == 1) return false; if (n == 0) return false; for (long long i = 2 ; i * i <= n ; i++) { if(n % i == 0) return false; } return true; } int main() { int a=100,sum=0; while (a<=999) { if(isPrime(a)) sum++; a++; } cout << sum; return 0; }
