← 返回题目

题库练习 Unusual Sequences

← 上一题下一题 →

A11374 | $Unusual Sequences$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Count the number of distinct sequences $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}$ ) consisting of positive integers such that $gcd(a_{1},a_{2},...,a_{n})=x$ and ![](/uploads/acgo/image/24869f51f51af6e5_083137ff8122.jpeg). As this number could be large, print the answer modulo $10^{9}+7$ . $gcd$ here means the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor).

输入格式

The only line contains two positive integers $x$ and $y$ ( $1<=x,y<=10^{9}$ ).

输出格式

Print the number of such sequences modulo $10^{9}+7$ .

输入输出样例

输入 #1

3 9

输出 #1

输入 #2

5 8

输出 #2

C++ 编辑器

输入

输出