题解报告:hdu 2588 GCD

Posted acgoto

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了题解报告:hdu 2588 GCD相关的知识,希望对你有一定的参考价值。

Description

The greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,(1,2)=1,(12,18)=6. (a,b) can be easily found by the Euclidean algorithm. Now Carp is considering a little more difficult problem: Given integers N and M, how many integer X satisfies 1<=X<=N and (X,N)>=M.

Input

The first line of input is an integer T(T<=100) representing the number of test cases. The following T lines each contains two numbers N and M (2<=N<=1000000000, 1<=M<=N), representing a test case.

Output

For each test case,output the answer on a single line.

Sample Input

3
1 1
10 2
10000 72

Sample Output

1
6
260
解题思路:
AC代码:





以上是关于题解报告:hdu 2588 GCD的主要内容,如果未能解决你的问题,请参考以下文章

HDU 2588 GCD

HDU 2588 GCD Euler + 暴力技巧

hdu2588 gcd 欧拉函数

[HDU2588]GCD 欧拉函数

hdu2588-GCD-(欧拉函数+分解因子)

HDU2588