Problem p02900 (python)

Fixed submission:
from fractions import gcd

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

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)

    if temp!=1:
        arr.append(temp)

    return arr
  
d = gcd(a,b)
print(len(factorization(d)) + 1)

Buggy submission (verdict: Runtime Error):
import math

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

def factorization(n):
  factor=[]
  tmp=int(math.sqrt(n))+1
  for num in range(2,tmp):
    while n%num==0:
      n//=num
      factor.append(num)
      break
    if not factor:
      return 'prime number'
    else:
      factor.append(n)
      return factor

a_list=factorization(a)
b_list=factorization(b)

a_b_and=set(a_list)&set(b_list)
print(len(a_b_and)+1)

Buggy submission (verdict: Runtime Error):
import math

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

def factorization(n):
  factor=[]
  tmp=int(math.sqrt(n))+1
  for num in range(2,tmp):
    while n%num==0:
      n//=num
      factor.append(num)
      break
    if not factor:
      return 'prime number'
    else:
      factor.append(n)
      return factor
a_list=factorization(a)
b_list=factorization(b)

a_b_and=set(a_list)&set(b_list)
print(len(a_b_and)+1)

Buggy submission (verdict: Runtime Error):
import math

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

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)

    if temp!=1:
        arr.append(temp)

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

    return arr
  
d = math.gcd(a,b)

Buggy submission (verdict: Runtime Error):
import math

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

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)

    if temp!=1:
        arr.append(temp)

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

    return arr
  
d = gcd(a,b)

Buggy submission (verdict: Runtime Error):
import math

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

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)
    if temp!=1:
        arr.append(temp)
    return arr

d = math.gcd(a,b)
print(len(factorization(d)) + 1)

Buggy submission (verdict: Runtime Error):
import math

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

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)
    if temp!=1:
        arr.append(temp)
    return arr
  
a_list = factorization(a)
b_list = factorization(b)

d = math.gcd(a,b)
d_list = factorization(d)
print(len(d_list)+1)

Buggy submission (verdict: Runtime Error):
import math

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

def factorization(n):
  arr=[]
  temp=n
  for i in range(2,int(math.sqrt(n))+1):
    if temp % i == 0:
      cnt = 0
      while temp % i == 0:
        cnt += 1
        temp /= int(i)
      arr.append(i)
    if temp != 1:
      arr.append(temp)
    return arr
d=math.gcd(a,b)
print(len(factorization(d))+1)

Buggy submission (verdict: Runtime Error):
import math

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

def factorization(n):
  arr=[]
  temp=n
  for i in range(2,int(math.sqrt(n))+1):
    if temp % i == 0:
      cnt = 0
      while temp % i == 0:
        cnt += 1
        temp //= i
      arr.append(i)
    if temp != 1:
      arr.append(temp)
    return arr
d=math.gcd(a,b)
print(len(factorization(d))+1)

Buggy submission (verdict: Runtime Error):
import math

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

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

    if temp!=1:
        arr.append(temp)


    return arr
  
d = math.gcd(a,b)  
print(len(factorization(d)) + 1)

Buggy submission (verdict: Runtime Error):
import math

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

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)

    if temp!=1:
        arr.append(temp)


    return arr
  
d = math.gcd(a,b)  
print(len(factorization(d)) + 1)

Buggy submission (verdict: Runtime Error):
import math

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

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)

    if temp!=1:
        arr.append(temp)


    return arr
  
d = math.gcd(a,b)  
print(len(factorization(d)) + 1)

Buggy submission (verdict: Runtime Error):
import math

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

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_list = factorization(a)
b_list = factorization(b)

a_b_and = set(a_list) & set(b_list)
print(len(a_b_and) + 1)