fork download
copy 
  1. results  2  3  4  5  6  7  8  9  10 11 12 13 14 15 16 17 18 19
  2. start    -  -  -  -  -  -  -  -  -  -  -  -  -  -  -  -  -  -
  3. 2prime   -  -  2  -  2  -  2  -  2  -  2  -  2  -  2  -  2  -  2<sqrt(19) so continue
  4. 3prime   -  -  2  -  23 -  2  3  2  -  23 -  2  3  2  -  23 -  3<sqrt(19) so continue
  5. 4skip    -  -  2  -  23 -  2  3  2  -  23 -  2  3  2  -  23 -  4<sqrt(19) so continue
  6. 5prime   -  -  2  -  23 -  2  3  25 -  23 -  2  35 2  -  23 -  5>=sqrt(19) so stop
  7. DASHES IN CORRECT SPOTS
  8. SWITCH TO DIVISION SHORTCUT
  9. 6divide  -  -  2  -  23 -  2  3  25 -  23 -  2  35 2  -  23 -  6/2 and 6/3 are prime, remove dupes
  10. 7divide  -  -  2  -  23 -  2  3  25 -  23 -  2  35 2  -  23 -  7 is empty
  11. 8divide  -  -  2  -  23 -  2  3  25 -  23 -  2  35 2  -  23 -  8/2 not prime
  12. ETC
  13. 14divide -  -  2  -  23 -  2  3  25 -  23 -  27 35 2  -  23 -  14/2 is prime, remove dupes
  14. ETC
  15. 19divide -  -  2  -  23 -  2  3  25 -  23 -  27 35 2  -  23 -  19 is empty
  16. NOW ALL PRIME FACTORS ARE RIGHT
  17.  
  18. In the division step:
  19. If the current value is V.
  20. For each known prime P:
  21.     If the primes of V/P is empty and V/P is not in V, add V/P to V.
  22.     For each prime K in V/P:
  23.         If K is not in V, add V to V.
Not running #stdin #stdout 0s 0KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/nR5uj2
language:
C++14 (gcc 8.3)
created:
11 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!