verify/aizu_online_judge/itp1/how_many_divisors.test.cpp

View this file on GitHub
Last update: 2024-11-09 02:03:28+09:00
Problem: https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/3/ITP1_3_D

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/3/ITP1_3_D"
#include "../../../src/template/template.hpp"
#include "../../../src/math/divisor.hpp"
int main(void) {
    int a, b, c;
    cin >> a >> b >> c;
    vector<ll> d = divisor(c);
    int ans = 0;
    for(int i = 0; i < (int)d.size(); i++) {
        if(a <= d[i] and d[i] <= b) {
            ans++;
        }
    }
    cout << ans << '\n';
}

#line 1 "verify/aizu_online_judge/itp1/how_many_divisors.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/3/ITP1_3_D"
#line 2 "src/template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
#define rep(i, a, b) for(long long i = (a); i < (b); ++i)
#define rrep(i, a, b) for(long long i = (a); i >= (b); --i)
constexpr long long inf = 4e18;
struct SetupIO {
    SetupIO() {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout << fixed << setprecision(30);
    }
} setup_io;
#line 3 "src/math/divisor.hpp"
vector<long long> divisor(const long long n) {
    assert(n >= 1);
    vector<long long> res;
    for(long long i = 1; i * i <= n; ++i) {
        if(n % i == 0) {
            res.push_back(i);
            if(i * i != n) res.emplace_back(n / i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}
#line 4 "verify/aizu_online_judge/itp1/how_many_divisors.test.cpp"
int main(void) {
    int a, b, c;
    cin >> a >> b >> c;
    vector<ll> d = divisor(c);
    int ans = 0;
    for(int i = 0; i < (int)d.size(); i++) {
        if(a <= d[i] and d[i] <= b) {
            ans++;
        }
    }
    cout << ans << '\n';
}