Finding all the prime numbers till 1e5

Revision en1, by AmanFTW, 2025-04-30 19:23:04

int maxx = 1e5; vector prime; prime.resize(maxx); for(int i =1;i<maxx;i++){ prime[i]=1; } for(int i =2;i<maxx;i++){ if(prime[i]==1){ for(int j =i;j<maxx;j+=i){ prime[j]=0; } } }

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English AmanFTW 2025-04-30 19:23:04 233 Initial revision (published)