src/math/prime_factor.hpp

• View this file on GitHub
• Last update: 2022-12-18 20:53:53+09:00
• Include: #include "src/math/prime_factor.hpp"

Required by

• src/math/euler_phi.hpp

Verified with

• test/aoj/ntl_1_a.test.cpp
• test/aoj/ntl_1_d.test.cpp

Code

#pragma once

#include <bits/stdc++.h>
using namespace std;

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

#line 2 "src/math/prime_factor.hpp"

#include <bits/stdc++.h>
using namespace std;

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

Back to top page