//Created By Termianl_Phantom // /** This code contains functionality to find the prime factors of any number. It is extracted from a Code Project of mine, Which does Maths of Expression Evaluation and Equation solving. Created By Terminal_Phantom **/ #include #include #include #include using namespace std; //Checks divisibility of "num" by "by_num" bool is_divisible(unsigned int num, unsigned int by_num) { if(num % by_num) return false; else return true; } //Generates a range of numbers // unsigned int range(unsigned int *first_num, unsigned int last_num, unsigned int increment) { unsigned int num = *first_num; *first_num += increment; if (num < last_num) return num; else return 0; } // Checks if number is a prime number unsigned int is_prime(unsigned int number) { unsigned int square_root = ((unsigned int)sqrt(number)) + 1; unsigned int count = 2; while(count < square_root){ if (!(number%count)) return 0; count++; } return 1; } //Prime generator // struct Prime { private: unsigned int prime_from; public: Prime(unsigned int number){prime_from = number;} Prime(){prime_from = 2;} unsigned int generate_prime() { //static unsigned int from = 2; static unsigned int check_num; if(prime_from == 2) { prime_from = 3; return 2; } while((check_num = range(&prime_from, UINT_MAX, 2))) { if(is_prime(check_num)) return (unsigned int)check_num; } return 1; } void set_prime_from(unsigned int number) { if(number == 2) prime_from = 2; else if(!(number % 2)) prime_from = number + 1; else prime_from = number; } unsigned int get_prime_from(void){return prime_from;} }; struct EachFactor { unsigned int number; unsigned int power; }; //Prime factorization function // EachFactor* prime_factorize(unsigned int number) { Prime p{}; unsigned int factors_size = 10; unsigned int each_prime; EachFactor each_factor{}; EachFactor* factors = (EachFactor*)calloc(factors_size + 1, sizeof(EachFactor)); int num_of_factors = 0; while(number > 1) { each_prime = p.generate_prime(); each_factor = {each_prime, 0}; while(is_divisible(number, each_prime)) { number /= each_prime; each_factor.power++; } if(each_factor.power > 0) { factors[num_of_factors] = each_factor; num_of_factors++; if(is_divisible(num_of_factors, factors_size)) factors = (EachFactor *)realloc((void *)factors, num_of_factors + sizeof(EachFactor) * (factors_size+1)); } } return factors; } //User friendly output for testing // void dump_factors(unsigned int number) { EachFactor* factors; factors = prime_factorize(number); cout << "Prime factorization of " << number << ":\n\n=>\t"; EachFactor i; unsigned int each=0; i = factors[each]; while(i.number != 0){ for(unsigned int x=0;x

Prime_Factorization_of_any_number_in_cpp