List of articles

• Calculation EXCEL Horizontal address
• Read the file and wrap on demand
• Interest group matching
• Word analysis
• Cycle of the sum of the squares of the numbers
• Combined number
• Palindrome date
• Score statistics
• Pressure calculation
• Split calculation
• Operate the second-order magic cube
• seek 100！ How many positive divisors are there in
• Formula 900
• Calculate the snake's length
• House number making
• Digital sorting
• Fibonacci sequence summation
• Rose number
• Calculate paper size

Calculation EXCEL Horizontal address

''' Function： Calculation EXCEL Address Auto：Sherry Date：2022.1.21 '''
word =['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']
n = int(input(''))
if n in range(1, 2147483647):
while True:
if n <= 26:
print(word[n-1])
break
else:
if n / 26 <= 26:
a = n // 26 - 1
print(word[a],end='')
n = n - 26
continue

Read the file and wrap on demand

''' Function：PayTheList Auto：Sherry Date：2022-04-08 17:28 '''
f = open("f:\Python_Datebase\PythonTestDate\ListOfSupermarket.txt",encoding='utf-8')
list = []
for line in f:
line = line.replace("\n", "")
line = line.replace(" ", ",")
line = line.replace(" ","")
print(line)
line = line.split(",")
list.append(line)
print(list)

Interest group matching

''' Function： Interest group matching Auto：Sherry Date：2022.1.16 '''
A = "12894792, 92774113, 59529208, 22962224, 02991600, 83340521, 87365045,40818286, 16400628, 39475245, 55933381, 76940287, 61366748, 95631228,17102313, 50682833, 61562613, 87002524, 83062019, 51743442, 61977890,32010762, 69680621, 87179571, 81761697, 32364296, 07833271, 36198035,26588918, 84046668, 43059468, 73191775, 56794101, 00454780, 11141030,10008994, 35072237, 44945158, 53959980, 75758119, 18560273, 35801494,42102550, 22496415, 03981786, 34593672, 13074905, 07733442, 42374678,23452507, 98586743, 30771281, 17703080, 52123562, 05898131, 56698981,90758589, 18238802, 18217979, 04511837, 75682969, 31135682, 55379006,42224598, 98263070, 40228312, 28924663, 11580163, 25686441, 45944028,96731602, 53675990, 03854194, 14858183, 16866794, 40677007, 73141512,32317341, 56641725, 43123040, 15201174, 62389950, 72887083, 76860787,61046319, 06923746, 17874548, 46028629, 10577743, 48747364, 05328780,59855415, 60965266, 20592606, 14471207, 70896866, 46938647, 33575820,53426294, 56093931, 51326542, 94050481, 80114017, 33010503, 72971538,22407422, 17305672, 78974338, 93209260, 83461794, 41247821, 26118061,10657376, 42198057, 15338224, 50284714, 32232841, 26716521, 76048344,23676625, 62897700, 69296551, 59653393, 38704390, 48481614, 69782897,26850668, 37471053, 88720989, 51010849, 94951571, 60024611, 29808329,70377786, 13899299, 09683688, 58218284, 46792829, 97221709, 45286643,48158629, 57367208, 26903401, 76900414, 87927040, 09926730, 01508757,15101101, 62491840, 43802529, "
B = "44894050, 34662733, 44141729, 92774113, 99208727, 91919833, 23727681, 10003409, 55933381, 54443275, 13584702, 96523685, 50682833, 61562613, 62380975, 20311684, 93200452, 23101945, 42192880, 28992561, 18460278,19186537, 58465301, 01111066, 62680429, 23721241, 20277631, 91708977,57514737, 03981786, 81541612, 07346443, 93154608, 19709455, 37446968,17703080, 72378958, 66200696, 30610382, 89586343, 33152171, 67040930,35696683, 63242065, 99948221, 96233367, 52593493, 98263070, 01418023,74816705, 89375940, 58405334, 96731602, 84089545, 16866794, 94737626,01673442, 70548494, 13638168, 08163691, 11106566, 64375392, 40267902,00897705, 56447313, 54532235, 94738425, 66642634, 83219544, 40546096,66924991, 20592606, 96037590, 73434467, 70896866, 91025618, 57892091,08487641, 32500082, 84412833, 23311447, 38380409, 79957822, 72971538,69645784, 91863314, 73099909, 93209260, 83461794, 81378487, 30423273,22233715, 32232841, 26716521, 03511221, 29196547, 58263562, 56233305,52547525, 55812835, 87253244, 52484232, 80837360, 94098464, 52028151,53267501, 66381929, 84381316, 59788467, 09683688, 67082008, 71605255,80654064, 21434307, 45286643, 76556656, 82465821, 57367208, 79218980,48460468, 59170479, 46046391, 43043164, 96544490, 83340521, 70837892, 18926791, 40818286, 28936302, 11489524, 51031183, 73860337, 13241219,09025448, 10718828, 76360986, 26031606, 76558053, 97726139, 46473415, 48406387, 23625539, 86756012, 35164187, 49161302, 78082834, 35072237,08602486, 29815841, 56562216, 77684187, 81751704, 20160464, 50407962, 27786415, 19893526, 00934129, 37759498, 52636463, 25666982, 43262852, 38393436, 02581136, 29323250, 56950657, 05898131, 95286262, 75574581,54057961, 06703896, 90758589, 57782642, 34492535, 41919697, 06395464, 10993500, 81212949, 34017532, 69569396, 99009936, 57129610, 67401593,71044018, 62076698, 29533873, 71936325, 86874388, 26545032, 35695544, 30433724, 53127345, 72887083, 25390873, 63711546, 06923746, 27783723,33199575, 35929698, 16491251, 18276792, 62744775, 92096155, 06336570, 56141974, 73007273, 31416832, 00171057, 64176982, 46938647, 58460388,69972026, 73724304, 27435484, 51568616, 15531822, 47788699, 11818851, 41594694, 83561325, 43107163, 56965375, 10557343, 26118061, 74650126, 90076467, 10657376, 49901436, 03425162, 61164599, 15797769, 05427896,14444084, 36795868, 18079449, 59653393, 72942548, 06763077, 33895610, 94892653, 12085268, 65174140, 79567366, 23020126, 74290047, 13498869, 21696323, 27724594, 54941003, 38229841, 07050068, "
C = "13404901, 39952424, 47847739, 94939581, 13809950, 70966043, 11161555, 17102313, 47079425, 50682833, 74154313, 61562613, 93200452, 37103342,18479435, 32502597, 36198035, 54210010, 73191775, 48358178, 85544503, 05996766, 54651623, 52113220, 27465181, 23871783, 22496415, 54107041, 65899605, 56528700, 82671109, 61176034, 42374678, 51612628, 63329997, 56591652, 04552733, 12789324, 89586343, 51935014, 38611966, 43916409, 70996050, 98263070, 01418023, 65345049, 21734275, 76846198, 71506230, 00833171, 67128139, 41367555, 64769510, 44010700, 16475199, 93164325, 09386162, 95324041, 80688223, 67629139, 79552617, 76219736, 50368644, 45096021, 54972488, 63779011, 28862942, 73145521, 74078605, 66924991, 12806850, 02171001, 70896866, 73434467, 08487641, 44415025, 32500082, 84412833, 83896188, 52243759, 49191410, 38744339, 48079796, 44937032,06267501, 81866886, 38575984, 25978688, 78974338, 41247821, 12356966,64842303, 79127158, 02366944, 68000570, 12426275, 96409230, 00705972,08266503, 83820884, 08831807, 43273308, 23216105, 29196547, 95160161,05553537, 52182214, 32641346, 91553427, 24436506, 77433749, 01979664,52028151, 88985343, 01761499, 76203088, 63237368, 23405334, 59788467,09683688, 67755443, 29946533, 12053603, 00437479, 15200030, 45286643,93537527, 82465821, 57367208, 53899751, 15354933, 97760830, 68933762, 80220545, 01892750, 39868288, 21524323, 69716610, 65083815, 78048499,03227391, 83340521, 87365045, 71720254, 51031183, 89168555, 08503028,37086236, 25103057, 87002524, 22808816, 80928090, 90741678, 15993372,99117082, 49938176, 21755083, 86903426, 87830263, 53959980, 75758119,59781354, 58679691, 25666982, 56307643, 47180521, 62776522, 78136608,44882734, 90758589, 08075999, 66303819, 23480347, 11580163, 87080118,18329165, 92514163, 89404632, 92377859, 03912329, 17499963, 59699979,79876366, 63894807, 37857001, 86003935, 90087123, 29433345, 80298948,61531153, 61046319, 37839841, 19421134, 48747364, 35196916, 62484573,59907079, 36845702, 21631642, 72739317, 26283700, 80114017, 76639390,29154110, 35159758, 47788699, 11818851, 56520669, 36396767, 36031167,83817428, 10657376, 90076467, 14676452, 11024560, 16327605, 76048344,14444084, 95452011, 99612346, 65172562, 84813675, 88618282, 38704390,27998014, 63859011, 33787505, 60024611, 16229880, 13899299, 35240335,29173227, 45036451, 66177893, 82658333, 43100730, 44520187, 74290047,85013538, 09926730, 27724594, 95148523, 20503000, 64390907, 26006953,98116293, 97457666, 29017396, 04634371, 70791589, "
A = A.replace(' ', '')
a = A.split(',')
B = B.replace(' ', '')
b = B.split(',')
C = C.replace(' ', '')
c = C.split(',')
repeat = []
for i in a:
if i in b and i not in c:
repeat.append(i)
long = len(repeat)
print(long)

Word analysis

''' Function： Word analysis Auto：Sherry Date：2022-02-27 19:12 '''
word=input()
a=0
b=[]
for i in word:
c=word.count(i)
if c>=a:
a=c
for j in word:
if word.count(j)==a:
b.append(j)
b.sort()
print(b[0])
print(a)

Cycle of the sum of the squares of the numbers

''' Function： Cycles of square sum of each of you Auto：Sherry Date： '''
def sp(a):
a = a.replace('', ' ')
a = a.split(' ')
return a
def fun(a):
while True:
sum = 0
for i in range(1, len(a)-1):
num = int(a[i]) ** 2
sum += num
print(sum)
if sum == 1:
break
else:
fun(a = sp(a = str(sum)))
fun(a = sp(a=input('')))

Combined number

''' Function： Combined number Auto：Sherry Date：2022-04-08 16:17 '''
count =0
for i in range(1,2021):
if i ==1:
continue
for j in range(2, i):
if i % j ==0:
count +=1
break
print(count)

Palindrome date

''' Function： Palindrome date Auto：Sherry Date：2022-02-27 20:21 '''
n = int(input())
if n >= 10000101 and n <= 89991231:
while n <= 89991231:
n +=1
n = str(n)
if n[0]==n[7] and n[1]==n[6] and n[2]==n[5] and n[3]==n[4]:
n = int(n)
print(n)
break
else:
n = int(n)
while n <= 89991231:
n +=1
n = str(n)
if n[0] == n[2] == n[5] == n[7] and n[1] == n[3] == n[4] == n[6]:
n = int(n)
print(n)
break
else:
n = int(n)

Score statistics

''' Function： Score statistics Auto：Sherry Date：2022-02-27 19:47 '''
students = input()
i = 0
list = []
while i < int(students):
i += 1
score = input()
list.append(int(score))
list1 = []
for i in range(len(list)):
if list[i] >= 60:
list1.append(list[i])
list2 = []
for i in range(len(list)):
if list[i] >= 85:
list2.append(list[i])
print("{}%".format(round(len(list1)/len(list)*100)))
print("{}%".format(round(len(list2)/len(list)*100)))

Pressure calculation

''' Function： Pressure calculation Auto：Sherry Date：2022.1.21 '''
l = [
[7],
[5, 8],
[7, 8, 8],
[9, 2, 7, 2],
[8, 1, 4, 9, 1],
[8, 1, 8, 8, 4, 1],
[7, 9, 6, 1, 4, 5, 4],
[5, 6, 5, 5, 6, 9, 5, 6],
[5, 5, 4, 7, 9, 3, 5, 5, 1],
[7, 5, 7, 9, 7, 4, 7, 3, 3, 1],
[4, 6, 4, 5, 5, 8, 8, 3, 2, 4, 3],
[1, 1, 3, 3, 1, 6, 6, 5, 5, 4, 4, 2],
[9, 9, 9, 2, 1, 9, 1, 9, 2, 9, 5, 7, 9],
[4, 3, 3, 7, 7, 9, 3, 6, 1, 3, 8, 8, 3, 7],
[3, 6, 8, 1, 5, 3, 9, 5, 8, 3, 8, 1, 8, 3, 3],
[8, 3, 2, 3, 3, 5, 5, 8, 5, 4, 2, 8, 6, 7, 6, 9],
[8, 1, 8, 1, 8, 4, 6, 2, 2, 1, 7, 9, 4, 2, 3, 3, 4],
[2, 8, 4, 2, 2, 9, 9, 2, 8, 3, 4, 9, 6, 3, 9, 4, 6, 9],
[7, 9, 7, 4, 9, 7, 6, 6, 2, 8, 9, 4, 1, 8, 1, 7, 2, 1, 6],
[9, 2, 8, 6, 4, 2, 7, 9, 5, 4, 1, 2, 5, 1, 7, 3, 9, 8, 3, 3],
[5, 2, 1, 6, 7, 9, 3, 2, 8, 9, 5, 5, 6, 6, 6, 2, 1, 8, 7, 9, 9],
[6, 7, 1, 8, 8, 7, 5, 3, 6, 5, 4, 7, 3, 4, 6, 7, 8, 1, 3, 2, 7, 4],
[2, 2, 6, 3, 5, 3, 4, 9, 2, 4, 5, 7, 6, 6, 3, 2, 7, 2, 4, 8, 5, 5, 4],
[7, 4, 4, 5, 8, 3, 3, 8, 1, 8, 6, 3, 2, 1, 6, 2, 6, 4, 6, 3, 8, 2, 9, 6],
[1, 2, 4, 1, 3, 3, 5, 3, 4, 9, 6, 3, 8, 6, 5, 9, 1, 5, 3, 2, 6, 8, 8, 5, 3],
[2, 2, 7, 9, 3, 3, 2, 8, 6, 9, 8, 4, 4, 9, 5, 8, 2, 6, 3, 4, 8, 4, 9, 3, 8, 8],
[7, 7, 7, 9, 7, 5, 2, 7, 9, 2, 5, 1, 9, 2, 6, 5, 3, 9, 3, 5, 7, 3, 5, 4, 2, 8, 9],
[7, 7, 6, 6, 8, 7, 5, 5, 8, 2, 4, 7, 7, 4, 7, 2, 6, 9, 2, 1, 8, 2, 9, 8, 5, 7, 3, 6],
[5, 9, 4, 5, 5, 7, 5, 5, 6, 3, 5, 3, 9, 5, 8, 9, 5, 4, 1, 2, 6, 1, 4, 3, 5, 3, 2, 4, 1],
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]
for i in range(1, len(l)):
for j in range(i + 1):
if j == 0:
l[i][j] = l[i][j] + l[i - 1][0] / 2
elif j == i:
l[i][j] = l[i][j] + l[i - 1][j - 1] / 2
else:
l[i][j] = l[i][j] + l[i - 1][j - 1] / 2 + l[i - 1][j] / 2
print(sorted(l[29]))
''' sorted(iterable, key=None, reverse=False) *iterable: Objects that can be iterated *key: Elements for sorting , Can be specified by function *reverse: Sort rule ,reverse = True Descending , reverse = False Ascending （ Default '''

Split calculation

''' Function： Split calculation Auto：Sherry Date：2022-04-08 13:50 '''
count = 0
for i in range(1,2021):
word = str(i)
for j in word:
if int(j) == 2:
count += 1
print(count)

Operate the second-order magic cube

''' Function： Operate the second-order magic cube Auto：Sherry Date：2022.1.15 Test： cube[0][0][0] = [' Blue ', ' Orange ', ' white '] cube[0][0][1] = [' Blue ', ' Red ', ' white '] cube[0][1][0] = [' green ', ' Orange ', ' white '] cube[0][1][1] = [' green ', ' Red ', ' white '] cube[1][0][0] = [' Blue ', ' Orange ', ' yellow '] cube[1][0][1] = [' Blue ', ' Red ', ' yellow '] cube[1][1][0] = [' green ', ' Orange ', ' yellow '] cube[1][1][1] = [' green ', ' Red ', ' yellow '] '''
cube = [[' Blue ', ' Orange ', ' white '],
[' Blue ', ' Red ', ' white '],
[' green ', ' Orange ', ' white '],
[' green ', ' Red ', ' white '],
[' Blue ', ' Orange ', ' yellow '],
[' Blue ', ' Red ', ' yellow '],
[' green ', ' Orange ', ' yellow '],
[' green ', ' Red ', ' yellow ']
]
print(' The initial color is ：', end='')
for i in range(len(cube[3])):
print(cube[3][i], end='')
print()
choose = input(' Please enter the rotation according to ：')
for i in choose:
if i == 'x':
a = cube[3][0]
b = cube[3][1]
c = cube[3][2]
cube[3][0] = cube[2][0]
cube[3][1] = cube[2][2]
cube[3][2] = cube[2][1]
cube[2][0] = cube[6][0]
cube[2][1] = cube[6][2]
cube[2][2] = cube[6][1]
cube[6][0] = cube[7][0]
cube[6][1] = cube[7][2]
cube[6][2] = cube[7][1]
cube[7][0] = a
cube[7][1] = c
cube[7][2] = b
if i == 'y':
a = cube[3][0]
b = cube[3][1]
c = cube[3][2]
cube[3][0] = cube[7][2]
cube[3][1] = cube[7][1]
cube[3][2] = cube[7][0]
cube[7][0] = cube[5][2]
cube[7][1] = cube[5][1]
cube[7][2] = cube[5][0]
cube[5][0] = cube[1][2]
cube[5][1] = cube[1][1]
cube[5][2] = cube[1][0]
cube[1][0] = c
cube[1][1] = b
cube[1][2] = a
if i == 'z':
a = cube[3][0]
b = cube[3][1]
c = cube[3][2]
cube[3][0] = cube[2][1]
cube[3][1] = cube[2][0]
cube[3][2] = cube[2][2]
cube[2][0] = cube[0][1]
cube[2][1] = cube[0][0]
cube[2][2] = cube[0][2]
cube[0][0] = cube[1][1]
cube[0][1] = cube[1][0]
cube[0][2] = cube[1][2]
cube[1][0] = b
cube[1][1] = a
cube[1][2] = c
for i in range(len(cube[3])):
print(cube[3][i], end='')

seek 100！ How many positive divisors are there in

''' Function： seek 100！ How many positive divisors are there in Auto：Sherry Date：2022-04-08 16:25 '''
def fun(n):
sum = 1 # Give a factorial container 
for i in range(1, n + 1):
sum *= i
print(sum)
return sum
n = fun(100)
list = []
while n not in range(n): # Ensure that a prime factor is output, and then continue to cycle the output prime factor 
for j in range(2, n + 1):
if n % j == 0:
n = int(n / j) # It's written here n /= j I will make a mistake ,
# Because in the second cycle, division puts n Becomes a floating point number 
if n == 1: # Here's the output 1
print(j)
else: # j It must be prime 
list.append(j)
print('{} *'.format(j), end=' ')
print(len(list))
break

Formula 900

''' Function： Formula 900 Auto：Sherry Date：2022.1.16 '''
for a in range(10):
if a == 0:
continue
else:
for s in range(10):
if s == a:
continue
else:
for d in range(10):
if a == d or s==d:
continue
else:
for f in range(10):
if f == a or f == s or f ==d:
continue
else:
for g in range(10):
if g == 0 or g==a or g==s or g==d or g==f:
continue
else:
for h in range(10):
if h ==a or h == s or h==d or h==f or h==g:
continue
else:
for j in range(10):
if j ==a or j==s or j==d or j==f or j==g or j==h:
continue
else:
for k in range(10):
if k==a or k==s or k==d or k==f or k==g or k==h or k==j:
continue
else:
for l in range(10):
if l ==0 or l==a or l==s or l==d or l==f or l==g or l==h or l==j or l==k:
continue
else:
for i in range(10):
if i==a or i==s or i==d or i==f or i==g or i==h or i==j or i==k or i==l:
continue
elif ((a*1000+s*100+d*10+f)-(g*1000+h*100+j*10+k))*(l*10+i)==900:
print("({}{}{}{}-{}{}{}{})*{}{}=900" .format(a,s,d,f,g,h,j,k,l,i))

Calculate the snake's length

''' Function： Calculate the snake's length Auto：Sherry Date：2022.1.16 '''
snack = ''' +-------------------------------------------------+ | | | H###### #### | | # # # | | # # # | | # #### # # | | # # # # # | | ######@### # # | | # #### # # | | # # # # # | | ####@#######@### # # | | # # # # # | | T ##### # # # ## | | # # ### ### ## | | ################ # # #### | | # # # # | | ############## #######@########## | | # ### | | ########################### | +-------------------------------------------------+ '''
count1 = 0
count2 = 0
for i in snack:
if i == '#':
count1 += 1
elif i == '@':
count2 += 1
long = count2 * 2 + count1 + 2
print(long)

House number making

''' Function： House number making Auto：Sherry Date：2022-02-28 15:03 '''
num = 0
for i in range(1,2021):
i = str(i)
for j in range(len(i)):
if i[j] == "2":
num += 1
print(num)

Digital sorting

''' function ： Digital sorting author ：Sherry Time ：2022.6.21 n = int(input()) m = int(input()) l = [] for i in range(1, n+1): l.append(str(i)) print(l) l = sorted(l, # Yes l Sort the list key=lambda x: sum( # This call key Keyword and use lambda function x Indicates the value inside ,sum Means to sum the values map(int, x) # facilitate x And back to x The shaping state of )) print(l[m-1])e '''
def fun_sum(num):
sum = 0# Initialization and 
while num != 0: # If not for 0 Then continue to the next step 
sum += num % 10 # Difference summation 
num = int(num / 10)# Divide the sum by 10 And round it down 
return sum # Return the numbers and 
# Receive variables 
num = int(input())
index = int(input())
# Create a list to sort 
nums = [i for i in range(1, num + 1)]
# Establish the number of cycles according to the received variables 
for i in range(num):
# Create a loop to compare sizes 
for j in range(num - 1 - i):
# To determine the size 
if fun_sum(nums[j]) > fun_sum(nums[j + 1]):
# Here is the same as before n To act as a container to replace the values before and after the list 
n = nums[j]
nums[j] = nums[j + 1]
nums[j + 1] = n
# Output the required value 
print(nums[index - 1])

Fibonacci sequence summation

''' function ： Produce fiboracci series author ：Sherry Time ：2022.6.21 '''
list = [1, 1]# Here we create the first two 
sum = 0# Output sum 
n = int(input())# Let the user enter how many items 
for i in range(n):
j = list[i] + list[i + 1] # Calculate the value of the next item 
list.append(j)# Put the value of the next item in list
for i in range(len(list)-2):# Because I gave the first two items at the beginning, so in this range -2
sum += list[i] # Before calculation n Xiang He 
print(sum) # Before output n Xiang He 

Rose number

# function ： Output the number of roses 
# author ：Sherry
#2022-6-21
# Type the value 
Num = 1000
while Num in range(1000, 10000):# Establish a cycle 
x1 = Num % 10 # Put forward the last 
x2 = Num // 10 % 10 # Put forward the penultimate And so on 
x3 = Num // 100 % 10
x4 = Num // 1000
Num_sum = x1 ** 4 + x2 ** 4 + x3 ** 4 + x4 ** 4 # Calculate the sum of the fourth power of each digit 
# Compare 
if Num == Num_sum:
# If the same, output Otherwise, just skip 
print('{} = {} ^ 4 + {} ^ 4 + {} ^ 4 + {} ^ 4'.format(Num, x4, x3, x2, x1))
# cycles num+1
Num += 1

Calculate paper size

''' function ： Calculate paper size author ：Sherry Time ：2022.6.21 '''
# Create a list to judge whether the input is qualified 
list = ["A0", "A1", "A2", "A3", "A4", "A5", "A6", "A7", "A8", "A9"]
cc = input()# Create the input 
a = 1189 # Initial length 
b = 841 # Initial width 
# Determine whether the input is correct 
if cc not in list:
# If not rerun , There are no times or dead cycles 
print(" Size input error ")
else:
# Take out the numbers first --- That is, the number of cycles 
n = int(cc[1])
# Establish a cycle , The number of times is determined by the number in the input 
for i in range(n):
# Judge the long side and the short side And half and half Use int Use rounding down because of consumption 
if a > b:
a = int(a/2)
else:
b = int(b/2)
# This is done here to make the long side output on it all the time , So I used a c To act as a container and transform a , b value 
if a<b:
c = a
a = b
b = c
print(a)
print(b)