#include #include #include namespace utils { std::vector getFactors ( const int& ); // high to low std::vector> factorize ( const int& ); // in primes, low to high std::vector filterToPrime ( const std::vector& ); bool isPrime( const int& ); } std::vector utils::getFactors( const int& input ) { std::vector output( 1 , input ); for ( int i = input / 2 ; i > 1 ; --i ) // error spotted if ( 0 == input % i ) output.push_back( i ); return output; } std::vector> utils::factorize( const int& input ) { std::vector> output ; std::vector temp = utils::filterToPrime( utils::getFactors( input ) ); std::vector::reverse_iterator rit = temp.rbegin(); bool isNew = true; for ( int i = input ; i > 1 || rit != temp.rend() ; ){ if ( 0 == i % *rit ){ i /= *rit; if ( true == isNew ){ isNew = false ; output.push_back( std::make_pair( *rit , 1 ) ); } else{ output.back().second++; } } else{ ++rit; isNew = true; } } return output; } std::vector utils::filterToPrime( const std::vector& input ) { std::vector output; for ( size_t it = 0 ; it < input.size() ; ++it ) if ( utils::isPrime( input[ it ] ) ) output.push_back( input[ it ] ); return output; } bool utils::isPrime( const int& input ) // 0 return true { for ( int i = input / 2 ; i > 1 ; --i ) if ( 0 == input % i ) return false; return true; } int main() { int num = 120000; std::cin>> num; std::cout<<"Enter an integer: "<> fnum = utils::factorize( num ); std::cout<<"\nFactorizatin is: "; for ( size_t it = 0;it < fnum.size();++it){ std::cout<< fnum[it].first<<"^"<

FACTORIZATOR