Advertisement
Guest User

Untitled

a guest
Jun 25th, 2017
59
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.65 KB | None | 0 0
  1. #include "stdafx.h"
  2. #include <cmath>
  3. #include <iostream>
  4.  
  5. long long isPrime(long long num) {
  6.   long long max = (long long) sqrt((long double) num);
  7.   for (long long i = 2; i <= max; i++) {
  8.     if (num % i == 0) return 0;
  9.   }
  10.   return 1;
  11. }
  12.  
  13. long long n3 (long long num) {
  14.   if (isPrime(num)) return num;
  15.   long long max = num / 2;
  16.   for (long long i = 2; i <= max; i++) {
  17.     if (num % i == 0 && isPrime(num / i))
  18.       return num / i;
  19.   }
  20.   return num;
  21. }
  22.  
  23.  
  24.  
  25. int main() {
  26.   long long test = 523456789;
  27.   for (long long i = test; i < test + 100; i++)
  28.     std::cout << i << ": " << n3(i) << std::endl;
  29.   //system("pause");
  30.   return 0;
  31. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement