#include
main()
{
unsigned i,k,factor;
int a[101];
for(i=2;i<=100;i++) /*Initialization*/
a[i]=1;
factor=2;
while(factor<=100)
{
if(a[factor]==1)
{
printf("%2d\t",factor);
k=factor;
while(k<=100)
{
a[k]=-1;
k+=factor;
}
}
factor++;
}
putchar('\n');
}
/* Sieve Method: In ancient Greek, one scholar named Eratosthenes discover a method to find out prime numbers less than N. It is that place N natural numbers from minimum to maximum, the first number 'one' which is neither a prime number nor a divisible number need to be redlined, keep the second number 'two' which is a prime mumber, then redline all numbers which could be divided exactly by two, if n+1 is not be redlined before, make it a divisor, all numbers after it could be divided exactly by it should be redlined also. Do it so from 2 to N, numbers left are prime numbers. */