C#
#include<stdio.h>
#include<stdbool.h>
#include<math.h>
bool isPrime(int num);
int main(){
int num = 1;
int count = 0;
while (true)
{
num ++;
if(isPrime(num)) count++;
if(count == 10001) break;
}
printf("%d",num);
}
bool isPrime(int num){
if(num==2 || num==3) return true;
if(num % 2 == 0) return false;
for (int i = 3; i < sqrt(num)+1; i++)
{
if(num%i == 0) return false;
}
return true;
}
JAVA
package exercise;
public class _第10001个质数 {
private static boolean isPrime(int n) {
if (n == 2 || n == 3) {
return true;
}
if (n % 2 == 0) {
return false;
}
for (int i = 3; i < Math.sqrt(n) + 1; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
public static void main(String[] args) {
int num = 1, count = 0;
while (true) {
num += 1;
if (isPrime(num))
count += 1;
if (count == 10001)
break;
}
System.out.println(num);
}
}
结果:104743