题解 | #Prime Number#
Prime Number
https://www.nowcoder.com/practice/c5f8688cea8a4a9a88edbd67d1358415
#include <stdio.h>
#include<math.h>
#define true 1
#define false 0
int isPrime(int n)
{
int i;
for(i=2;i<(int)sqrt(n)+1;i++)
{
if(n%i==0)return false;
}
return true;
}
int main() {
int i,k;
scanf("%d",&k);
i=2;
while(k>0)
{
if(isPrime(i)==true)k--;
i++;
}
printf("%d",i-1);
}
查看9道真题和解析