Answers for "find all prime in a range"

Whatever

0

find all prime in a range

 	bool prime[100001];
    memset(prime,true,sizeof(prime));
    prime[0]=prime[1]=false;
    for(long long p=2;p*p<=100000;p++){
        if(prime[p]==true){
            for(int i=p*p;i<=100000;i+=p){
                prime[i]=false;
            }
        }
    }

Posted by: Guest on March-07-2022

Source

Code answers related to "find all prime in a range"

Code answers related to "Whatever"

Browse Popular Code Answers by Language

Python

Javascript

Whatever

Shell/Bash

CSS

Html

PHP

SQL

Java

C#