test/verify/aoj-itp1-3-d.test.cpp

• View this file on GitHub
• Last update: 2026-08-10 10:54:28+00:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_D

Depends on

• Divisor (約数列挙) (math/number-theory/divisor.hpp)

Code

// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_D
// clang-format on

#include <iostream>

#include "../../math/number-theory/divisor.hpp"

using namespace std;

int main() {
  int A, B, C;
  cin >> A >> B >> C;
  int ret = 0;
  for (auto& p : divisor(C)) {
    ret += A <= p and p <= B;
  }
  cout << ret << "\n";
}

#line 1 "test/verify/aoj-itp1-3-d.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_D
// clang-format on

#include <iostream>

#line 2 "math/number-theory/divisor.hpp"

#include <algorithm>
#include <cstdint>
#include <vector>

std::vector<std::int64_t> divisor(std::int64_t n) {
  std::vector<std::int64_t> ret;
  for (std::int64_t i = 1; 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 8 "test/verify/aoj-itp1-3-d.test.cpp"

using namespace std;

int main() {
  int A, B, C;
  cin >> A >> B >> C;
  int ret = 0;
  for (auto& p : divisor(C)) {
    ret += A <= p and p <= B;
  }
  cout << ret << "\n";
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00	AC	3 ms	4 MB
g++	01_corner_00	AC	2 ms	4 MB
g++	01_corner_01	AC	2 ms	4 MB
g++	01_corner_02	AC	2 ms	4 MB
g++	01_corner_03	AC	2 ms	3 MB
g++	01_corner_04	AC	2 ms	4 MB
g++	01_corner_05	AC	2 ms	4 MB
g++	01_corner_06	AC	2 ms	4 MB
g++	02_rand_00	AC	2 ms	3 MB
g++	02_rand_01	AC	2 ms	4 MB
g++	02_rand_02	AC	2 ms	3 MB
g++	02_rand_03	AC	2 ms	3 MB
g++	02_rand_04	AC	2 ms	3 MB
g++	02_rand_05	AC	2 ms	4 MB
g++	02_rand_06	AC	2 ms	4 MB
g++	02_rand_07	AC	2 ms	3 MB
g++	03_maximum_00	AC	2 ms	3 MB
g++	03_maximum_01	AC	2 ms	4 MB
g++	03_maximum_02	AC	2 ms	4 MB
g++	03_maximum_03	AC	2 ms	3 MB
clang++	00_sample_00	AC	3 ms	4 MB
clang++	01_corner_00	AC	2 ms	4 MB
clang++	01_corner_01	AC	2 ms	4 MB
clang++	01_corner_02	AC	2 ms	4 MB
clang++	01_corner_03	AC	2 ms	4 MB
clang++	01_corner_04	AC	2 ms	4 MB
clang++	01_corner_05	AC	2 ms	4 MB
clang++	01_corner_06	AC	2 ms	4 MB
clang++	02_rand_00	AC	2 ms	4 MB
clang++	02_rand_01	AC	2 ms	4 MB
clang++	02_rand_02	AC	2 ms	4 MB
clang++	02_rand_03	AC	2 ms	4 MB
clang++	02_rand_04	AC	2 ms	4 MB
clang++	02_rand_05	AC	2 ms	4 MB
clang++	02_rand_06	AC	2 ms	4 MB
clang++	02_rand_07	AC	2 ms	4 MB
clang++	03_maximum_00	AC	2 ms	4 MB
clang++	03_maximum_01	AC	2 ms	4 MB
clang++	03_maximum_02	AC	2 ms	4 MB
clang++	03_maximum_03	AC	2 ms	4 MB

Back to top page