fork download
  1. #include <iostream>
  2. #include <cmath>
  3.  
  4. bool is_prime(unsigned long x)
  5. {
  6. unsigned long n = sqrt(x);
  7. if (x%2 == 0) return false;
  8. for(unsigned long i = 3; i <= n; i+=2)
  9. {
  10. if (x%i == 0)
  11. {
  12. return false;
  13. }
  14. }
  15. return true;
  16. }
  17.  
  18.  
  19. int main()
  20. {
  21. for(int n = sqrt(106000000/2)-1; n < sqrt(107000001/2)+1; n++)
  22. {
  23. if (is_prime(n))
  24. {
  25. int m = n*n*2;
  26. if (m <= 107000001 && m >= 106000000) std::cout << m << "\n";
  27. }
  28. }
  29. }
  30.  
Success #stdin #stdout 0s 5520KB
stdin
Standard input is empty
stdout
106084178
106492418
106784498
106842962