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
sahilsinghss:
20190318 17:47:12
WTH How can using cout instead of printf cost a WA Last edit: 20190318 17:47:35 

midoriya:
20190315 12:01:22
I don't what to do anymore  should I use cin, cout or scanf ,printf


harry_shit:
20190212 10:59:06
this was wayy more easy than i thought,


raghav6:
20190111 13:00:54
Just use scanf and printf for I/O , avoid cin & cout in C++ costed me TLE. 

duet_cse16:
20181030 08:55:54
What's the application of gcd in this problem?? 

saketag007:
20181014 17:50:59
AC in 3rd go , just use fast input/output , no need to build sieve , just find factors for every test case in O(sqrt(n)) Last edit: 20181014 17:51:15 

jyotiradityafc:
20180828 22:04:28
Spoiler Alert!


puneetgargmnc:
20180817 11:11:34
use Fast I/O using better mathematical logic , no need to use scanf printf.. 

srjsunny:
20180220 20:36:06
use scanf and printf , no need to use seive 

viniet_sw:
20180102 15:14:00
bhosadi waalo ac in one go ka kya show off krte rehte ho gand utha ke har jagah 
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 