-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathmain.py
More file actions
218 lines (180 loc) · 6.05 KB
/
main.py
File metadata and controls
218 lines (180 loc) · 6.05 KB
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
from typing import Any, Callable
# Finding most frequent list index
# Start
def most_frequent_number_1():
numbers = [1, 3, 7, 4, 3, 0, 3, 6, 3]
copy_of_numbers = numbers # holding numbers in copy
numbers.sort()
sorted_value = []
# taking frequency number and value in list
# and deleting calculated values in array
sorted_value.append([numbers.count(numbers[0]), numbers[0]])
del numbers[:numbers.count(numbers[0])]
sorted_value.append([numbers.count(numbers[0]), numbers[0]])
del numbers[:numbers.count(numbers[0])]
sorted_value.append([numbers.count(numbers[0]), numbers[0]])
del numbers[:numbers.count(numbers[0])]
sorted_value.append([numbers.count(numbers[0]), numbers[0]])
del numbers[:numbers.count(numbers[0])]
sorted_value.append([numbers.count(numbers[0]), numbers[0]])
del numbers[:numbers.count(numbers[0])]
sorted_value.append([numbers.count(numbers[0]), numbers[0]])
del numbers[:numbers.count(numbers[0])], numbers
max_freq = max(sorted_value)
print(f"the most frequent number is {max_freq[1]} and it was {max_freq[0]} times repeated")
def most_frequent_number_2(lst: list):
lst.sort()
sorted_value = []
for item in range(0, len(lst)):
sorted_value.append([lst.count(lst[0]), lst[0]])
del lst[:lst.count(lst[0])]
if len(lst) == item + 1:
max_freq = max(sorted_value)
return f"the most frequent number is {max_freq[1]} and it was {max_freq[0]} times repeated"
# print(most_frequent_number_2([1, 3, 7, 4, 3, 0, 3, 6, 3]))
def most_frequent_number_3():
numbers = [1, 3, 7, 4, 3, 0, 3, 6, 3]
print(f"the most frequent number is {max(numbers, key=numbers.count)} and "
f"it was {numbers.count(max(numbers, key=numbers.count))} times repeated")
# End
# Comfortable Word
# Start
def comfortable_word():
word = set(input('Enter a word(it can contain Turkish words too) :'))
left_hand_words, right_hand_words = set('qazwsxedcrfvtgb'), set('yhnujmıköolçpşğiü')
# print("sağ el kelimesi: ", word - left_hand_words)
# print("sol el kelimesi: ", word - right_hand_words)
print((word - left_hand_words != set()) and (word - right_hand_words != set()))
# End
# Password Reminder
# Start
def pass_reminder():
name = input('Please enter your name :')
if name == 'ahmet':
print(f"Hello, {name}! The password is : W@12")
else:
print(f"Hello, {name}! See you later.")
# End
# Covid-19 Risk
# Start
def covid_risk():
age = input("Are you a cigarette addict older than 75 years old?").strip().lower() == "yes"
chronic = input("Do you have a severe chronic disease?").strip().lower() == "yes"
immune = input("Is your immune system too weak?").strip().lower() == "yes"
# print(f"age: {age} , chronic: {chronic}, immune: {immune}")
print(["You are in risky group" if (age or chronic or immune) else "You are not in risky group"])
# End
# Is it an Armstrong Number?
# Start
def Armstrong_Number():
number = input("Enter a number : ")
# print(number, type(number), number.isdigit())
if not number.isdigit():
print("It is an invalid entry. Don't use non-numeric, float, or negative values!")
else:
num = list(map(int, number))
lst = [i**len(num) for i in num]
if sum(lst) == int(number):
is_Armstrong = f"{number} is an Armstrong number"
else:
is_Armstrong = f"{number} is not an Armstrong number"
print(is_Armstrong)
# End
# Prime number
# Start
def Prime_number():
num = int(input("Enter a number: "))
flag = False
if num > 1:
for i in range(2, num):
if (num % i) == 0:
flag = True
break
if flag:
print(num, "is not a prime number")
else:
print(num, "is a prime number")
# End
# Fibonacci Numbers
# Start
fib_num = input("Enter a number : ").strip()
while True:
if not fib_num.isdigit():
fib_num = input("Invalid Entrance, Try Again : ").strip()
else:
fib_num = int(fib_num)
break
def fib(x):
""" This function keeps fibonacci numbers from zero to given."""
fib_list, num, flag = [], 2, True
while flag:
if fib_num == 0 or fib_num == 1:
"" if 0 == fib_num else fib_list.extend([fib_num])
flag = False
elif fib_num >= num:
fib_list.extend([0, 1]) if len(fib_list) < 2 else ""
fib_value = (fib_list[-1] + fib_list[-2])
fib_list.append(fib_value)
num = fib_value
else:
fib_list.remove(fib_list[0])
fib_list.remove(fib_list[-1]) if fib_list[-1] > fib_num else ""
break
return fib_list
# print(fib.__doc__, '\n', fib(fib_num))
# End
# All Prime Numbers in Interval
# Start
def prime(*, num2=100, lst4=None):
""" This program finds Prime numbers from 2 to 100 """
if isinstance(lst4, type(None)):
lst4 = []
for i in range(2, num2+1):
for j in range(2, i):
if (i % j) == 0:
break
else:
lst4.append(i)
return lst4
# print(prime(), '\n', prime.__doc__)
# End
# FizzBuzz
# Start
def FizzBuzz():
for i in range(1, 101):
if not i % 15:
print("FizzBuzz")
elif i % 5 == 0:
print("Buzz")
elif i % 3 == 0:
print("Fizz")
else:
print(i)
# End
# Letter Count
# Start
def letter_count(sentence="This sentence will be example."):
ls = list(sentence)
dic = {}
for i in ls:
if i not in dic:
dic[i] = 1
else:
dic[i] += 1
return dic
# user = input("Enter a sentence : ")
# print(letter_count(user))
# End
if __name__ == "__main__":
most_frequent_number_1()
print(most_frequent_number_2([1, 3, 7, 4, 3, 0, 3, 6, 3]))
most_frequent_number_3()
comfortable_word()
pass_reminder()
covid_risk()
Armstrong_Number()
Prime_number()
print(fib.__doc__, '\n', fib(fib_num))
print(prime(), '\n', prime.__doc__)
FizzBuzz()
print(letter_count())