verify/aoj_itp1/aoj_itp1_3_d.test.cpp

View this file on GitHub
Last update: 2024-05-28 13:48:58+09:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_D

Depends on

math/divisor.hpp

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_D"

#include <bits/stdc++.h>

#include "math/divisor.hpp"

int main() {
    long long a, b, c;
    std::cin >> a >> b >> c;
    auto dv = divisor(c);
    int ans = 0;
    for (auto &d : dv) {
        if (a <= d and d <= b) {
            ans++;
        }
    }
    std::cout << ans << '\n';
    return 0;
}

#line 1 "verify/aoj_itp1/aoj_itp1_3_d.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_D"

#include <bits/stdc++.h>

#line 2 "math/divisor.hpp"

template <class T> std::vector<T> divisor(const T n) {
    std::vector<T> res;
    for (T i = T(1); i * i <= n; i++) {
        if (n % i == 0) {
            res.push_back(i);
            if (i * i != n) res.push_back(n / i);
        }
    }
    std::sort(res.begin(), res.end());
    return res;
}
#line 6 "verify/aoj_itp1/aoj_itp1_3_d.test.cpp"

int main() {
    long long a, b, c;
    std::cin >> a >> b >> c;
    auto dv = divisor(c);
    int ans = 0;
    for (auto &d : dv) {
        if (a <= d and d <= b) {
            ans++;
        }
    }
    std::cout << ans << '\n';
    return 0;
}