题库练习 Vasya and Polynomial
← 上一题 下一题 →

A9715 | Vasya and Polynomial

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Vasya is studying in the last class of school and soon he will take exams. He decided to study polynomials. Polynomial is a function $P(x)=a_{0}+a_{1}x^{1}+...+a_{n}x^{n}$ . Numbers $a_{i}$ are called coefficients of a polynomial, non-negative integer $n$ is called a degree of a polynomial.

Vasya has made a bet with his friends that he can solve any problem with polynomials. They suggested him the problem: "Determine how many polynomials $P(x)$ exist with integer non-negative coefficients so that ![](/uploads/luogu/CF493E/7b06cb2e25bf991e4ece3c009304fa0e5ea4f3b3_71f6d8b860f7.png), and ![](/uploads/luogu/CF493E/dde9c7b515169e25ed5a1052cd7c5bcde9412e7c_501871f9f6c6.png), where ![](/uploads/acgo/image/939be83eb01e9846_a7d04befb153.jpeg) and $b$ are given positive integers"?

Vasya does not like losing bets, but he has no idea how to solve this task, so please help him to solve the problem.

输入格式

The input contains three integer positive numbers ![](/uploads/acgo/image/d3d266ab6434402a_0ca2d9cc9fcc.jpeg) no greater than $10^{18}$ .

输出格式

If there is an infinite number of such polynomials, then print "inf" without quotes, otherwise print the reminder of an answer modulo $10^{9}+7$ .

输入输出样例

输入 #1
2 2 2
输出 #1
2
输入 #2
2 3 3
输出 #2
1
C++ 编辑器
输入
输出