Problem:
Score : 400 points

Problem Statement

Given are positive integers A and B.

Let us choose some number of positive common divisors of A and B.

Here, any two of the chosen divisors must be coprime.

At most, how many divisors can we choose?

Definition of common divisor

An integer d is said to be a common divisor of integers x and y when d divides both x and y.

Definition of being coprime

Integers x and y are said to be coprime when x and y have no positive common divisors other than 1.

Definition of dividing

An integer x is said to divide another integer y when there exists an integer \alpha such that y = \alpha x.

Constraints

All values in input are integers.

1 \leq A, B \leq 10^{12}

Input

Input is given from Standard Input in the following format:

A B

Output

Print the maximum number of divisors that can be chosen to satisfy the condition.

Sample Input 1

12 18

Sample Output 1

3

12 and 18 have the following positive common divisors: 1, 2, 3, and 6.

1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.

Sample Input 2

420 660

Sample Output 2

4

Sample Input 3

1 2019

Sample Output 3

1

1 and 2019 have no positive common divisors other than 1.

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::str::FromStr;
use std::fmt::Debug;
use std::cmp;

#[allow(dead_code)]
fn read_as_vec<T>() -> Vec<T>
where T: FromStr, <T as FromStr>::Err : Debug{
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().split_whitespace().map(|c| T::from_str(c).unwrap()).collect()

}

#[allow(dead_code)]
fn read_as_string() -> String{
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().to_string()
}

fn calc_common_prime_divisors(mut a: u64, mut b: u64) -> Vec<u64>{
    let mut res = vec![1];
    for div in 2..cmp::min((a as f64).sqrt().ceil() as u64, (b as f64).sqrt().ceil() as u64)+1{
        if a%div == 0 && b%div == 0{
            res.push(div);
        }

        while a%div == 0 && b%div == 0{
            a /= div;
            b /= div;
        }
    }

    if *res.last().unwrap() < a && a == b{
        res.push(a);
    }
    return res;
}

fn calc_common_divisors(mut a: u64, mut b: u64) -> Vec<u64>{
    let mut res = vec![1];
    for div in 2..cmp::min((a as f64).sqrt().ceil() as u64, (b as f64).sqrt().ceil() as u64)+1{
        if a%div == 0 && b%div == 0{
            res.push(div);
        }
    }

    return res;
}


fn main(){
    let line = read_as_vec::<u64>();

    let (a, b) = (line[0], line[1]);

    let common_prime_divisor = calc_common_prime_divisors(a, b);
    //println!("{:?}", common_prime_divisor);
    println!("{}", common_prime_divisor.len());

    /*
    println!("--");
    let common_divisor = calc_common_divisors(a, b);
    println!("{:?}", common_divisor);
    */

}