By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
What is the 10 001st prime number?
通过列出前六个素数:2,3,5,7,11和13,我们可以看到第6个素数是13。
第是10 001素数是什么?
1.素数筛思想:
#include <stdio.h>
#define max 200000
int main(){
int prime[max + 5] = {0};
for(int i = 2; i < max; i++){
for(int j = 2; i * j < max; j++){
prime[i * j] = 1;
}
}
int count = 0;
for(int i = 2; i < max; i++){
if(prime[i] == 0) {
count++;
if(count == 10001){
printf("%d\n",i);
}
}
}
return 0;
}
2.线性筛思想:
在素数筛中,有些合数被标记多次,Eg:15被3和5标记,一共标记了两次,为了标记将所有数字只标记一次,我们用到了线性筛prime[0]作为计数器显示有多少个素数,任何一个合数N = p * m p为小于m的最小素数
#include <stdio.h>
#define max 200000
int main(){
int prime[max + 5] = {0};
for(int i = 2; i < max; i++){
if(!prime[i]) {prime[++prime[0]] = i;}
for(int j = 1; j <= prime[0]; j++){
if(i * prime[j] > max) break;
prime[i * prime[j]] = 1;
if(i % prime[j] == 0) break;
}
}
printf("%d\n",prime[10001]);
return 0;
}