QOJ.ac

QOJ

Límite de tiempo: 2 s Límite de memoria: 512 MB Puntuación total: 100

#13464. функция

Estadísticas

Пусть $P(x)$ — количество таких $y$, что $1 < y < x$ и $y^3 \equiv 1 \pmod x$.

Найдите количество натуральных чисел, не превосходящих $n$, для которых $P(x) = m$.

Входные данные

В одной строке заданы два целых числа $n$ и $m$.

Выходные данные

Выведите одно число — ответ на задачу.

Примеры

Пример 1

Ввод

10 0

Вывод

8

Пример 2

Ввод

100000000 242

Вывод

24038

Подзадачи

Для $100\%$ данных: $1 < n \le 2\times 10^{10}$, $0 \le m < n$.

Номер теста $n$ $m$
$1$ $\le 2\times 10^{10}$ $=666$
$2$ $\le 10^3$
$3$ $\le 10^5$
$4$ $\le 10^6$
$5$ $\le 3\times 10^6$
$6$ $\le 5\times 10^6$
$7$ $\le 10^7$
$8$ $\le 10^8$ $\ge 300$
$9$ $\le 5\times 10^8$
$10$ $\le 10^9$
$11$ $\le 5\times 10^9$ $\ge 200$
$12$ $\le 10^{10}$
$13$ $=0$
$14$ $\le 2\times 10^{10}$
$15$ $\le 10^8$
$16$ $\le 5\times 10^8$
$17$ $\le 10^9$
$18$ $\le 5\times 10^9$
$19$ $\le 10^{10}$
$20$ $\le 2\times 10^{10}$

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.