From a4242fc667e602ae532d8c0c6ff628e13aca0112 Mon Sep 17 00:00:00 2001 From: muhammed Date: Thu, 30 Sep 2021 19:50:16 +0200 Subject: [PATCH 1/5] Answers of week 3. homework --- week3.py | 67 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 67 insertions(+) create mode 100644 week3.py diff --git a/week3.py b/week3.py new file mode 100644 index 0000000..511e8c6 --- /dev/null +++ b/week3.py @@ -0,0 +1,67 @@ +## 1-perfect_number.py +''' +def perfect (): + perfectlist=[] + for i in range (1,1000): + sum=0 + for j in range (1,i): + if i%j==0: + sum +=j # sum all divisor + if sum == i: # if sum of divisor equal to number it means number is perfect + perfectlist.append(i) + return print(perfectlist) +print(perfect()) + + +## 2-reading_number.py + +def read (): + number = int(input("please enter a number:")) + ones=["", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"] + tens=["", "teen", "twenty", "thirty", "fourty", "fifty", "sixty", "seventy", "eighty", "ninety"] + one = number%10 # we find ones digit + ten = number//10 #we find tens digit + if ten == 1 and one == 1: # for 11 + return print("eleven") + elif ten ==1 and one == 2: # for 12 + return print("twelve") + elif ten ==1 and one == 3: # for 13 + return print("thirteen") + elif ten==1 and one != 1 and one !=2 and one != 3: # without 10+(1, 2, 3) ; 14,15... + return print(ones[one], "teen") + else: + return print(tens[ten], ones[one]) # write without {} + teen. it is 20,21,22,... +print(read()) + +## 3-alphabetical_order.py + +def words (): + x, y, z, w = input("please enter four word:").split("-") + list=[x, y, z, w] + list.sort() + for i in list: + print(i,end="-") +print(words()) + + + +## 4-unique_list.py +# Write a function that filters all the unique(unrepeated) elements of a given list. +def unique_list(test_list): + res = [] + [res.append(x) for x in test_list if x not in res] + return res +print (unique_list([1, 1, 1, 2, 2, 3, 3])) + + +## 5-equal_reverse.py +def isPalindrome(s): + return s == s[::-1] +s = input("enter a word :") +ans = isPalindrome(s) +if ans: + print("true") +else: + print("false") + +''' From ae2b1bbf668261f8765935db361524ff8ef49d7b Mon Sep 17 00:00:00 2001 From: muhammedkoclu <79097010+muhammedkoclu@users.noreply.github.com> Date: Thu, 30 Sep 2021 21:15:12 +0200 Subject: [PATCH 2/5] Update week3.py --- week3.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/week3.py b/week3.py index 511e8c6..aff6df7 100644 --- a/week3.py +++ b/week3.py @@ -1,5 +1,5 @@ ## 1-perfect_number.py -''' + def perfect (): perfectlist=[] for i in range (1,1000): @@ -64,4 +64,4 @@ def isPalindrome(s): else: print("false") -''' + From 9fc6bd1d3bb3ff14e1aff7019358619ee2a433e1 Mon Sep 17 00:00:00 2001 From: muhammed Date: Thu, 30 Sep 2021 21:36:26 +0200 Subject: [PATCH 3/5] solution week3 --- alphabetical_order.py | 0 equal_reverse.py | 0 perfect_number.py | 0 reading_number.py | 19 ++++++++++++ unique_list.py | 0 week3.py | 67 ------------------------------------------- 6 files changed, 19 insertions(+), 67 deletions(-) create mode 100644 alphabetical_order.py create mode 100644 equal_reverse.py create mode 100644 perfect_number.py create mode 100644 reading_number.py create mode 100644 unique_list.py delete mode 100644 week3.py diff --git a/alphabetical_order.py b/alphabetical_order.py new file mode 100644 index 0000000..e69de29 diff --git a/equal_reverse.py b/equal_reverse.py new file mode 100644 index 0000000..e69de29 diff --git a/perfect_number.py b/perfect_number.py new file mode 100644 index 0000000..e69de29 diff --git a/reading_number.py b/reading_number.py new file mode 100644 index 0000000..3e8f957 --- /dev/null +++ b/reading_number.py @@ -0,0 +1,19 @@ +##2-reading_number.py + +def read (): + number = int(input("please enter a number:")) + ones=["", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"] + tens=["", "teen", "twenty", "thirty", "fourty", "fifty", "sixty", "seventy", "eighty", "ninety"] + one = number%10 # we find ones digit + ten = number//10 #we find tens digit + if ten == 1 and one == 1: # for 11 + return print("eleven") + elif ten ==1 and one == 2: # for 12 + return print("twelve") + elif ten ==1 and one == 3: # for 13 + return print("thirteen") + elif ten==1 and one != 1 and one !=2 and one != 3: # without 10+(1, 2, 3) ; 14,15... + return print(ones[one], "teen") + else: + return print(tens[ten], ones[one]) # write without {} + teen. it is 20,21,22,... +print(read()) diff --git a/unique_list.py b/unique_list.py new file mode 100644 index 0000000..e69de29 diff --git a/week3.py b/week3.py deleted file mode 100644 index 511e8c6..0000000 --- a/week3.py +++ /dev/null @@ -1,67 +0,0 @@ -## 1-perfect_number.py -''' -def perfect (): - perfectlist=[] - for i in range (1,1000): - sum=0 - for j in range (1,i): - if i%j==0: - sum +=j # sum all divisor - if sum == i: # if sum of divisor equal to number it means number is perfect - perfectlist.append(i) - return print(perfectlist) -print(perfect()) - - -## 2-reading_number.py - -def read (): - number = int(input("please enter a number:")) - ones=["", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"] - tens=["", "teen", "twenty", "thirty", "fourty", "fifty", "sixty", "seventy", "eighty", "ninety"] - one = number%10 # we find ones digit - ten = number//10 #we find tens digit - if ten == 1 and one == 1: # for 11 - return print("eleven") - elif ten ==1 and one == 2: # for 12 - return print("twelve") - elif ten ==1 and one == 3: # for 13 - return print("thirteen") - elif ten==1 and one != 1 and one !=2 and one != 3: # without 10+(1, 2, 3) ; 14,15... - return print(ones[one], "teen") - else: - return print(tens[ten], ones[one]) # write without {} + teen. it is 20,21,22,... -print(read()) - -## 3-alphabetical_order.py - -def words (): - x, y, z, w = input("please enter four word:").split("-") - list=[x, y, z, w] - list.sort() - for i in list: - print(i,end="-") -print(words()) - - - -## 4-unique_list.py -# Write a function that filters all the unique(unrepeated) elements of a given list. -def unique_list(test_list): - res = [] - [res.append(x) for x in test_list if x not in res] - return res -print (unique_list([1, 1, 1, 2, 2, 3, 3])) - - -## 5-equal_reverse.py -def isPalindrome(s): - return s == s[::-1] -s = input("enter a word :") -ans = isPalindrome(s) -if ans: - print("true") -else: - print("false") - -''' From b38ea48c50a23a29bd457dce6f9530d00423e17f Mon Sep 17 00:00:00 2001 From: muhammed Date: Thu, 30 Sep 2021 21:48:08 +0200 Subject: [PATCH 4/5] solutions of week3 --- unique_list.py | 7 +++++++ 1 file changed, 7 insertions(+) diff --git a/unique_list.py b/unique_list.py index e69de29..879c09e 100644 --- a/unique_list.py +++ b/unique_list.py @@ -0,0 +1,7 @@ +## 4-unique_list.py +# Write a function that filters all the unique(unrepeated) elements of a given list. +def unique_list(test_list): + res = [] + [res.append(x) for x in test_list if x not in res] + return res +print (unique_list([1, 1, 1, 2, 2, 3, 3])) From 75d031767b054de5a06042617dcdfcf7d8a9e851 Mon Sep 17 00:00:00 2001 From: muhammedkoclu <79097010+muhammedkoclu@users.noreply.github.com> Date: Fri, 1 Oct 2021 18:35:59 +0200 Subject: [PATCH 5/5] week_3 --- alphabetical_order.py | 9 +++++++++ equal_reverse.py | 10 ++++++++++ perfect_number.py | 13 +++++++++++++ reading_number.py | 38 +++++++++++++++++++------------------- unique_list.py | 15 ++++++++------- 5 files changed, 59 insertions(+), 26 deletions(-) diff --git a/alphabetical_order.py b/alphabetical_order.py index e69de29..3fb4555 100644 --- a/alphabetical_order.py +++ b/alphabetical_order.py @@ -0,0 +1,9 @@ +##3-alphabetical_order.py + +def words (): + x, y, z, w = input("please enter four word:").split("-") + list=[x, y, z, w] + list.sort() + for i in list: + print(i,end="-") +print(words()) \ No newline at end of file diff --git a/equal_reverse.py b/equal_reverse.py index e69de29..1e55dbd 100644 --- a/equal_reverse.py +++ b/equal_reverse.py @@ -0,0 +1,10 @@ +##5-equal_reverse.py + +def isPalindrome(s): + return s == s[::-1] +s = input("enter a word :") +ans = isPalindrome(s) +if ans: + print("true") +else: + print("false") \ No newline at end of file diff --git a/perfect_number.py b/perfect_number.py index e69de29..c1bb43e 100644 --- a/perfect_number.py +++ b/perfect_number.py @@ -0,0 +1,13 @@ +##1-perfect_number.py + +def perfect (): + perfectlist=[] + for i in range (1,1000): + sum=0 + for j in range (1,i): + if i%j==0: + sum +=j # sum all divisor + if sum == i: # if sum of divisor equal to number it means number is perfect + perfectlist.append(i) + return print(perfectlist) +print(perfect()) \ No newline at end of file diff --git a/reading_number.py b/reading_number.py index 3e8f957..eb2d41a 100644 --- a/reading_number.py +++ b/reading_number.py @@ -1,19 +1,19 @@ -##2-reading_number.py - -def read (): - number = int(input("please enter a number:")) - ones=["", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"] - tens=["", "teen", "twenty", "thirty", "fourty", "fifty", "sixty", "seventy", "eighty", "ninety"] - one = number%10 # we find ones digit - ten = number//10 #we find tens digit - if ten == 1 and one == 1: # for 11 - return print("eleven") - elif ten ==1 and one == 2: # for 12 - return print("twelve") - elif ten ==1 and one == 3: # for 13 - return print("thirteen") - elif ten==1 and one != 1 and one !=2 and one != 3: # without 10+(1, 2, 3) ; 14,15... - return print(ones[one], "teen") - else: - return print(tens[ten], ones[one]) # write without {} + teen. it is 20,21,22,... -print(read()) +##2-reading_number.py + +def read (): + number = int(input("please enter a number:")) + ones=["", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"] + tens=["", "teen", "twenty", "thirty", "fourty", "fifty", "sixty", "seventy", "eighty", "ninety"] + one = number%10 # we find ones digit + ten = number//10 #we find tens digit + if ten == 1 and one == 1: # for 11 + return print("eleven") + elif ten ==1 and one == 2: # for 12 + return print("twelve") + elif ten ==1 and one == 3: # for 13 + return print("thirteen") + elif ten==1 and one != 1 and one !=2 and one != 3: # without 10+(1, 2, 3) ; 14,15... + return print(ones[one], "teen") + else: + return print(tens[ten], ones[one]) # write without {} + teen. it is 20,21,22,... +print(read()) \ No newline at end of file diff --git a/unique_list.py b/unique_list.py index 879c09e..7298507 100644 --- a/unique_list.py +++ b/unique_list.py @@ -1,7 +1,8 @@ -## 4-unique_list.py -# Write a function that filters all the unique(unrepeated) elements of a given list. -def unique_list(test_list): - res = [] - [res.append(x) for x in test_list if x not in res] - return res -print (unique_list([1, 1, 1, 2, 2, 3, 3])) +##4-unique_list.py +# Write a function that filters all the unique(unrepeated) elements of a given list. + +def unique_list(test_list): + res = [] + [res.append(x) for x in test_list if x not in res] + return res +print (unique_list([1, 1, 1, 2, 2, 3, 3])) \ No newline at end of file