- using System.Collections;
- ...
- const int LAST_CANDIDATE = 1000;
- int primes = 0;
- BitArray candidates = new BitArray (LAST_CANDIDATE, true);
- for (int i = 2; i < LAST_CANDIDATE; i++)
- {
- if (candidates[i])
- {
- for (int j = i * 2; j < LAST_CANDIDATE; j += i)
- { candidates[j] = false; }
- }
- }
- for (int i = 1; i < LAST_CANDIDATE; i++)
- {
- if (candidates[i])
- {
- primes++;
- Console.Out.WriteLine (i);
- }
- }
- Console.Out.WriteLine
- ("\\n" + primes + " primes found in the range 2-" + LAST_CANDIDATE);
- //该片段来自于http://www.codesnippet.cn/detail/060620133858.html
来源: http://www.codesnippet.cn/detail/060620133858.html