In số yếu tố phổ biến của a và b.
Đầu vào> 10, 15
Đầu ra> 2
Các yếu tố phổ biến của 10, 15 là 1 và 5
Mã của tôi
def print_factors[x,y]:
l = []
for i in range[1, x + 1]:
if x % i == 0:
l.append[i]
m = []
for i in range[1, y + 1]:
if y % i == 0:
m.append[i]
print [list[set[l].intersection[m]]]
num1 = int[input["Enter a number: "]] #10
num2 = int[input["Enter a number: "]] #15
print_factors[num1,num2]
Có cách nào tốt hơn để tối ưu hóa, như hiểu danh sách. hoặc sử dụng mô -đun zip
Hỏi ngày 16 tháng 8 năm 2019 lúc 12:50Aug 16, 2019 at 12:50
4
Rõ ràng là GCD đã có, vì vậy câu trả lời khác có thể được sửa đổi là
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
Sau đó, tất nhiên bạn có thể sử dụng "thủ thuật" từ các bài kiểm tra chính và vòng lặp cho đến khi chỉ căn bậc hai của số, vì các ước số có theo cặp:
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
Đã trả lời ngày 16 tháng 8 năm 2019 lúc 13:21Aug 16, 2019 at 13:21
Tevemadartevemadartevemadar
11.6K3 Huy hiệu vàng18 Huy hiệu bạc45 Huy hiệu đồng3 gold badges18 silver badges45 bronze badges
5
Để tìm các yếu tố phổ biến cho hai số, hãy làm
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
Chỉnh sửa: Nếu bạn muốn số lượng yếu tố phổ biến
print[len[cf[6,12]]]
>> output 4
Đã trả lời ngày 16 tháng 8 năm 2019 lúc 13:05Aug 16, 2019 at 13:05
ShijithshijithShijith
4.0602 Huy hiệu vàng18 Huy hiệu bạc32 Huy hiệu đồng2 gold badges18 silver badges32 bronze badges
3
Mã nguồn
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
Đầu ra
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 320
Lưu ý: Để tìm các yếu tố của một số khác, hãy thay đổi giá trị của num. To find the factors of another number, change the value of num.
Trong chương trình này, số có hệ số sẽ được tìm thấy được lưu trữ trong num, được chuyển đến hàm print_factors[]. Giá trị này được gán cho biến X trong print_factors[].
Trong hàm, chúng tôi sử dụng vòng
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
num1 = int [input ["nhập số đầu tiên:"]] num2 = int [input ["nhập số thứ hai:"]] # in kết quả cho người dùng. In ["The H.C.F. của", Num1, "và", num2, "is", calculation_hcf [num1, num2]]
Làm thế nào để bạn tìm thấy n số tự nhiên trong Python?
Vì vậy, một danh sách số tự nhiên có thể được định nghĩa là: n = {0, 1, 2, 3, 4, .... và vân vân} n = {1, 2, 3, 4, .... và như vậy trên}.
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3200
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3203
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3205
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3208
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3209
num0from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
num8num9from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
num1num2num3def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
num6from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print_factors[]0from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print_factors[]3print_factors[]4print_factors[]5__94from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print_factors[]9from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
Java
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3200
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3203
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3208
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3208
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3209
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
num8num9from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
num2from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
num6from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print_factors[]0from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print_factors[]3print_factors[]4print_factors[]5__94from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print_factors[]9def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
Python3
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
Java
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
num2from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
C#
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3200
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
print[len[cf[6,12]]]
>> output 4
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3208
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3209
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
num2from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print_factors[]9def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
JavaScript
print[len[cf[6,12]]]
>> output 4
print[len[cf[6,12]]]
>> output 4
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
print[len[cf[6,12]]]
>> output 4
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
print[len[cf[6,12]]]
>> output 4
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3204
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
The factors of 320 are: 1 2 4 5 8 10 16 20 32 40 64 80 160 3209
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
from fractions import gcd
from math import sqrt
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, int[sqrt[g]]+1]:
if g%i==0:
n.append[i]
if g!=i*i:
n.append[int[g/i]]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
num2from fractions import gcd
def cf[num1,num2]:
n=[]
g=gcd[num1, num2]
for i in range[1, g+1]:
if g%i==0:
n.append[i]
return n
print[cf[int[input["a:"]],int[input["b:"]]]]
def cf[num1,num2]:
n=[]
for i in range[1, min[num1, num2]+1]:
if num1%i==num2%i==0:
n.append[i]
return n
print[cf[6,12]]
>> output [1, 2, 3, 6]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
print_factors[]9
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors[x]:
print["The factors of",x,"are:"]
for i in range[1, x + 1]:
if x % i == 0:
print[i]
num = 320
print_factors[num]
Độ phức tạp về thời gian: O [n*log [m]] trong đó n là độ dài của mảng đã cho và m là phần tử tối đa trong mảng. O[N*log[M]] where N is the length of the given array and M is the maximum element in the array.
Không gian phụ trợ: O [[log [max [a, b]]] 3/2] & nbsp;O[[log[max[a, b]]]3/2]
Làm thế nào để bạn tìm thấy yếu tố chung của một số trong Python?
Phương pháp tìm các ước số chung của hai số..
Lưu trữ hai số trong biến 'num1' và 'num2' ..
Tuyên bố một biến nói rằng 'i' và khởi tạo nó với 1 ..
Kiểm tra tính phân chia của cả hai số bằng 'I' ..
Nếu cả hai số đều chia hết, hãy hiển thị ước số chung, tức là 'I' ..
Tăng giá trị của 'i' bởi 1 ..
Làm thế nào để bạn tìm thấy HCF của một số N trong Python?
num1 = int [input ["nhập số đầu tiên:"]] num2 = int [input ["nhập số thứ hai:"]] # in kết quả cho người dùng.In ["The H.C.F. của", Num1, "và", num2, "is", calculation_hcf [num1, num2]]calculate_hcf[num1, num2]]
Làm thế nào để bạn tìm thấy n số tự nhiên trong Python?
Vì vậy, một danh sách số tự nhiên có thể được định nghĩa là: n = {0, 1, 2, 3, 4, .... và vân vân} n = {1, 2, 3, 4, .... và như vậytrên}..
num = int [input ["nhập một số:"]].
Nếu num 0]:.
sum += num ..
Làm thế nào để bạn tìm thấy các yếu tố phổ biến của số?
Yếu tố chung lớn nhất là yếu tố lớn nhất phân chia cả hai số.Để tìm ra yếu tố chung lớn nhất, đầu tiên hãy liệt kê các yếu tố chính của mỗi số.18 và 24 chia sẻ một 2 và một 3 chung.Chúng tôi nhân chúng để lấy GCF, vì vậy 2 * 3 = 6 là GCF là 18 và 24.first list the prime factors of each number. 18 and 24 share one 2 and one 3 in common. We multiply them to get the GCF, so 2 * 3 = 6 is the GCF of 18 and 24.