math/prime_factor.hpp

• View this file on GitHub
• Last update: 2024-04-20 20:43:01+09:00
• Include: #include "math/prime_factor.hpp"

Verified with

• test/prime_factor.test.cpp

Code

#include <map>
using namespace std;

map<long long, int> prime_factor(long long n) {
    map<long long, int> ret;
    for (long long i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            ret[i]++;
            n /= i;
        }
    }
    if (n != 1) ret[n] = 1;
    return ret;
}

#line 1 "math/prime_factor.hpp"
#include <map>
using namespace std;

map<long long, int> prime_factor(long long n) {
    map<long long, int> ret;
    for (long long i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            ret[i]++;
            n /= i;
        }
    }
    if (n != 1) ret[n] = 1;
    return ret;
}

Back to top page