Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- class FindPrimeNumbers
- {
- static void Main()
- {
- int[] numbers = new int[10000001];
- bool[] prime = new bool[10000001];
- for (int i = 2; i < 10000001; i++)
- {
- numbers[i] = i;
- prime[i] = true;
- }
- for (int i = 2; i < Math.Sqrt(10000000); i++)
- {
- for (int j = i*i; j < 10000001; j+=i)
- {
- prime[j] = false;
- }
- }
- for (int i = 0; i < 10000001; i++)
- {
- if (prime[i] == true)
- {
- Console.Write(numbers[i]);
- Console.Write(", ");
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement