CF493E.Vasya and Polynomial

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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)=a0+a1x1+...+anxnP(x)=a_{0}+a_{1}x^{1}+...+a_{n}x^{n} . Numbers aia_{i} are called coefficients of a polynomial, non-negative integer nn 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)P(x) exist with integer non-negative coefficients so that , and , where and bb 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 101810^{18} .

输出格式

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

输入输出样例

  • 输入#1

    2 2 2
    

    输出#1

    2
    
  • 输入#2

    2 3 3
    

    输出#2

    1
    
首页