#include "iostream"
#include "cmath"
using namespace std;
bool is_primer(int n)
{
if (n == 1)
return false;
int b = floor(sqrt(double(n))+0.5);
for (int i = 2; i <= b; i++)
if (n % i == 0)
return false;
return true;
}
int main()
{
int n, count = 0;
cin >> n;
for (int i = 1; ; i++)
{
if (is_primer(i))
count++;
if (count == n)
{
cout << i << endl;
break;
}
}
}
sicily 1561
最新推荐文章于 2016-11-23 20:30:37 发布