#902901 (C++17) No.2417 Div Count

提出ソース

結果

問題	No.2417 Div Count
ユーザー	Etis
提出日時	2023-08-12 15:09:28
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	11,935 bytes
コンパイル時間	7,096 ms
コンパイル使用メモリ	320,220 KB
実行使用メモリ	10,496 KB
最終ジャッジ日時	2024-11-19 23:50:32
合計ジャッジ時間	44,465 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 10,496 KB
testcase_01	AC	2 ms 8,320 KB
testcase_02	WA	-
testcase_03	AC	2 ms 10,020 KB
testcase_04	AC	2 ms 10,020 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	2 ms 10,496 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	2 ms 5,248 KB
testcase_24	WA	-
testcase_25	WA	-
testcase_26	AC	2 ms 5,248 KB
testcase_27	WA	-
testcase_28	WA	-
testcase_29	TLE	-
testcase_30	TLE	-
testcase_31	WA	-
testcase_32	TLE	-
testcase_33	TLE	-
testcase_34	TLE	-
testcase_35	TLE	-
testcase_36	TLE	-
testcase_37	TLE	-
testcase_38	TLE	-
testcase_39	TLE	-
testcase_40	TLE	-
testcase_41	TLE	-
testcase_42	AC	2 ms 10,016 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

//line 1 "main.cpp"
#if !__INCLUDE_LEVEL__
#include __FILE__

int main() {

    cincout::Etising();
    
    ll N, K;
    cin >> N >> K;

    set<ll> ss;
    for(int i = 1; i * i <= N; i++) {
        if((N - K) % i == 0) {
            ss.insert((N - K) / i);
        }
        if(N % i == K) {
            ss.insert(i);
            if(!ss.count(N / i)) {
                ss.insert(N / i);
            }
        }
    }

    /*vector<ll> cnt;
    vfor(x, ss) cnt.eb(x);
    Sort(cnt);
    rep(i, cnt.size()) {
        rep(j, i + 1, cnt.size()) {
            ss.insert(cnt[i] * cnt[j]);
        }
    }*/

    debug(ss);

    printl(ss.size());
}
#else
//line 1 "/home/etis/cpp-library/src/template.hpp"
#pragma GCC target("avx")
//#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

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

//local debug
#ifdef LOCAL
#include <debug_print.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif

//AtCoder Library
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using mint = atcoder::modint998244353;
using Mint = atcoder::modint1000000007;
#endif

//alias
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

//constants
constexpr const long long MOD = 998244353;
constexpr const long long MODM = 1000000007;
constexpr const int INF = 1e9;
constexpr const ll LINF = 1e18;
constexpr const ld PI = 3.1415926535;

//rep(for-loop) macro
#define overload4(a, b, c, d, e, ...) e
#define rep2(i, n) for(ll i = 0; i < n; i++)
#define rep3(i, k, n) for(ll i = k; i < n; i++)
#define rep4(i, k, n, a) for(ll i = k; i < n; i += a)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2)(__VA_ARGS__)
#define rep1_2(i, n) for(ll i = 1; i <= n; i++)
#define rep1_3(i, k, n) for(ll i = k; i <= n; i++)
#define rep1_4(i, k, n, a) for(ll i = k; i <= n; i += a)
#define rep1(...) overload4(__VA_ARGS__, rep1_4, rep1_3, rep1_2)(__VA_ARGS__)
#define Rep2(i, n) for(ll i = n - 1; i >= 0; i--)
#define Rep3(i, k, n) for(ll i = n - 1; i >= k; i--)
#define Rep4(i, k, n, a) for(ll i = n - 1; i >= k; i -= a) 
#define Rep(...) overload4(__VA_ARGS__, Rep4, Rep3, Rep2)(__VA_ARGS__)
#define Rep1_2(i, n) for(ll i = n; i >= 1; i--)
#define Rep1_3(i, k, n) for(ll i = n; i >= k; i--)
#define Rep1_4(i, k, n, a) for(ll i = n; i >= k; i -= a) 
#define Rep1(...) overload4(__VA_ARGS__, Rep1_4, Rep1_3, Rep1_2)(__VA_ARGS__)
#define vfor(x, v) for(auto x : v)
#define mfor(map) for(auto &[key, value] : map)

//vector macro
#define vvecc(T, name, n, m) vector<vector<T>> name(n, vector<T>(m))
#define vvec(T, name, n) vector<vector<T>> name(n)
#define vvecs(T, name, n, m, s) vector<vector<T>> name(n, vector<T>(m, s))
#define vvvecc(T, name, n, m, h) vector<vector<vector<T>>> name(n, vector<vector<T>>(m, vector<T>(h)))
#define vvvecs(T, name, n, m, h, s) vector<vector<vector<T>>> name(n, vector<vector<T>>(m, vector<T>(h, s)))
#define LB(v, x) distance((v).begin(), lower_bound(all(v), (x)))
#define UB(v, x) distance((v).begin(), upper_bound(all(v), (x)))
#define MIN(v) *min_element(all(v))
#define MINI(v) distance(v.begin(), min_element(all(v)))
#define MAX(v) *max_element(all(v))
#define MAXI(v) distance(v.begin(), max_element(all(v)))
#define Sort(v) sort(all(v))
#define Rev(v) reverse(all(v))
template<class T> inline ll vsum(const vector<T> &v) {ll sum = 0; for(T x : v) sum += x; return sum;}

//iterator macro
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define rng(v, l, r) begin(v) + (l), begin(a) + (r)

//data structure macro
#define ef emplace_front
#define eb emplace_back
#define pf pop_front
#define pb pop_back
#define mp make_pair
#define fi first
#define se second
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
template<class T> using pq = priority_queue<T>;
template<class T> using pqmin = priority_queue<T, vector<T>, greater<T>>;
template<class T, class U> using pqp = priority_queue<pair<T, U>>;
template<class T, class U> using pqpmin = priority_queue<pair<T, U>, vector<pair<T, U>>, greater<pair<T,U>>>;

//output
#define pl() cout << '\n'
#define ifl(i, k) " \n"[i == k]
template<class T> inline void print(const T& a) {cout << a;}
inline void printl() {}
template<class T> inline void printl(const T& t) {print(t); pl();}
template<class T> inline void printf(const T& t) {print(t); pl(); cout << flush;}
template<class Head, class... Tail> inline void printl(const Head& head, const Tail&... tail) {print(head); cout << " "; printl(tail...);}
template<class Head, class... Tail> inline void printf(const Head& head, const Tail&... tail) {print(head); cout << " "; printl(tail...); cout << flush;}
template<class T> inline void printl(const vector<T>& v) {if(v.size() == 0) return; print(v[0]); for(auto i = v.begin(); ++i != v.end();) {cout << " "; print(*i);}}
template<class T> inline void printl1(const vector<T>& v) {if(v.size() <= 1) return; print(v[1]); for(auto i = v.begin() + 1; ++i != v.end();) {cout << " "; print(*i);}}
template<class T> inline void prints(const T& a) {cout << a << " ";}
template<class T> inline void fin(const T& t) {printl(t); exit(0);}
inline void Yes(bool a) {cout << (a ? "Yes" : "No") << '\n';}
template<class T, class U> inline void Out2(bool a, T yes, U no) {if(a) printl(yes); else printl(no);}

//functions
inline int ctoi(char c) {return c - '0';}
inline char to_char(int x) {return x + '0';}
inline bool bw(ll a, ll x, ll b) {return (a < x && x < b);}
inline bool bwe(ll a, ll x, ll b) {return (a <= x && x <= b);}
template<class... T> inline constexpr auto Emin(T... a) {return min(initializer_list<common_type_t<T...>>{a...});}
template<class... T> inline constexpr auto Emax(T... a) {return max(initializer_list<common_type_t<T...>>{a...});}
template<class T, class U> inline bool chmax(T &a, const U &b) {if (a < b) { a = b; return true;} return false;}
template<class T, class U> inline bool chmin(T &a, const U &b) {if (a > b) { a = b; return true;} return false;}
template<class T, class U> inline ll Epow(T x, U y) {ll ans = 1; for(int i = 0; i < y; i++) ans *= x; return ans;}
template<class T, class U> inline ll Eceil(T x, U y) {return (ll)ceil((ld)x / (ld)y);}
template<class T, class U> inline ll Efloor(T x, U y) {return (ll)floor((ld)x / (ld)y);}
template<class T, class U> inline bool check_bit(T tar, U bit) {return ((tar & Epow(2, bit)) != 0);}
template<class T> inline bool overflow_if_add(T a, T b) {return (std::numeric_limits<T>::max() - a) < b;}
template<class T> inline bool overflow_if_mul(T a, T b) {return (std::numeric_limits<T>::max() / a) < b;}

//pair-sort
template<class T, class U> inline bool pud(pair<T, U>& left, pair<T, U>& right) {
    if (left.first == right.first) return right.second < left.second;
    else return left.first  < right.first;
}
template<class T, class U> inline bool pdu(pair<T, U>& left, pair<T, U>& right) {
    if (left.first == right.first) return left.second < right.second;
    else return right.first < left.first;
}

namespace cincout {
    void Etising() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
}

struct exec_time {
    private:
        std::chrono::system_clock::time_point start, end;
    public:
        exec_time() : start(std::chrono::system_clock::now()) {}
        ll get_time() {
            end = std::chrono::system_clock::now();
            ll ret = (ll)std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
            return ret;
        }
};

void cordp(vector<ll> &A) {
    vector<ll> sorted;
    map<ll, vector<int>> idx;
    rep(i, A.size()) {
        sorted.eb(A[i]);
        idx[A[i]].eb(i);
    }
    Sort(sorted);
    sorted.erase(unique(all(sorted)), sorted.end());
    rep(i, sorted.size()) vfor(x, idx[sorted[i]]) A[x] = i;
}
//line 2 "/home/etis/cpp-library/src/math.hpp"
using namespace std;

long long pow_mod(long long x, long long n, long long mod = 1e18) {
    long long ret = 1;
    while(n > 0) {
        if(n & 1) ret = (ret * x) % mod;
        x = (x * x) % mod;
        n >>= 1;
    }
    return ret;
}

//a ÷ bをmodで割った余り(modは素数) - O(log(mod))
long long div_mod(long long a, long long b, long long mod = 1e18) {return (a * pow_mod(b, mod - 2, mod)) % mod;}

//階乗 - O(n)
long long factorial(long long n, long long mod = 1e18) {
    long long ans = 1;
    for(long long i = n; i >= 2; i--) ans = (ans * i) % mod;
    return ans;
}

//順列 - O(r)
long long permutation(long long n, long long r, long long mod = 1e18) {
    long long ans = 1;
    for(long long i = 0; i < r; i++) ans = (ans * (n - i)) % mod;
    return ans;
}

//組み合わせ(modは素数) - O(min(r, n - r) + log(mod))
long long combination(long long n, long long r, long long mod = 1e18) {
    r = min(r, n - r);
    if(r == 0) return 1;
    long long up = n;
    long long down = 1;
    for(int i = 1; i < r; i++) {
        up = (up * (n - i)) % mod;
        down = (down * (i + 1)) % mod;
    }
    return div_mod(up, down, mod);
}

//nC0~nCrまでの列挙(modは素数) - O(rlog(mod))
vector<long long> getCombination_vec(long long n, long long r, long long mod = 1e18) {
    vector<long long> ret(r + 1);
    ret[0] = 1;
    long long up = n;
    long long down = 1;
    ret[1] = div_mod(up, down, mod);
    for(int i = 1; i < r; i++) {
        up = (up * (n - i)) % mod;
        down = (down * (i + 1)) % mod;
        ret[i + 1] = div_mod(up, down, mod);
    }
    return ret;
}

//素数判定 - O(√N)
bool is_prime(long long N) {
    if (N == 1) return false;
    for (long long i = 2; i * i <= N; i++) {
        if (N % i == 0) return false;
    }
    return true;
}

//約数列挙 - O(√N)
vector<long long> enum_divisors(long long N) {
    vector<long long> res;
    for (long long i = 1; i * i <= N; i++) {
        if (N % i == 0) {
            res.emplace_back(i);
            if (N / i != i) res.emplace_back(N / i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

//素因数分解 - O(√N)
vector<pair<long long, long long>> prime_factorize(long long N) {
    vector<pair<long long, long long>> res;
    for (long long a = 2; a * a <= N; a++) {
        if (N % a != 0) continue;
        long long ex = 0;
        while (N % a == 0) {
            ex++;
            N /= a;
        }
        res.emplace_back(make_pair(a, ex));
    }
    if (N != 1) res.emplace_back(make_pair(N, 1));
    return res;
}

//エラトステネスの篩 - O(NloglogN)
vector<bool> Eratosthenes(long long N) {
    vector<bool> isprime(N + 1, true);
    isprime[0] = isprime[1] = false;
    for (long long p = 2; p <= N; p++) {
        if (!isprime[p]) continue;
        for (long long q = p * 2; q <= N; q += p) {
            isprime[q] = false;
        }
    }
    return isprime;
}

//N以下の素数を列挙 - O(NloglogN)
vector<long long> getPrimes(long long N) {
    vector<bool> era = Eratosthenes(N);
    vector<long long> primes;
    for(long long i = 2; i <= N; i++) {
        if(era[i]) primes.emplace_back(i);
    }
    return primes;
}

//ユークリッド距離
long double calc_dist(long long x1, long long y1, long long x2, long long y2) {return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2));}
long double calc_dist(pair<long long, long long> p1, pair<long long, long long> p2) {return sqrt(pow(p2.first - p1.first, 2) + pow(p2.second - p1.second, 2));}

//ユークリッド距離の2乗
long long calc_dist2(long long x1, long long y1, long long x2, long long y2) {return pow(x2 - x1, 2) + pow(y2 - y1, 2);}
long long calc_dist2(pair<long long, long long> p1, pair<long long, long long> p2) {return pow(p2.first - p1.first, 2) + pow(p2.second - p1.second, 2);}
//line 40 "main.cpp"
#endif

yukicoder

結果

テストケース

ソースコード