The basic idea of using sieve to find prime numbers is to set up the positive integers from 1 to a certain extent, and 1 are not prime numbers. The smallest number in the remaining number is a prime number, and then the multiple of it is removed. The analogy is in turn until the sieve ends when it is empty. If there are: 12345678910 111213141516171819 20 212223242526272829 30 1 is not a prime number, get rid of it. The smallest number in the remaining 2 is the prime number, and the number of 2 is removed, and the remaining number is: 3579111315171921 23252729

Filename	Size	Update
筛法求素数.exe	401405049	2016-12-27
筛法求素数.cpp	774	2016-12-27

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．