<pre class="html" name="code"><pre class="cpp" name="code">//Compute and print all the prime numbers from 1 to 100
#include <stdio.h>
int main(void)
{
int number;
int divisor;
//print one two
printf("1 2 ");
// No other even numbers are prime;look at the remaining odd ones.
for( number = 3; number <= 100; number = number + 2 ){
//See if any divisor from 3 up to the number evenly divides the number
for( divisor = 3; divisor < number; divisor = divisor + 2){
if( number % divisor == 0 )
break;
}
//If the loop above stopped because the divisor got too big, we've got a prime
if( divisor >= number )
printf("%d ",number);
}
return 0;
}