Getting Started with C programming-cycle (bottom)

All primes 1 to 1000 are calculated as follows:

# include <stdio.h>bool isprime (int val)  //Determine if Val is a prime number {int i;for (i=2; i<val; i++) {if (val%i = = 0) break;} if (i = = val) return True;elsereturn false;} The value of int main (void) {int val;for (val=2; val<=1000; val++) {if (IsPrime (val))//isprime function is Boolean, which is true or false. printf ("%d\n", Val);} return 0;}

1 to 1000 all primes (Method 2):

# include <stdio.h>int main (void) {int i;printf ("2\n3\n5\n7\n"); for (i=2;i<=1000;++i) {if (i%2!=0 && i% 3!=0 && i%5!=0 && i%7!=0)//The number that cannot be divisible by 2, 3, 5, 7 is prime. printf ("%d\n", I);} return 0;}

Example 3:

# include <stdio.h>int main (void) {int val;int i;for (val=1; val<=1000; val++) {for (i=2; i<val; i++) {if (val%i = = 0)//val to I take the remainder break;} if (i = = val) printf ("%d\n", I);} return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Getting Started with C programming-cycle (bottom)