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.42.0) (judge verdict: Runtime Error)

#![allow(unused_mut)]
#![allow(non_snake_case)]
#![allow(unused_variables)]
#![allow(unused_imports)]
#![allow(unused_macros)]
#![allow(dead_code)]
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($y: expr),+) => {
        cmp::max($x, max!($($y),+))
    };
}

macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($y: expr),+) => {
        cmp::min($x, min!($($y),+))
    };
}

macro_rules! abs {
    ($x:expr, $y:expr) => {
        cmp::max($x, $y) - cmp::min($x, $y)
    };
}

const MOD: usize = 1_000_000_007;

struct BinCoeff {
    size: usize,
    fac: Vec<usize>,
    finv: Vec<usize>,
    inv: Vec<usize>,
}

impl BinCoeff {
    fn new(size: usize) -> BinCoeff {
        let fac = vec![0; size];
        let finv = vec![0; size];
        let inv = vec![0; size];
        let mut bincoeff = BinCoeff {
            size,
            fac: fac,
            finv: finv,
            inv: inv,
        };
        bincoeff.com_init();
        bincoeff
    }

    fn com_init(&mut self) {
        let fac = &mut self.fac;
        let finv = &mut self.finv;
        let inv = &mut self.inv;
        let size = self.size;
        fac[0] = 1;
        fac[1] = 1;
        finv[0] = 1;
        finv[1] = 1;
        inv[1] = 1;
        for i in 2..size {
            fac[i] = fac[i - 1] * i % MOD;
            inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
            finv[i] = finv[i - 1] * inv[i] % MOD;
        }
    }

    fn bin_coeff(&mut self, n: usize, k: usize) -> usize {
        if k > n / 2 {
            self.bin_coeff(n, n - k)
        } else {
            self.fac[n] * (self.finv[k] * self.finv[n - k] % MOD) % MOD
        }
    }
}

struct UnionFind {
    par: Vec<usize>,
}

impl UnionFind {
    fn new(size: usize) -> UnionFind {
        UnionFind {
            par: (0..size).collect::<Vec<usize>>(),
        }
    }

    fn root(&mut self, node: usize) -> usize {
        let parent = self.par[node];
        if parent == node {
            parent
        } else {
            let parent = self.root(parent);
            self.par[node] = parent;
            parent
        }
    }

    fn unite(&mut self, a: usize, b: usize) {
        let root_a = self.root(a);
        let root_b = self.root(b);
        self.par[root_b] = root_a;
    }

    fn is_same(&mut self, a: usize, b: usize) -> bool {
        let root_a = self.root(a);
        let root_b = self.root(b);
        root_a == root_b
    }
}

// must input n <= m
fn gcd(n: usize, m: usize) -> usize {
    if n == 0 {
        m
    } else {
        gcd(m % n, n)
    }
}

fn printer<T, U>(mut array: T)
where
    T: Iterator<Item = U>,
    U: fmt::Display + Copy,
{
    if let Some(a) = array.next() {
        print!("{}", a);
    }
    for a in array {
        print!(" {}", a);
    }
    println!()
}

fn sieve_of_eratosthenes(max: usize) -> Vec<usize> {
    let mut candidates = vec![true; max + 1];
    candidates[0] = false;
    candidates[1] = false;
    let mut num = 2;
    for num in 2..=(max as f64).sqrt().floor() as usize {
        if candidates[num] {
            let prime = num;
            for not_prime in (2 * prime..=max).step_by(prime) {
                candidates[not_prime] = false;
            }
        }
    }
    candidates
        .iter()
        .enumerate()
        .filter(|&(_num, &is_p)| is_p)
        .map(|(num, _is_p)| num)
        .collect::<Vec<_>>()
}

use std::collections::{BinaryHeap, HashMap, HashSet, VecDeque};
use std::io::{self, BufRead, Read};
use std::{cmp, fmt, iter, usize};

fn factorize(num: usize) -> HashMap<usize, usize> {
    if num < 2 {
        return HashMap::new();
    }

    let mut remain = num;
    let mut factor = HashMap::new();
    let primes = sieve_of_eratosthenes((num as f64).sqrt().floor() as usize);
    for &p in primes.iter() {
        if remain < p {
            break;
        }
        if remain % p == 0 {
            let entry = factor.entry(p).or_insert(0);
            while remain % p == 0 {
                remain /= p;
                *entry += 1;
            }
        }
    }

    // numが素数の場合
    if remain == num {
        factor.insert(num, 1).unwrap();
    }
    factor
}

fn main() {
    input! {
        A: usize,
        B: usize,
    }
    let gcd = gcd(min!(A, B), max!(A, B));
    let factor = factorize(gcd);
    println!("{}", factor.len() + 1);
}