Question

How to find the prime factors of large number in C++

Answer 1

#include <iostream>
  
void printPrimeFactor(unsigned long long int n) {
    int div = 2;
    while (n != 0) {
        if (n % div != 0) {
            div = div + 1;
        }
        else {
            std::cout << div << " ";
            n = n / div;
            if (n == 1) {
                break;
            }
        }
    }
    std::cout << "\n";
}
int main() {
    printPrimeFactor(100000000); 
    printPrimeFactor(700858674091);
    printPrimeFactor(20948717480147);
}

  
    
    
    
/*
run:
    
2 2 2 2 2 2 2 2 5 5 5 5 5 5 5 5 
449 1560932459 
2293 3011 3034189 
    
*/
  

 

70+ SQL courses for beginners and professionals