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: Time Limit Exceeded

Solution code:
import itertools, fractions
A, B = map(int, input().split())
cd_list = []
if A >= B:
    for n in range(1, B+1):
        if A%n == 0 and B%n == 0:
            cd_list.append(n)
else:
    for n in range(1, A+1):
        if A%n == 0 and B%n == 0:
            cd_list.append(n)
prime_list = [1]
for i in range(1, len(cd_list)):
    if all([1 if fractions.gcd(cd_list[i], n)==1 else 0 for n in cd_list[:i]]):
        prime_list.append(cd_list[i])
print(len(prime_list))

Submission status: Time Limit Exceeded

Solution code:
def prime(n):
    num=[i for i in range(n,1,-1)]
    prime=[]
    p = 2
    while p <=n**0.5 or num:
        p=num.pop()
        prime.append(p)
        num = [i for i in num if i%p != 0]
    return prime
def chk_prime(n):
    for i in range(2,int(n**0.5)):
        if n%i == 0:
            return False
    return True

def main():
    a,b=map(int,input().split(' '))
    prime_list=prime(min(a,b))
    ans = 1
    if chk_prime(min(a,b)):
        if max(a,b)%min(a,b) == 0 and min(a,b) != 1:
            ans = 2
    else:
        for i in prime_list:
            if a%i == 0 and b%i==0:
                ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import math
A,B = map(int,input().split())
N = max(A,B)
prime = []

tA = A
tB = B
for i in range(2, math.ceil(N**0.5)+1):
    if tA%i==0 and tB%i==0:
        while tA%i==0:
            tA //= i
        while tB%i==0:
            tB //= i
        prime.append(i)

if tA!=1 or tB != 1:
    N = max(tA,tB)
    for i in range(2, N+1):
        if tA%i==0 and tB%i==0:
            while tA%i==0:
                tA //= i
            while tB%i==0:
                tB //= i
            prime.append(i)

# print(prime)
print(len(prime)+1)

Submission status: Time Limit Exceeded

Solution code:
import fractions
A,B = map(int,input().split())

import math


def get_sieve_of_eratosthenes(n):
    if not isinstance(n, int):
        raise TypeError('n is int type.')
    if n < 2:
        return [1]
    prime = []
    limit = math.sqrt(n)
    data = [i + 1 for i in range(1, n)]
    while True:
        p = data[0]
        if limit <= p:
            return prime + data
        prime.append(p)
        data = [e for e in data if e % p != 0]
Max = max(A,B)
def koyaku(a,b,arr):
    for i in range(1,Max+1):
        if a%i==0 and b%i==0:
            arr.append(i)
    return arr
Koyaku =[]
cnt = 0
Koyaku = koyaku(A,B,Koyaku)
Koyaku.sort()

data = get_sieve_of_eratosthenes(Koyaku[-1])
data.append(1)
for i in Koyaku:
    if i in data:
        cnt+=1
print(cnt)

Submission status: Time Limit Exceeded

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

import math
m = max(int(math.sqrt(a))+1, int(math.sqrt(b))+1)
primes = [2]
count = 1

if a%2==0 and b%2==0:
    count += 1
for i in range(3,m+1):
    div = True
    for j in primes:
        if i%j==0:
            div = False
    if div:
        primes.append(i)
        if a%i==0 and b%i==0:
            count += 1

print(count)

Submission status: Time Limit Exceeded

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

m = 1
count = 1

for i in range(2, min(a,b)//2):
    if a%i == 0 and b%i == 0 and (m*m)%i != 0:
        count += 1
        m = m*i

print(count)

Submission status: Time Limit Exceeded

Solution code:
a, b  = [int(i) for i in input().split()]
 
def divisor(n):
  i = 1
  table = []
  while i * i <= n:
    if n%i == 0:
      table.append(i)
      table.append(n//i)
    i += 1
  table = list(set(table))
  return table
 
def sieve(n):
  is_prime = [True for _ in range(n+1)]
  is_prime[0] = False
  for i in range(2, n+1):
    if is_prime[i-1]:
      j = 2 * i
      while j <= n:
        is_prime[j-1] = False
        j += i
  table = [ i for i in range(1, n+1) if is_prime[i-1]]
  return is_prime, table
def gcd(a,b):
  while b!=0:
    a,b=b,a%b
  return a
m = gcd(a,b)
_, sosu = sieve(m)
print(1+len(set(sosu)&set(divisor(m))))

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
def gcd(a, b):
  while b:
    a, b = b, a % b
  return a
def cf(x1,x2):
    cf=[]
    cf.append(1)
    for i in range(2,min(x1,x2)+1):
        if x1 % i == 0 and x2 % i == 0:
            cf.append(i)
    return cf

ans = cf(a,b)
if len(ans) == 1:
  print(len(ans))
  exit()
i = len(ans)-1
j = len(ans)-1
while i != 1:
  if gcd(ans[i], ans[j-1]) != 1:
    ans.remove(ans[i])
    i = len(ans)-1
    j = len(ans)-1
    continue
  j -= 1
  if j == 0:
    i -= 1
    j = i - 1

print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
A, B = map(int, input().split())

import fractions
gcd = fractions.gcd(A, B)

n = 2
count = 1
gcdmax = gcd
ar = [1]
notappend = False
while n <= gcdmax:
    if gcd % n == 0:
        #print("matched {} under {}".format(n, gcdmax))
        for aar in ar[1:]:
            if n % aar == 0:
                notappend = True
                break
        if notappend == False:
            ar.append(n)
            count += 1
        notappend = False
        gcdmax = gcd // n
    if n > 2:
        n += 2
    else:
        n += 1

#print(ar)
print(count)

Submission status: Time Limit Exceeded

Solution code:
a, b = map(int, input().split())
A, B = a, b
ans = 1

n = 2

while n <= max(A, B):
    if a%n == 0 and b%n == 0:
        while a%n == 0:
            a = a//n
        while b%n == 0:
            b = b//n
        ans += 1
    
    n += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
import fractions
import math

def cf(x, y):
    cf = [1]
    if x % 2 == 0 and y % 2 == 0:
        cf.append(2)

    for i in range(3, min(x,y)+1, 2):
        if x % i == 0 and y % i == 0:
            cf.append(i)
    return cf

def comprime(a, b):
    return fractions.gcd(a, b) == 1

def is_prime(n):
    if n == 1 : return True

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False
    return True

A,B = map(int, input().split())

y = cf(A,B)

c = [1]

for i in range(1, len(y)):
    for j in range(1,len(c)):
        if comprime(y[i], c[j]) == False:
            break
    else:
        c.append(y[i])


print(len(c))

Submission status: Time Limit Exceeded

Solution code:
import math
def get_prime(n):
    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 main():
    A,B = map(int,input().split())
    m = min(A,B)
    prime_count = 0
    lim = m / 2
    if (m > 7) :
        prime_list = get_prime(int(lim))
    else :
        prime_list = [2,3,5,7]
    # print(prime_list)
    # lim = math.sqrt(m)
    for i in range(1,m+1) :
        # print(i)
        # if (m % i == 0) :
        if (A % i == 0 and B % i == 0) :
            if (i in  prime_list) :
                # print(i)
                prime_count += 1
    
    # 1を含むので+1しておく
    # a = (prime_count+1) * (prime_count)
    # print(int(a/2))
    # 問題読み違えてた！！！！！！
    print(prime_count+1)
    



# メモ
# 案1
# まずは公約数を列挙する
# 素数かどうかを調べる
# 素数のうち、組み合わせを数える
# 間に合わない気がする
# 案2
# A,Bのちいさいほうの半分までの素数を列挙
# 小さい方の公約数を求める
# nC2を出す
main()

Submission status: Time Limit Exceeded

Solution code:
from itertools import combinations
from fractions import gcd

ans=0
aaa=0

a,b=map(int,input().split())
c=gcd(a,b)
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors
s=make_divisors(c)
#print(s)
for i in s:
    aaa=0
    if i>=3:
        for j in range(2,i):
            #print(i,j)
            if i%j==0:
                aaa=1
                break
            else:
                aab=0
    if aaa==0:
        ans+=1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
A, B = map(int, input().split())
 
yakusu_list = []
for i in range(2, min(A,B)+1):
  if A%i==0 and B%i==0:
    yakusu_list.append(i)
i=0
while i<len(yakusu_list):
  koho = yakusu_list[i]
  for k in yakusu_list[i+1:]:
    if k%koho==0:
      yakusu_list.remove(k)
  i += 1
yakusu_list.append(1)

print(len(yakusu_list))

Submission status: Time Limit Exceeded

Solution code:
import fractions

A, B = map(int, input().split())
list1 = []
add_flg = True
for i in range(1, min(A, B) + 1):
    if A % i == 0 and B % i == 0:
        for element in list1:
            if fractions.gcd(element, i) != 1:
                add_flg = False
                break
        if add_flg:
            list1.append(i)
        add_flg = True
print(len(list1))

Submission status: Time Limit Exceeded

Solution code:
import math
A, B = map(int, input().split())

def is_prime(n):
  if n == 1: return False

  for k in range(2, int(math.sqrt(n)) + 1):
    if n % k == 0:
      return False

  return True

cf=[]
cnt = 0
for i in range(1,min(A,B)+1):
  if A % i == 0 and B % i == 0:
    cf.append(i)
    if is_prime(i) == True:
      cnt += 1

print(cnt+1)

Submission status: Time Limit Exceeded

Solution code:
a_b = input().split(" ")
A = int(a_b[0])
B = int(a_b[1])

p_nums = []
for i in range(1, int((A*B)**0.5) + 1):
    is_p_num = True
    if A % i == 0 and B % i == 0:
        for p in p_nums:
            if p == 1:
                continue
            if i % p == 0:
                is_p_num = False
                break
        if is_p_num:
            p_nums.append(i)

print(len(p_nums))

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
lista=[]
import fractions
gcd=fractions.gcd(a,b)

for i in range(2,gcd+1): 
    if a% i == 0 and b % i == 0: 
        lista.append(i)

#print(lista)
listb=[]
for i in range(len(lista)):
    flag = True
    for j in range(len(listb)):
        if lista[i]%listb[j]==0:
            flag = False    
    if flag==True:
        listb.append(lista[i])

print(len(listb)+1)

Submission status: Time Limit Exceeded

Solution code:
import math
from fractions import gcd
a,b = map(int,input().split())

ans = []
for i in range(1,gcd(a,b)+1):
    flag = True
    if a % i == 0 and b % i == 0:
        if i == 1:
            ans.append(i)
        else:
            for k in range(2, int(math.sqrt(i))+1):
                if i % k == 0:
                    flag = False
                    break
            if flag:
                ans.append(i)
print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
A,B=map(int,input().split())
def cf(a,b):
  cf=[]
  for i in range(1,min(a,b)+1):
    if a%i==0 and b%i==0:
      cf.append(i)
  return cf
x=cf(A,B)
n=max(x)
def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]
ok=set(x)&set(primes(n))
print(len(ok)+1)

Submission status: Time Limit Exceeded

Solution code:
import math

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

m = 1
count = 1

for i in range(2, min(a,b)//2):
    if a%i == 0 and b%i == 0 and (m*m)%i != 0:
        count += 1
        m = m*i

print(count)

Submission status: Time Limit Exceeded

Solution code:
import math

a, b = [int(i) for i in input().split()]


class Prime:
    seed_primes = [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]
    seed_primes = [int(i) for i in "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".split()]

    def is_prime(self, n):
        """
        prime test (hybrid)

        see also: https://qiita.com/gushwell/items/ff9ed83ba55350aaa369

        :param n:
        :return: boolean
        """
        is_prime_common = self.is_prime_common(n)
        if is_prime_common is not None:
            return is_prime_common

        if n < 2000000:
            return self.is_prime_brute_force(n)
        else:
            return self.is_prime_miller_rabin(n)

    def is_prime_common(self, n):
        if n == 1: return False
        if n in Prime.seed_primes: return True
        if any(map(lambda x: n % x == 0, self.seed_primes)): return False

    def is_prime_brute_force(self, n):
        """
        brute force prime test
        use with is_prime_common if you want to skip seed_primes

        :param n:
        :return: boolean
        """
        for k in range(2, int(math.sqrt(n)) + 1):
            if n % k == 0:
                return False
        return True

    def is_prime_miller_rabin(self, n):
        """
        miller rabin prime test
        use with is_prime_common if you want to skip seed_primes

        see also
            algorithm: https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test
            implementation: https://qiita.com/srtk86/items/609737d50c9ef5f5dc59
            improvement: https://qiita.com/gushwell/items/ff9ed83ba55350aaa369

        :param n:
        :return: boolean
        """

        d = n - 1
        while d & 1 == 0:
            d >>= 1

        # use one of these lines / upper is more efficient.
        witnesses = self.get_witnesses(n)
        # witnesses = [random.randint(1, n - 1) for _ in range(100)]

        for w in witnesses:
            y = pow(w, d, n)

            while d != n - 1 and y != 1 and y != n - 1:
                y = (y * y) % n
                d <<= 1

            if y != n - 1 and d & 1 == 0:
                return False

        return True

    def get_witnesses(self, num):
        def _get_range(num):
            if num < 2047:
                return 1
            if num < 1373653:
                return 2
            if num < 25326001:
                return 3
            if num < 3215031751:
                return 4
            if num < 2152302898747:
                return 5
            if num < 3474749660383:
                return 6
            if num < 341550071728321:
                return 7
            if num < 3825123056546413051:
                return 9
            return 12

        return self.seed_primes[:_get_range(num)]

    def gcd(self, a, b):
        if a < b:
            return self.gcd(b, a)
        if b == 0:
            return a
        while b:
            a, b = b, a % b
        return a

    @staticmethod
    def f(x, n, seed):
        """
        pseudo prime generator
        :param x:
        :param n:
        :param seed:
        :return: pseudo prime
        """
        p = Prime.seed_primes[seed % len(Prime.seed_primes)]
        return (p * x + seed) % n

    def find_factor(self, n, seed=1):
        """
        find one of factor of n
        this function is based to Pollard's rho algorithm

        see also
            algorithm: https://en.wikipedia.org/wiki/Pollard%27s_rho_algorithm
            implementation: https://qiita.com/gushwell/items/561afde2e00bf3380c98

        :param n:
        :param seed:
        :return: factor
        """
        if self.is_prime(n):
            return n

        x, y, d = 2, 2, 1
        count = 0
        while d == 1:
            count += 1
            x = self.f(x, n, seed)
            y = self.f(self.f(y, n, seed), n, seed)
            d = self.gcd(abs(x - y), n)

        if d == n:
            return self.find_factor(n, seed + 1)
        return self.find_factor(d)

    def find_factors(self, n):
        primes = {}
        if self.is_prime(n):
            primes[n] = 1
            return primes

        while n > 1:
            factor = self.find_factor(n)

            primes.setdefault(factor, 0)
            primes[factor] += 1

            n //= factor

        return primes


prime = Prime()
if prime.is_prime(a) and prime.is_prime(b):
    print(1)
else:
    _gcd = prime.gcd(a, b)
    fact_dict = prime.find_factors(_gcd)
    print(len(fact_dict.keys()) + 1)

Submission status: Time Limit Exceeded

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

	def sosuu(a):
	    sosuu_list = set()
	    while 1:
	        flag = True
	        for i in range(2,a+1):
	            if a % i == 0 and a != i:
	                a = a//i
	                sosuu_list.add(i)
	                flag = False
	                break
	        if flag:
	            sosuu_list.add(a)
	            return sosuu_list

	a = sosuu(a)
	# print(a)
	ans = 1
	for aa in a:
	    if b % aa == 0 and aa != 1:
	        ans += 1
	print(ans)

if __name__ == "__main__":
	main()

Submission status: Time Limit Exceeded

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

ans_list =[]

for i in range(1, min(a, b)+1):
  
  if a%i==0 and b%i==0:
    ans_list.append(i)
    a //= i
    b //= i

print(len(ans_list))

Submission status: Time Limit Exceeded

Solution code:
a,b=map(int,input().split())
l=[]
for i in range(1,min(a,b)+1):
    if a%i==0 and b%i==0: l.append(i)
for i in range(1,len(l)):
    for j in range(i+1,len(l)):
        if l[j]%l[i]==0: l[j]=1
    if i<5:l=sorted(set(l))
print(len(l))

Submission status: Time Limit Exceeded

Solution code:
import fractions

def isPrime(n):
    if n < 2:
    # 2未満は素数でない
        return False
    if n == 2:
    # 2は素数
        return True
    for p in range(2, n):
      if n % p == 0:
        # nまでの数で割り切れたら素数ではない
        return False
  # nまでの数で割り切れなかったら素数
    return True


A,B = map(int,input().split())
ans = fractions.gcd(A,B)
lists = []
cnt = 0
for i in range(1,ans+1):
    if (A % i == 0) and (B % i == 0):
        lists.append(i)
for i in lists:
    if isPrime(i):
        cnt += 1
print(cnt+1)

Submission status: Time Limit Exceeded

Solution code:
def gcd(n,m):
    n1=min(n,m)
    n2=max(n,m)
    if n1==0:
        return n2
    else:
        return gcd(n1, n2%n1)

A,B= map(int,input().split())

g = gcd(A,B)
divider = 2
count = 1
while g > 1:
    if g%divider==0:
        count+=1
        while g%divider==0:
            g = g // divider
    divider += 1
print(count)

Submission status: Time Limit Exceeded

Solution code:
import fractions
a,b = map(int, input().split())
g = fractions.gcd(a,b)
l = []

for i in range(2, g+1):
  if g%i == 0 and min(a,b)%i == 0:
    for j in range(2, i):
      if i%j == 0:
        break
    else:
      l.append(i)

print(len(l)+1)

Submission status: Time Limit Exceeded

Solution code:
import itertools
from fractions import gcd

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

def cf(x1,x2):
    cf=[]
    for i in range(1,min(x1,x2)+1):
        if x1 % i == 0 and x2 % i == 0:
            if cf:
                flg = True
                for l in cf:
                    if gcd(l, i) != 1:
                        flg = False
                        break
                if flg:
                    cf.append(i)
            else:
                cf.append(i)
    return cf


print(len(cf(a, b)))

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
import math

def isSosu(n):
    flag = 1
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            flag = 0
            break
    return flag

A, B = [int(x) for x in input().split(" ")]
if A > B:
    a, b = A, B
else:
    a, b = B, A
r = a % b
while r != 0:
    a = b
    b = r
    r = a % b
count = 1
if b % 2 == 0:
    count += 1
for i in range(3, b + 1):
    if b % i == 0:
        if isSosu(i):
            count += 1
print(count)

Submission status: Time Limit Exceeded

Solution code:
import math

def ans(i):
    if i == 1:
        return False
    for k in range(2,int(math.sqrt(i))+1):
        if i % k == 0:
            return False
    return True


def test():
    a,b = map(int,input().split())
    count = 0
    if min(a,b) == 1:
        print(1)
        return
    for i in range(1,min(a,b)//2+1):
        if a%i==0 and b%i==0:
            if ans(i):
                count += 1
    print(count+1)


if __name__ == "__main__":
    test()

Submission status: Time Limit Exceeded

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : map(int, stdin.readline().split())

def divi(n):
  res = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      res.append(i)
      if i != n // i:
        res.append(n // i)
  return res

def isprime(n):
  for i in range(2, n+1):
    if i*i <= n:
      if (n % i == 0):
        return False
  return True

def main():
  a, b = sorted(na())
  x = divi(a)
  cnt = 0
  for bb in divi(b):
    if bb in x and isprime(bb):
      cnt += 1
  print(cnt)
main()

Submission status: Time Limit Exceeded

Solution code:
A, B = map(int, input().split())

def cf(a, b):
    cf = [1]
    for i in range(2, min(a, b)+1):
        if a % i == 0 and b % i == 0:
            if (i == 2) or (i > 2 and i % 2 != 0):
                if i >= 5 and i % cf[-1] == 0:
                    pass
                else:
                    cf.append(i)
            else:
                pass
    return cf

cf_l = cf(A, B)

print(len(cf_l))

Submission status: Time Limit Exceeded

Solution code:
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a
  
def divisor(n): #nの約数を全て求める
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table

def isPrime(n):
  if n < 2:
    # 2未満は素数でない
    return False
  if n == 2:
    # 2は素数
    return True
  for p in range(2, n):
      if n % p == 0:
        # nまでの数で割り切れたら素数ではない
        return False
  # nまでの数で割り切れなかったら素数
  return True

A,B = list(map(int,input().split()))
 
aaa = []
 
aaa = divisor(gcd(A,B))
        
count = 0
 
for i in range(len(aaa)):
    if isPrime(aaa[i]) == True:
        count += 1
        
print(count+1)

Submission status: Time Limit Exceeded

Solution code:
def main():
  import fractions
  import math

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

  if a>b:
    a,b = b,a
  
  d = [1]
  num = 2

  while num <= min(a,b):
    if a%num == 0 and b%num == 0:
      d.append(num)
      while a%num == 0:
        a = a//num
      while b%num == 0:
        b = b//num
    num+=1
  
  print(len(d))

if __name__ == "__main__":
  main()

Submission status: Time Limit Exceeded

Solution code:
import math
A, B = (int(i) for i in input().split())
C=0
flg = 0
for i in range(2,min(A,B)+1):
	if A % i == 0 and B % i == 0:
		for p in range(2, i):
			if i % p == 0:
				flg = 1
				break
		if flg == 1:
			flg = 0
		else:
			C+=1
print(C+1)

Submission status: Time Limit Exceeded

Solution code:
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a
    
import math

def is_prime(n):
    if n == 1: return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True
    
A, B = map(int, input().split())

gcd_AB = gcd(A, B)
cd = []
for i in range(2, gcd_AB + 1):
    if A % i == 0 and B % i == 0:
        cd.append(i)

count = 1
for i in range(len(cd)):
    if is_prime(cd[i]) == True:
        count += 1

print(count)

Submission status: Time Limit Exceeded

Solution code:
import math


def get_primes_of_target_list(target_list):
    if len(target_list) == 0:
        return []

    # 公約数のうち、素数の個数を求める
    prime_list = []
    limit = math.sqrt(target_list[len(target_list) - 1])
    while len(target_list) > 0:
        p = target_list[0]
        if p >= limit:
            return prime_list + target_list
        prime_list.append(p)
        target_list = [e for e in target_list if e % p != 0]
    return prime_list


A, B = map(int, input().split())

# 全ての（1以外の）公約数を求める
cd_list = [e for e in range(2, min(A, B) + 1) if (A % e == 0) and (B % e == 0)]

primes_of_cd_list = get_primes_of_target_list(cd_list)

# 1 は最後に足す
print(len(primes_of_cd_list) + 1)

Submission status: Time Limit Exceeded

Solution code:
import math
A, B = map(int,input().split())
A_cf = []
B_cf = []
for i in range(1,int(A**0.5)+1):
    if A % i == 0:
        A_cf.append(i)
        if i != A // i:
            A_cf.append(A//i)
for i in range(1,int(B**0.5)+1):
    if B % i == 0:
        B_cf.append(i)
        if i != B // i:
            B_cf.append(B//i)
DA = dict()
for i in range(len(A_cf)):
    DA[A_cf[i]] = False

for i in range(len(B_cf)):
    if B_cf[i] in DA:
        DA[B_cf[i]] = True
cf = []
for i in range(len(A_cf)):
    if DA[A_cf[i]]:
        if A_cf[i] % 2 == 0 and A_cf[i] != 2:
            continue
        cf.append(A_cf[i])
prime_num = []
cf.sort()
"""
def isPrime(n):
    if n == 2:
        return True
    if n % 2 == 0:
        return False

    m = math.floor(math.sqrt(n)) + 1
    for p in prime_num:
        if n % p == 0:
            return False
        if p > m:
            break
    return True
"""
def isPrime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    m = math.floor(n/2) + 1
    for p in range(3,m,2):
        if n % p == 0:
            return False
    return True

for i in range(len(cf)):
    if isPrime(cf[i]):
        prime_num.append(cf[i])

ans = len(prime_num) + 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
A, B = map(int, input().split())

def calc_divi(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

out_A = calc_divi(A)
out_B = calc_divi(B)

tmp = list(set(out_A) & set(out_B))
tmp = sorted(tmp, reverse=True)
tmp.remove(1)

out = 0
for i in range(len(tmp)):
  jdg = 0
  for k in range(len(tmp)):
    if tmp[i] > tmp[k]:
      if tmp[i]%tmp[k] == 0:
        jdg = jdg + 1
        break
  if jdg == 0:
    out = out + 1

out = out + 1
print(out)

Submission status: Time Limit Exceeded

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : map(int, stdin.readline().split())

def divi(n):
  res = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      res.append(i)
      if i != n // i:
        res.append(n // i)
  return res

def isprime(n):
  for i in range(2, n+1):
    if i*i <= n:
      if (n % i == 0):
        return False
  return True

def main():
  a, b = sorted(na())
  x = divi(a)
  y = []
  for bb in divi(b):
    if bb in x:
      y.append(bb)
  cnt = 0
  for i, yy in enumerate(y):
    if not isprime(yy):
      continue
    cnt += 1
  print(cnt)
main()

Submission status: Time Limit Exceeded

Solution code:
import fractions

A, B = map(int, input().split())

gcd = fractions.gcd(A, B)

results = {1}
for i in range(1, (gcd//2) + 1):
    if gcd % i == 0:
        for j in results:
            if fractions.gcd(j, i) != 1:
                break
        else:
            results.add(i)
r = len(results)
print(2 if r == 1 and gcd > 1 else r)