题意:寻找第几个素数
Sample Input
30
Sample Output
113
代码实现:
// 寻找第n个素数
#include<iostream>
#include<cmath>
using namespace std;
bool isPrime(int num) {
int temp = floor(sqrt(double(num)) + 0.5);
for (int i = 2; i <= temp; ++i)
if (num%i == 0)
return false;
return true;
}
int main() {
int n;
cin >> n;
int count = 0;
// for循环中加上判断条件i <= 10000就一直出错
for (int i = 2; ; i++) {
if (isPrime(i))
count++;
if (count == n) {
cout << i << endl;
break;
}
}
return 0;
}