题解 | #KiKi求质数个数#
KiKi求质数个数
http://www.nowcoder.com/practice/d3a404ee0f8d41f98bf4707035d91086
#include <iostream>
using namespace std;
int main()
{
int geshu=1; //因数个数
int count = 0;//质数个数
for (int i = 100; i < 1000; i++)
{
for (int j = 2; j <= i; j++)
{
if (i % j == 0)
geshu++;
if(geshu>2)
break;
}
if (geshu == 2)
count++;
geshu = 1;
}
cout << count << endl;
}
