python/challenge4.py at main · yadavrahulrao/python · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
# n = 1123
# time complexity - log10(n)
# count = 0
# while n > 0 :
#     digit = n % 10
#     count = count + 1
#     n = n // 10


# print(count)


# n = 727
# p = n

# r = 0
# while n > 0 :
#     dig = n % 10
#     r = (r * 10) + dig
#     n = n // 10

# print(r==p)
# if int(p) != int(r) :
#     print("False")

# else :
#     print("True")n = 727


# n = 371
# s = str(n)
# l = [int(i) for i in s]
# len_n = len(l)
# lam = [x**len_n for x in l]
# o = sum(lam)
# print(o)


# n = 36

# for i in range(1,n+1):
#     if n % i == 0 :
#         print(i)


#LCM Program

# num1 = int(input("enter 1st num:"))
# num2 = int(input("enter 2nd num:"))
# n = num1 * num2
# res1= [x * num1 for x in range(1,n)]
# for y in range(1,n):
#     if y * num2 in res1 :
#         print(y*num2)
#         break
# s = set()
# dup = set()
# for i in res1:
#     if i in s :
#         print(i)
#         break
#     else:
#         s.add(i)
# # print(min(dup))


# n = 5
# c = 0
# for i in range(1,n+1):
#     if n % i == 0 :
#         c += 1

# if c == 2 :
#     print("prime")
# else:
#     print("not prime ")


# num1 = int(input("enter the 1st num:"))
# num2 = int(input("enter the 2nd number:"))

# n = min(num1,num2)
# hcf = 1

# for i in range(1,n+1):
#     if num1 % i == 0 and num2 % i == 0:
#         hcf = i

# print(hcf)


n1 = int(input("enter num1:"))
n2 = int(input("enter num2:"))

num1 = max(n1,n2)
num2 = min(n1,n2)
sub = num1 - num2

n = min(sub,num2)
hcf = 1
for i in range(1,n+1):
    if sub % i == 0 and num2 % i == 0 :
        hcf = i
print(hcf)