COMDIV  Number of common divisors
You will be given T (T<=10^6) pair of numbers. All you have to tell is the number of common divisors between two numbers in each pair.
Input
First line of input: T (Number of test cases)
In next T lines, each have one pair A B (0 < A, B <= 10^6)
Output
One integer describing number of common divisors between two numbers.
Example
Input: 3
100000 100000
12 24
747794 238336
Output: 36
6
2
hide comments
flipster:
20130723 15:29:46
cake walk:) 

Pranye Mawai:
20130720 09:18:17
enjoyd doin it ... :D 

tamed:
20130713 19:48:56
@ps my id 9651682 why i m not getting output and why i m also getin wrong answer 

Hasil Sharma:
20130617 19:17:43
I don't know why I am getting WA while using C , I have used correct logic int type for all the digits and double for storing sqrt of gcd :/


Anick Saha:
20130525 17:50:02
long long to int , cinto scanf ... then it gets AC :/ 

Shubham Sharma:
20130516 19:01:43
SIGSEGV in my code ..


Eduardo Nunes:
20130416 23:13:03
really nice one, try using gcd ;D


Meraj Ahmed:
20130204 13:45:58
Mir Wasi Ahmed, please check and tell what is wrong with my solution.


Spar!k:
20130202 22:49:42
AC with scanf/printf 

ANKUR GARG:
20130128 12:44:03
can u give some more tricky test cases as these are working fine in my code but m still getting WA 
Added by:  Mir Wasi Ahmed 
Date:  20101031 
Time limit:  0.600s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own problem, used in UODA TST 