IHYPRESS PROGRAMMING
Tutorials and C programs with code and output for beginners
c programming
HOME | ASP | C | CSS | GNUPLOT | HTML | JAVASCRIPT | PERL | PHP | PYTHON | RUBY | SVG
CSimple Functions : List of Prime Numbers
<05.07>
/* Problem: Write a program that prints out all the prime numbers between 1 and a set limit (1000 in this example). */ #include <stdio.h> #include <math.h> #define LIMIT 1000 /* function returns true if n is even. */ /* it returns false if n is odd */ int even (int n) { return (!(n%2)); } /* function returns true if n is prime */ int prime3 (int n) { int divisor, i; /* looking for a divisor. if found, it is not a prime number */ divisor = 0; /* eliminating even numbers except 2 */ if (even (n)) { if (n==2) divisor=0; else divisor=1; } else { if (n==1) divisor=0; /* 1 is a prime number */ else /* trying to divide number by 3,5,7,... */ /* to find a divisor until sqrt(n) */ for (i=3; i<=sqrt(n); i=i+2) { if (!(n%i)) divisor=i; } } /* if there is a divisor then NOT prime */ return (!divisor); } /* This main program prints all prime numbers between 1 and the set limit */ int main (void) { int x; for (x=1; x<=LIMIT; ++x) if (prime3 (x)) printf (" %d ", x); return (0); }
Hergestellt in Deutschland / Made in Germany
1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997
COPYRIGHT © 2015-2024 IHY PRESS Frankfurt am Main 60329 Deutschland