約数列挙
(math/divisor.hpp)

• View this file on GitHub
• Last update: 2021-04-15 20:33:39+09:00
• Include: #include "math/divisor.hpp"

Required by

• test/aoj/notest.1562.cpp

Code

// @title 約数列挙
#include <algorithm>
#include <vector>

using ll = long long;

std::vector<ll> divisor(ll n) { 
  std::vector<ll> ret;
  for (ll i = 1; (ll)i*i <= n; ++i) { 
    if (n % i == 0) {
      ret.push_back(i);
      if (i*i != n) { ret.push_back(n/i); }
    }
  }
  std::sort(ret.begin(), ret.end());
  return ret;
};

#line 1 "math/divisor.hpp"
// @title 約数列挙
#include <algorithm>
#include <vector>

using ll = long long;

std::vector<ll> divisor(ll n) { 
  std::vector<ll> ret;
  for (ll i = 1; (ll)i*i <= n; ++i) { 
    if (n % i == 0) {
      ret.push_back(i);
      if (i*i != n) { ret.push_back(n/i); }
    }
  }
  std::sort(ret.begin(), ret.end());
  return ret;
};

Back to top page