Question 60: Use the sieve method to obtain the prime number within 10000.

Print? /* Start the comments in the program header (to avoid any problems encountered during the submission of blog posts, the slash used to indicate that the comments have been deleted)
* Copyright and version Declaration of the program
* All rights reserved.
* File name: txt. c
* Author: liuyongshui
* Question: Use the sieve method to obtain the prime number within 10000.
* Problem source:
* Completion date: January 1, April 18, 2013
* Version No.: V1.0
*/
# Include <stdio. h>
 
# Deprecision NUM 10000
 
Int main ()
{
Int I;
Int j;
Int a [NUM] = {0 };
 
For (I = 2; I <NUM; I ++) // skip because 0 1 is not a prime number
{
A [I] = 1;
}
 
For (I = 0; I <NUM; I ++)
{
If (a [I] = 1)
{
Printf ("% 4d is a prime number. \ n", I );
 
For (j = I; j <NUM; j + = I)
{
If (j % I = 0)
{
A [j] = 0;
}
}
}
}
 
Return 0;
}

/* Start the comments in the program header (to avoid any problems encountered during the submission of blog posts, the slash used to indicate that the comments have been deleted)
* Copyright and version Declaration of the program
* All rights reserved.
* File name: txt. c
* Author: liuyongshui
* Question: Use the sieve method to obtain the prime number within 10000.
* Problem source:
* Completion date: January 1, April 18, 2013
* Version No.: V1.0
*/
# Include <stdio. h>

# Deprecision NUM 10000

Int main ()
{
Int I;
Int j;
Int a [NUM] = {0 };

For (I = 2; I <NUM; I ++) // skip because 0 1 is not a prime number
{
A [I] = 1;
}

For (I = 0; I <NUM; I ++)
{
If (a [I] = 1)
{
Printf ("% 4d is a prime number. \ n", I );

For (j = I; j <NUM; j + = I)
{
If (j % I = 0)
{
A [j] = 0;
}
}
}
}

Return 0;
} Local