結果
問題 | No.917 Make One With GCD |
ユーザー |
|
提出日時 | 2019-10-25 23:04:09 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 11 ms / 2,000 ms |
コード長 | 4,017 bytes |
コンパイル時間 | 2,706 ms |
コンパイル使用メモリ | 205,212 KB |
最終ジャッジ日時 | 2025-01-08 01:39:59 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 32 |
ソースコード
#include <bits/stdc++.h>#pragma GCC diagnostic ignored "-Wsign-compare"#pragma GCC diagnostic ignored "-Wsign-conversion"#define NDEBUGusing i32 = int32_t;using i64 = int64_t;using u32 = uint32_t;using u64 = uint64_t;using uint = unsigned int;using usize = std::size_t;using ll = long long;using ull = unsigned long long;using ld = long double;template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }template<typename T> constexpr bool btest(const T mask, const usize ind) { return ((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask)<< (64 - ind)) >> (64 - ind)); }template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }constexpr unsigned int mod = 1000000007;template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};template<typename T>T read(){T v;return std::cin >> v, v;}template<typename T>std::vector<T> read_vec(const std::size_t size){std::vector<T> v(size);for (auto& e : v) { std::cin >> e; }return v;}template<typename... Types>auto read_vals() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }#define SHOW(...) static_cast<void>(0)template<typename T>std::vector<T> make_v(const std::size_t size, T v) { return std::vector<T>(size, v); }template<class... Args>auto make_v(const std::size_t size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }template<typename T>std::vector<T> divisors(const T n){std::vector<T> head, tail;for (T i = 1; i * i <= n; i++) {if (n % i == 0) {head.push_back(i);if (i * i != n) { tail.push_back(n / i); }}}for (auto it = tail.rbegin(); it != tail.rend(); it++) { head.push_back(*it); }return head;}template<typename T>std::vector<std::pair<T, usize>> prime_factors(T n){std::vector<std::pair<T, usize>> ans;for (T i = 2; i * i <= n; i++) {usize cnt = 0;for (; n % i == 0; n /= i, cnt++) {}if (cnt > 0) { ans.push_back({i, cnt}); }}if (n > 1) { ans.push_back({n, 1}); }return ans;}int main(){const auto n = read<usize>();const auto as = read_vec<ll>(n);std::set<ll> ds;for (const ll a : as) {for (const ll d : divisors(a)) { ds.insert(d); }}ll ans = 0;for (const ll d : ds) {usize num = 0;for (const ll a : as) {if (a % d == 0) { num++; }}ll sub = (1LL << num) - 1;const auto fs = prime_factors(d);ll moe = fs.size() % 2 == 0 ? 1 : -1;for (const auto& p : fs) {if (p.second > 1) {moe = 0;break;}}ans += moe * sub;}std::cout << ans << std::endl;return 0;}