Advertisement
Jeroonk

primes

Feb 11th, 2012
200
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.92 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int Prime(int);
  5. int main()
  6. {
  7.     cout << "Prime numbers from 1 to 10000 are: " << endl;
  8.  
  9.     int number;
  10.     for(number = 1; number <= 100000; number++)
  11.     {
  12.         // Only print out the prime numbers
  13.         if(Prime(number) == number)
  14.             cout << number << " is prime!" << endl;
  15.     }
  16.  
  17.     // Replaced system("pause"), why invoke another (Windows-only) program
  18.     //  if you can do it using standard functions perfectly fine?
  19.     cout << endl << "Press <enter> to exit..." << endl;
  20.     cin.get();
  21.  
  22.     return 0;
  23. }
  24.  
  25. int Prime(int number)
  26. {
  27.     for(int i = 2; i <= number / 2; i++)
  28.     {
  29.         if(number % i == 0)
  30.             return i; // Abort, number is divisible by "i", thus not a prime
  31.     }
  32.  
  33.     // Only return "number" when the entire for-loop completes
  34.     // This means the number wasn't divisible by any number "i", hence prime
  35.     return number;
  36. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement