No.2798 Multiple Chain
問題文最終更新日: 2024-06-28 21:03:09
English (AI translation)
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence.
Back to the original
yukicoder contest 435
(順位表)
の他の問題:
Problem Statement
You are given an integer $N$ greater than or equal to $2$.
Find the number of sequences of positive integers $(A_1,A_2,\dots ,A_L)\ (L\ge 1)$ of length at least $1$ that satisfy the following conditions.
- $A_1\ge 2$
- For $i=1,2,\dots ,L-1$, $A_{i+1}$ is a multiple of $A_i$.
- $A_1\times A_2\times\dots \times A_L=N$.
Constraints
- All input values are integers.
- $2\le N\le 10^{18}$
Input
$N$
Output
Output the answer.
Sample
Sample 1
Input
4
Output
2
The following $2$ sequences of positive integers satisfy the conditions.
- $(2,2)$
- $(4)$
Sample 2
Input
999999999999999989
Output
1
Sample 3
Input
963761198400
Output
110
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。
noya2