链家模拟笔试第二题，求最小的第n个质数通过率为0

#include <stdio.h>
#include <iostream>
#include <math.h>
using namespace std;
bool isprime(long a)
{
	for (long i = 2; i <= sqrt(a); i++)
	{
		if (a%i == 0)
			return false;
	}
	return true;
}

int main()
{
	long n;
	while (cin >> n)
	{
		long result;
		long times = 0;
		for (long i = 2; times < n; i++)
		{
			if (isprime(i))
				times++;
			if (times == n)
				result = i;
		}
		cout << result << endl;
	}
	return 0;
}