蓝桥杯算法提高题：素数筛选与计算.pdfVIP

C++:#includeiostrea

musingnamespace

std;longa,b,c,d,n;long

longsum=1;boolarr

[1299690]={0};int

main(){cinn;arr[2]=0;

for(a=2;a=1299689;a++)

if(arr[a]==0)for(b=2;b

=1000000;b++){if(a*b

1299689)break;arr[a*b

]=1;}for(a=2;a=1299689;

a++)if(arr[a]==0){su

m*=a;sum%=50000;n‑‑;

==0

if(n)break;}cout

sumendl;return(0);}

C:#includestdio.h#

includemath.hint

_

isprime(intx){int

i,s=sqrt(x);for(i=2;i

=s;i++){if(x%i==0)

{return0;}}return

1;}intmain(){

C++:

#includeiostream

usingnamespacestd;

longa,b,c,d,n;

longlongsum=1;

boolarr[1299690]={0};

intmain()

{

cinn;

arr[2]=0;

for(a=2;a=1299689;a++)

if(arr[a]==0)

for(b=2;b=1000000;b++)

{

if(a*b1299689)break;

arr[a*b]=1;

}

for(a=2;a=1299689;a++)

if(arr[a]==0)

{

sum*=a;

sum%=50000;

n--;

if(n==0)break;

}

coutsumendl;

return(0);

}

C:

#includestdio.h

#includemath.h

intis_prime(intx){

inti,s=sqrt(x);

for(i=2;i=s;i++){

if(x%i==0){

return0;

}

}

return1;

}

intmain()

{

_=0

//(%d,isprime(2));intn,count,i=1;long

longresult=1;scanf(%d,n);while(countn){i

_

++;if(isprime(i)){result=(result%50000)*(i%

50000)%50000;count++;}}printf(%I64d\n,

result);return0;}

JAVA:importjava.util.*;publicclassMain{

publicstaticvoidmain(Stringargs[]){

Scannerscanner=newScanner(System.in);

intn=scanner.nextInt();longsum=1;

booleanb[]=newboolean[2000000];inta[]=

newint[200001];for(inti=2;i2000000;i++){if(!

b[i])for(intj=i+i;j2000000;j+=i){b[j]=true;}}

=02000000;i++){if(!b[i]){

intcount;for(inti=2;i

sum=sum*i%50000