test/aoj/notest.1562.cpp

View this file on GitHub
Last update: 2021-04-15 20:33:39+09:00
Link: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1562

Depends on

約数列挙 (math/divisor.hpp)

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1562"
#include "../../math/divisor.hpp"


int main() {
  int n; cin >> n;
  for (int i = 1; i <= (1<<n); ++i) {
    vector<ll> divs = divisor(i);
    if (divs.size() == n) {
      cout << i << endl;
      return 0;
    }
  }
}

#line 1 "test/aoj/notest.1562.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1562"
#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;
};
#line 3 "test/aoj/notest.1562.cpp"


int main() {
  int n; cin >> n;
  for (int i = 1; i <= (1<<n); ++i) {
    vector<ll> divs = divisor(i);
    if (divs.size() == n) {
      cout << i << endl;
      return 0;
    }
  }
}