edaBit-coding-challenges/primefactorCheck/main.cpp

#include <QCoreApplication>
std::vector<int> factors(int n);
int main(int argc, char *argv[])
{
    QCoreApplication a(argc, argv);
    std::vector<int> something = factors(12);
    return a.exec();
}
std::vector<int> factors(int n){
    int z = 2;
        std::vector<int> output;
    while (z * z <= n){
        if (n % z == 0){
            output.push_back(z);
            n /= z;
                }else{z++;}
        }
    if(n > 1){output.push_back(n);}
    return output;
}