题目描述:
Output the k-th prime number.
输入:
k≤10000
输出:
The k-th prime number.
样例输入:
3
7
样例输出:
5
17
来源:
2008年上海交通大学计算机研究生机试真题
#include <cstdio>
#include <cmath>
bool isPrime(int x){
if((x & 1) == 0){
return 0;
}else{
for(int i = 3;i <= sqrt(x);i+= 2){
if(x % i == 0)return 0;
}
}
return 1;
}
int main(){
int n;
int prime[10002];
int cnt = 1;
prime[cnt++] = 2;
int i = 3;
while(true){
if(isPrime(i))
prime[cnt++] = i;
i++;
if(cnt > 10000)break;
}
while(scanf("%d",&n) != EOF){
printf("%d\n",prime[n]);
}
}