欧拉筛法_求素数O(n)

欧拉筛法_求素数O(n) Theoretical basis:任何合数（combined number）都能表示成一系列素数（pirme number）的积。 Because every combined number has its own maximal prime factor(let's call it maxp),it's better to screen prime numbers b

>>阅读原文<<