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.



Sample input:
12 18


Sample output:
3

Submission status: Wrong Answer

Solution code:
prime=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973, 10007, 10009, 10037, 10039, 10061, 10067, 10069, 10079, 10091, 10093, 10099, 10103, 10111, 10133, 10139, 10141, 10151, 10159, 10163, 10169, 10177, 10181, 10193, 10211, 10223, 10243, 10247, 10253, 10259, 10267, 10271, 10273, 10289, 10301, 10303, 10313, 10321, 10331, 10333, 10337, 10343, 10357, 10369, 10391, 10399, 10427, 10429, 10433, 10453, 10457, 10459, 10463, 10477, 10487, 10499, 10501, 10513, 10529, 10531, 10559, 10567, 10589, 10597, 10601, 10607, 10613, 10627, 10631, 10639, 10651, 10657, 10663, 10667, 10687, 10691, 10709, 10711, 10723, 10729, 10733, 10739, 10753, 10771, 10781, 10789, 10799, 10831, 10837, 10847, 10853, 10859, 10861, 10867, 10883, 10889, 10891, 10903, 10909, 10937, 10939, 10949, 10957, 10973, 10979, 10987, 10993, 11003, 11027, 11047, 11057, 11059, 11069, 11071, 11083, 11087, 11093, 11113, 11117, 11119, 11131, 11149, 11159, 11161, 11171, 11173, 11177, 11197, 11213, 11239, 11243, 11251, 11257, 11261, 11273, 11279, 11287, 11299, 11311, 11317, 11321, 11329, 11351, 11353, 11369, 11383, 11393, 11399, 11411, 11423, 11437, 11443, 11447, 11467, 11471, 11483, 11489, 11491, 11497, 11503, 11519, 11527, 11549, 11551, 11579, 11587, 11593, 11597, 11617, 11621, 11633, 11657, 11677, 11681, 11689, 11699, 11701, 11717, 11719, 11731, 11743, 11777, 11779, 11783, 11789, 11801, 11807, 11813, 11821, 11827, 11831, 11833, 11839, 11863, 11867, 11887, 11897, 11903, 11909, 11923, 11927, 11933]
a,b=[int(i) for i in input().split()]
ans=1
for i in prime:
    if a%i==0 and b%i==0:
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y
def primes(n):
    P=[2]
    for L in range(3, n):
        isP = True
        for L2 in P: isP = isP and L%L2
        if isP: P.append(L)
    return P

A,B=LI()
Ps = primes(math.ceil(math.sqrt(max(A,B))))
res = 1
for i in Ps:
    if A%i == 0 and B%i == 0:
        res += 1

print(res)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
a, b = A, B
while b != 0:
  a, b = b, a % b
p = 1
g = a
for i in range(2, int(g ** (1/2)) + 1):
  if a % i == 0:
    p += 1
    while a % i == 0:
      a //= i
  if a == 1:
    break
if p == 1 and g != 1:
  p += 1
print(p)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
a, b = A, B
while b != 0:
  a, b = b, a % b
p = 1
g = a
for i in range(2, int(a ** (1/2)) + 1):
  if a % i == 0:
    p += 1
    while a % i == 0:
      a //= i
  if a == 1:
    break
if p == 1 and g != 1:
  p += 1
print(p)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
a, b = A, B
while b != 0:
  a, b = b, a % b
p = 1
for i in range(2, int(a ** (1/2)) + 2):
  if a % i == 0:
    p += 1
    while a % i == 0:
      a //= i
  if a == 1:
    break
print(p)

Submission status: Wrong Answer

Solution code:
from functools import reduce
from fractions import gcd
A, B = map(int,input().split())
a = reduce(gcd,[A,B])
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt = 1
                temp //= i
            arr.append(cnt)
    return arr
print(sum(factorization(a))+1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split(' '))

s, gcd = max(a, b), min(a, b)
c = s%gcd
count = 0
temp = 0
cd = [1]
while (c != 0):
    s = gcd
    gcd = c
    c = s%gcd

if gcd % 2 == 0:
    count += 1
    cd.append(2)
while gcd%2 == 0:
    gcd = gcd//2

for i in range(3, gcd,2):
    if gcd%i == 0:
        cd.append(i)
        temp += 1
        for x in cd:
            if (x > 1) and (i > x) and (i % x == 0):
                cd.pop()
        print(cd)
if (temp == 0) and (gcd != 1):
    cd.append(gcd)
print(len(cd))

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
while B != 0:
  A, B = B, A % B
j = 1
L = []
for k in range(2, A // 2 + 1):
  z = 0
  for i in range(len(L)):
    if k % L[i] == 0:
      z += 1
      break
  if z == 0:
    L.append(k)
for i in range(len(L)):
  if A % L[i] == 0:
    j += 1
print(j)

Submission status: Wrong Answer

Solution code:
import fractions
import math

# https://qiita.com/snow67675476/items/e87ddb9285e27ea555f8
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

a,b = map(int,input().split())

g = fractions.gcd(a,b)

"""
ans = 0
sqrtg = math.ceil(math.sqrt(g))+1
for i in range(2,sqrtg):
    #割り切れるなら割り切れなくなるまでiで割り続ける
    if (g%i == 0):
        ans += 1
        while (g % i == 0):
            g //= i
"""

print(len(factorization(g))+1)

Submission status: Wrong Answer

Solution code:
import fractions
import math

a,b = map(int,input().split())

g = fractions.gcd(a,b)
ans = 0
sqrtg = math.ceil(math.sqrt(g))+1
for i in range(2,sqrtg):
    #割り切れるなら割り切れなくなるまでiで割り続ける
    if (g%i == 0):
        ans += 1
        while (g % i == 0):
            g //= i

print(ans+1)

Submission status: Wrong Answer

Solution code:
import fractions
import math

a,b = map(int,input().split())

g = fractions.gcd(a,b)
ans = 0
sqrtg = math.ceil(math.sqrt(g))+1
for i in range(2,sqrtg):
    #割り切れるなら割り切れなくなるまでiで割り続ける
    if ((g // i * i == g)):
        ans += 1
        while (g // i * i == g):
            g //= i

print(ans+1)

Submission status: Wrong Answer

Solution code:
import math
from fractions import gcd

a,b=map(int,input().split())

def pf(x):
  x2=x
  y = int(math.sqrt(x))+1
  l=[1]
  if x%2==0:
    l.append(2)
    while x%2==0:
      x=x//2
  for i in range(3,y,2):
    if x%i==0:
      l.append(i)
    while x%i==0:
      x=x//i
    if x==1:
      break
  if x>=y:
    if x!=1:
      l.append(x)
  return(l)

count=0
n=gcd(a,b)

l=pf(n)

len=len(l)
for i in range(len):
  if  a%l[i]==0:
        count+=1
print(l,n)
print(count)

Submission status: Wrong Answer

Solution code:
import math

a,b=map(int,input().split())

def pf(x):
  x2=x
  y=int(x/2)
  l=[1]
  sq_x=math.sqrt(x)
  if x%2==0:
    l.append(2)
    while x%2==0:
      x=x//2
  for i in range(3,y,2):
    if x%i==0:
      l.append(i)
    while x%i==0:
      x=x//i
    if x==1:
      break
  if x==x2:
    if x!=1:
      l.append(x)
  return(l)

count=0
if b>a:
  a,b=b,a

l=pf(b)
print(l)

for i in range(len(l)):
  if l[i]!=0:
    if  a%l[i]==0:
        count+=1
print(count)

Submission status: Wrong Answer

Solution code:
#方針...ユークリッドの互除法を用いて2整数が互いに素かどうかを判定する関数を設計
#       O(route n)で2整数の公約数をリストとして出力する関数を設計
import math

def judge_disjoint(a,b):

    while (a!=0 and b!=0):
        if b<a:
            a,b = b,a
        b = b%a
    if (a==1 or b==1):
        return True
    else:
        return False

def common_divisor(a,b):
    ls_a=[]
    ls_b=[]
    A = int(math.sqrt(a))
    B = int(math.sqrt(b))
    for i in range(1,A+1):
        if (a%i==0):
            ls_a.append(i)
            ls_a.append(a//i)
    for i in range(1,B+1):
        if (b%i==0):
            ls_b.append(i)
            ls_b.append(b//i)
    ls = list(set(ls_a) & set(ls_b))
    return ls

A,B = list(map(int,input().split()))
ls = common_divisor(A,B)
ls.sort()
#print(ls)
N = len(ls)

def solve(ls):
    ls2=[1]
    ls.pop(0)

    if (len(ls)!=0):
        ls2.append(ls[0])
        for i in range(1,len(ls)):
            flag = True
            for j in range(i-1):
                if (ls[i]%ls[j]==0):
                    flag = False
            if flag:
                ls2.append(ls[i])
    return ls2


ans = len(solve(ls))


print(ans)

Submission status: Wrong Answer

Solution code:
#方針...ユークリッドの互除法を用いて2整数が互いに素かどうかを判定する関数を設計
#       O(route n)で2整数の公約数をリストとして出力する関数を設計
import math

def judge_disjoint(a,b):

    while (a!=0 and b!=0):
        if b<a:
            a,b = b,a
        b = b%a
    if (a==1 or b==1):
        return True
    else:
        return False

def common_divisor(a,b):
    ls_a=[]
    ls_b=[]
    A = int(math.sqrt(a))
    B = int(math.sqrt(b))
    for i in range(1,A+1):
        if (a%i==0):
            ls_a.append(i)
            ls_a.append(a//i)
    for i in range(1,B+1):
        if (b%i==0):
            ls_b.append(i)
            ls_b.append(b//i)
    ls = list(set(ls_a) & set(ls_b))
    return ls

A,B = list(map(int,input().split()))
ls = common_divisor(A,B)
ls.sort()
print(ls)
N = len(ls)

def solve(ls):
    ls2=[1]
    ls.pop(0)

    if (len(ls)!=0):
        ls2.append(ls[0])
        for i in range(1,len(ls)):
            flag = True
            for j in range(i-1):
                if (ls[i]%ls[j]==0):
                    flag = False
            if flag:
                ls2.append(ls[i])
    return ls2


ans = len(solve(ls))


print(ans)

Submission status: Wrong Answer

Solution code:
#方針...ユークリッドの互除法を用いて2整数が互いに素かどうかを判定する関数を設計
#       O(route n)で2整数の公約数をリストとして出力する関数を設計
import math

def judge_disjoint(a,b):

    while (a!=0 and b!=0):
        if b<a:
            a,b = b,a
        b = b%a
    if (a==1 or b==1):
        return True
    else:
        return False

def common_divisor(a,b):
    ls_a=[]
    ls_b=[]
    A = int(math.sqrt(a))
    B = int(math.sqrt(b))
    for i in range(1,A+1):
        if (a%i==0):
            ls_a.append(i)
            ls_a.append(a//i)
    for i in range(1,B+1):
        if (b%i==0):
            ls_b.append(i)
            ls_b.append(b//i)
    ls = list(set(ls_a) & set(ls_b))
    return ls

A,B = list(map(int,input().split()))
ls = common_divisor(A,B)
ls.sort()
#print(ls)
N = len(ls)

def solve(ls):
    ls2=[1]
    ls.pop(0)

    if (len(ls)!=0):
        ls.append(ls[0])
        for i in range(1,len(ls)):
            flag = True
            for j in range(i-1):
                if (ls[i]%ls[j]==0):
                    flag = False
            if flag:
                ls2.append(ls[i])
    return ls2


ans = len(solve(ls))


print(ans)

Submission status: Wrong Answer

Solution code:
def gcd(a, b):
    if a > b:
        a, b = (b, a)
    while b:
        a, b = b, a % b
    return a


def cf(x1, x2):
    ret = [1]
    gcd_num = gcd(x1, x2)

    i = 2
    while i*i <= gcd_num:
        if gcd_num % i == 0:
            ret.append(i)
        i += 1

    return ret


def is_prime_number(num):
    if num == 1:
        return False

    i = 2
    while i*i <= num:
        if num % i == 0:
            return False
        i += 1
    return True


def main():
    a, b = map(int, input().split())
    common_divisor_list = cf(a, b)

    count = 0
    for num in common_divisor_list:
        if is_prime_number(num):
            count += 1

    print(count + 1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

A,B = map(int,input().split())
import fractions
gcd = fractions.gcd(A,B)
ans = 1 + len(factorization(gcd))
print(ans)

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
import fractions
gcd = fractions.gcd(A,B)
import math
n = math.floor(gcd**0.5)
a = [i for i in range(2,n+1)]
soinsu = [1]
while len(a) > 0:
    x = a.pop(0)
    if gcd % x == 0:
        soinsu.append(x)
    y = n//x
    for j in range(1,y+1):
        z = j*x
        if z in a:
            a.remove(z)
ans = len(soinsu)
print(ans)

Submission status: Wrong Answer

Solution code:
from fractions import gcd
from math import sqrt

A, B = map(int, input().split())
C = gcd(A, B)
ans = 1
for i in range(2, C):
    if C % i == 0:
        ans += 1
        C //= i
        if C <= 1:
            break
print(ans)

Submission status: Wrong Answer

Solution code:
#AとBの最大公約数を素因数分解してから考える。
from fractions import gcd
a,b = map(int,input().split())
g = gcd(a,b)
#gを素因数分解し、素因数のセットを作る。
s = set([1,g])
for i in range(2,int(-(-g**0.5//1)+1)):
  flag = True
  while flag:
    if g%i==0:
      s.add(i)
      g=g//i
    else:
      flag = False
print(len(s))

Submission status: Wrong Answer

Solution code:
#AとBの最大公約数を素因数分解してから考える。
from fractions import gcd
a,b = map(int,input().split())
g = gcd(a,b)
#gを素因数分解し、素因数のリストと、個数のリストを作る。
l1 = []
l2 = []
for i in range(2,int(-(-g**0.5//1)+1)):
  flag = True
  while flag:
    if g%i==0:
      if len(l1) == 0 or l1[-1] != i:
        l1.append(i)
        l2.append(1)
      else:
        l2[-1] += 1
      g=g//i
    else:
      flag = False
print(len(l2)+1)

Submission status: Wrong Answer

Solution code:
#AとBの最大公約数を素因数分解してから考える。
from fractions import gcd
a,b = map(int,input().split())
g = gcd(a,b)
#gを素因数分解し、素因数のリストと、個数のリストを作る。
l1 = []
l2 = []
for i in range(2,-int(-g**0.5)+1):
  flag = True
  while flag:
    if g%i==0:
      if len(l1) == 0 or l1[-1] != i:
        l1.append(i)
        l2.append(1)
      else:
        l2[-1] += 1
      g=g//i
    else:
      flag = False
print(len(l2)+1)

Submission status: Wrong Answer

Solution code:
import math, fractions


def num_prime_factor(n):
    
    ret = 0
    
    for i in range(1, int(math.sqrt(n)) + 2):
        
        composite = False
        
        if n % i == 0:
            ret += 1
            n = n / i

            if i != 1:
                while n % i == 0:
                    n = n / i

            for j in range(2, int(math.sqrt(n)) + 2):
                if n % j == 0:
                    composite = True
                    break

            if not composite:
                ret += 1
                n = 1

        if n == 1:
            break

    return ret

if __name__ == "__main__":
    A, B = map(int, input().split())
    n = fractions.gcd(A, B)
    print(num_prime_factor(n))

Submission status: Wrong Answer

Solution code:
import math, fractions


def num_prime_factor(n):
    ret = 1
    for i in range(2, int(math.sqrt(n)) + 2):
        if i > n:
            break
        if n % i == 0:
            ret += 1
            n = n / i
            while n % i == 0:
                n = n / i
    return ret

if __name__ == "__main__":
    A, B = map(int, input().split())
    n = fractions.gcd(A, B)
    print(num_prime_factor(n))

Submission status: Wrong Answer

Solution code:
import math, fractions


def num_prime_factor(n):
    ret = 1
    for i in range(2, int(math.sqrt(n)) + 2):
        if n % i == 0:
            ret += 1
            n = n //  i
            while n % i == 0:
                n = n // i
    return ret

if __name__ == "__main__":
    A, B = map(int, input().split())
    n = fractions.gcd(A, B)
    print(num_prime_factor(n))

Submission status: Wrong Answer

Solution code:
import math, fractions


def num_prime_factor(n):
    ret = 1
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            ret += 1
            n /= i
            while n % i == 0:
                n /= i
    return ret

if __name__ == "__main__":
    A, B = map(int, input().split())
    n = fractions.gcd(A, B)
    print(num_prime_factor(n))

Submission status: Wrong Answer

Solution code:
# なんとなく薄目でみていると素因数分解したやつの底の共通するうちから2つ選ぶのが浮かんでくる
# と思ったけど共通するやつの数でいいのか？
# でやったら5WA

import math

a, b = map(int, input().split())


def ff(x):
    if x == 1 or x == 2:
        return True
    for i in range(2, math.floor(x ** 0.5) + 1):
        if x % i == 0:
            return False
    return True


def f(x):
    ret = []
    for i in range(1, math.floor(x ** 0.5) + 1):
        if x % i == 0 and ff(i):
            # 素数ならおｋ
            ret.append(i)
    return set(ret)


a_lis, b_lis = f(a), f(b)
common_lis = a_lis & b_lis
print(len(common_lis))

Submission status: Wrong Answer

Solution code:
# なんとなく薄目でみていると素因数分解したやつの底の共通するうちから2つ選ぶのが浮かんでくる
# と思ったけど共通するやつの数でいいのか？

a, b = map(int, input().split())


def ff(x):
    if x == 1 or x == 2:
        return True
    for i in range(2, int(x ** 0.5) + 1):
        if x % i == 0:
            return False
    return True


def f(x):
    ret = []
    for i in range(1, int(x ** 0.5) + 1):
        if x % i == 0 and ff(i):
            # 素数ならおｋ
            ret.append(i)
    return set(ret)


a_lis, b_lis = f(a), f(b)
common_lis = a_lis & b_lis
print(len(common_lis))

Submission status: Wrong Answer

Solution code:
def get_primes(n: int):
  # n以下の素数の List (昇順) を返却する。
  # エラトステネスの篩を使う。
  # 時間計算量は O(n log log n)
  # 空間計算量は O(n)
  if not isinstance(n, int):
    raise TypeError('n should be int')
  if n < 2:
    raise ValueError('n should be >= 2')
  if n == 2:
    return [2]
  prime = [2]
  limit = int(n**0.5)
  data = [i + 1 for i in range(2, n, 2)]
  while True:
    p = data[0]
    if limit <= p:
      return prime + data
    prime.append(p)
    data = [e for e in data if e % p != 0]

def solve(a: int, b: int) -> int:
  # a <= b とする
  a, b = (min(a, b), max(a, b))

  primes = get_primes(max(2, int(a ** 0.5)))

  ret = 1  # count 1
  for p in primes:
    if a % p == 0 and b % p == 0:
      ret += 1
  return ret


a, b = [int(s) for s in input().split()]
print(solve(a, b))

Submission status: Wrong Answer

Solution code:
def get_primes(n: int):
  # n以下の素数の List (昇順) を返却する。
  # エラトステネスの篩を使う。
  # 時間計算量は O(n log log n)
  # 空間計算量は O(n)
  if not isinstance(n, int):
    raise TypeError('n should be int')
  if n < 2:
    raise ValueError('n should be >= 2')
  prime = [2]
  limit = int(n**0.5)
  data = [i + 1 for i in range(2, n, 2)]
  while True:
    p = data[0]
    if limit <= p:
      return prime + data
    prime.append(p)
    data = [e for e in data if e % p != 0]


def solve(a: int, b: int) -> int:
  # a <= b とする
  a, b = (min(a, b), max(a, b))
  if a == 1:
    return 1

  primes = get_primes(int(a ** 0.5))

  ret = 1  # count 1
  for p in primes:
    if a % p == 0 and b % p == 0:
      ret += 1
  return ret


a, b = [int(s) for s in input().split()]
print(solve(a, b))

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
ans = 1
for i in range(2, 1+int(min(A**.5, B**.5))):
    if A % i == 0 and B % i == 0:
        ans += 1
    while A % i == 0:
        A //= i
    while B % i == 0:
        B //= i
print(ans)

Submission status: Wrong Answer

Solution code:
A, B = map(int,input().split())
if A>B:
    A,B = B,A
while B%A!=0:
    A = B%A
    B = A
GCD = A

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        if a == []:
            a.append(2)
        elif a[-1]!=2:
            a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            if a == []:
                a.append(f)
            elif a[-1]!=f:
                a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        if a == []:
            a.append(n)
        elif a[-1]!=n:
            a.append(n)
    return a
print(len(prime_factorize(GCD))+1)

Submission status: Wrong Answer

Solution code:
A, B = map(int,input().split())
if A>B:
    A,B = B,A
while B%A!=0:
    A = B%A
    B = A
GCD = A

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        if a == []:
            a.append(2)
        elif a[-1]!=2:
            a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            if a == []:
                a.append(f)
            if a[-1]!=f:
                a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        if a == []:
            a.append(n)
        if a[-1]!=n:
            a.append(n)
    return a
print(len(prime_factorize(GCD))+1)

Submission status: Wrong Answer

Solution code:
import math
 
a, b = map(int, input().split())
def gcd(x, y):
    if y == 0:
        return x
    else:
        return gcd(y, x % y)
ab_gcd = gcd(a, b)
gcd_sq = int(math.sqrt(ab_gcd) + 1)
ans = []
curr_num = ab_gcd
for i in range(2, gcd_sq + 1):
    if curr_num % i != 0:
        continue
    cnt = 0
    while curr_num % i == 0:
        curr_num = curr_num // i
        cnt += 1
    ans.append([i, cnt])
print(len(ans) + 1)

Submission status: Wrong Answer

Solution code:
import math

a, b = map(int, input().split())
def gcd(x, y):
    if y == 0:
        return x
    else:
        return gcd(y, x % y)
ab_gcd = gcd(a, b)
gcd_sq = int(math.sqrt(ab_gcd) + 1)
ans = []
curr_num = ab_gcd
for i in range(2, gcd_sq + 1):
    print(i, curr_num)
    if curr_num % i != 0:
        continue
    cnt = 0
    while curr_num % i == 0:
        curr_num = curr_num // i
        cnt += 1
    ans.append([i, cnt])
print(len(ans) + 1)

Submission status: Wrong Answer

Solution code:
import math

a, b = map(int, input().split())

if a < b:
    a, b = b, a

a_sq = int(math.sqrt(a)) + 1

com_div = []
for i in range(1, a_sq + 1):
# for i in range(1, a):
    if a % i == 0 and b % i == 0:
        com_div.append(i)
if len(com_div) == 1:
    print(1)
    exit()
    
ans = [1]
for i in range(1, len(com_div)):
    flg = 0
    for j in range(1, i):
        if com_div[i] % com_div[j] == 0:
            flg = 1
            break
    if flg == 0:
        ans.append(com_div[i])
print(len(ans))

Submission status: Wrong Answer

Solution code:
import math
a, b = map(int, input().split())
if a > b:
    a, b = b, a
a_sq = int(math.sqrt(a)) + 1
com_div = []
for i in range(1, a_sq + 1):
    if a % i == 0 and b % i == 0:
        com_div.append(i)
if len(com_div) == 1:
    print(1)
    exit()
    
ans = [1]
for i in range(1, len(com_div)):
    flg = 0
    for j in range(1, i):
        if com_div[i] % com_div[j] == 0:
#             print(com_div[i], com_div[j])
            flg = 1
            break
    if flg == 0:
        ans.append(com_div[i])
print(len(ans))

Submission status: Wrong Answer

Solution code:
from collections import defaultdict,deque, Counter
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
ans = 0

def num_check(n,a,b):
    just_list = list(range(2,n+1))
    ans_dq = deque([1])
    while len(just_list)!=0:
        first_val = just_list[0]
        ans_dq.append(first_val)
        just_list = [i for i in just_list if (i%first_val != 0 and a%i == 0 and b%i == 0)]
    return len(ans_dq)

def gcd(a,b):
    if b>a: return gcd(b,a)
    else: return gcd(b,a%b) if a%b else b

[a,b] = inpl()
n = gcd(a,b)
ans = num_check(int(n**0.5),a,b)
print(ans)