Representing naturals by sequence of prime factors

gistfile1.cpp

#include <vector>

typedef int num_t;

std::vector<num_t> *get_prime_factors(num_t num)
{
	std::vector<num_t> *list = new std::vector<num_t>();
	
	num_t start_num = num;
	
	for (num_t i = 2; i <= num; i ++)
	{
		while (num % i == 0)
		{
			list->push_back(i);
			num /= i;
		}
	}
	
	return list;
}