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 , and , where  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.
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 , and , where  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  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++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted