CF 282B Modular Equations

最新推荐文章于 2022-03-18 21:52:58 发布

Liao_Jingyi

最新推荐文章于 2022-03-18 21:52:58 发布

阅读量478

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/Liao_Jingyi/article/details/42745711

版权

数学专栏收录该内容

22 篇文章 0 订阅

订阅专栏

Last week, Hamed learned about a new type of equations in his math class called Modular Equations. Lets define i modulo j as the remainder of division of i by j and denote it by $\text{[math]}$ . A Modular Equation, as Hamed's teacher described, is an equation of the form $\text{[math]}$ in which a and b are two non-negative integers and x is a variable. We call a positive integer x for which $\text{[math]}$ a solution of our equation.

Hamed didn't pay much attention to the class since he was watching a movie. He only managed to understand the definitions of these equations.

Now he wants to write his math exercises but since he has no idea how to do that, he asked you for help. He has told you all he knows about Modular Equations and asked you to write a program which given two numbers a and b determines how many answers the Modular Equation $\text{[math]}$ has.

Input

In the only line of the input two space-separated integers a and b (0 ≤ a, b ≤ 10⁹) are given.

Output

If there is an infinite number of answers to our equation, print "infinity" (without the quotes). Otherwise print the number of solutions of the Modular Equation $\text{[math]}$ .

Sample test(s)

Input

21 5

Output

Input

9435152 272

Output

Input

10 10

Output

infinity

Note

In the first sample the answers of the Modular Equation are 8 and 16 since $\text{[math]}$

解析

数学题。相当于找a-b中有多少个因数，然后去掉小于b的因数。i和 a / i 是一对的，所以可以一次枚举这两个对称的数。复杂度就降低到了logn。但是注意当i*i==a时不要重复计数。

在判断a/i是否符合条件时一定不要忘记a/i>b这句话。

#include<cstdio>

using namespace std;

int main()
{
	int a,b; scanf("%d%d",&a,&b);

	if(a<b) printf("0");
	else if(a==b) printf("infinity");
	else
	{
		a-=b;
		int cnt=0;
		for(int i=1;i*i<=a;i++)//i --> x
			if(a%i==0)
			{
				if(i>b) cnt++;
				if(i*i!=a && a/i>b) cnt++;//i and a/i is a pair
			}
		printf("%d",cnt);
	}

	return 0;
}