歐拉篩法_求素數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

>>阅读原文<<