diff --git a/1-perfect_number.py b/1-perfect_number.py new file mode 100644 index 0000000..6e48e00 --- /dev/null +++ b/1-perfect_number.py @@ -0,0 +1,14 @@ +from functools import reduce +def fun(a): + global list1 + list1=[] + for i in range(1,a): + toplama= 0 + for j in range(1,i): + if i%j==0: + toplama+=j + if toplama == i: + list1.append(toplama) + return list1 +print(fun(10000)) +print(reduce(lambda x,y:x+y,list1)) diff --git a/2-reading_number.py b/2-reading_number.py new file mode 100644 index 0000000..420e57c --- /dev/null +++ b/2-reading_number.py @@ -0,0 +1,15 @@ +zero_19 = {0:"zero ", 1:"one", 2:"two", 3:"three", 4:"four", 5:"five", 6:"six", 7:"seven", + 8:"eight", 9:"nine", 10:"ten", 11:"eleven", 12:"twelve", 13:"thirteen", + 14:"fourteen", 15:"fifteen", 16:"sixteen", 17:"seventeen", 18:"eighteen", 19:"nineteen" }; +twinty_100 = {2:"twenty", 3:"thirty", 4:"forty", 5:"fifty", 6:"sixty", 7:"seventy", 8:"eighty", 9:"ninety",} + +def change(x=int(input('bir sayi girin:'))): + y=list(map(int, str(x))) + if 0<=x<20: + print(zero_19[x]) + elif 20<=x<100 and x%10!=0: + y=list(map(int, str(x))) + print(twinty_100[y[0]],zero_19[y[1]],sep=' ') + else: + print(twinty_100[y[0]]) +change() \ No newline at end of file diff --git a/3-alphabetical_order.py b/3-alphabetical_order.py new file mode 100644 index 0000000..b1bc599 --- /dev/null +++ b/3-alphabetical_order.py @@ -0,0 +1,4 @@ +def sirala(): + list1 = map(str, input().split('-')) + print("-".join(i for i in sorted(list1))) +sirala() \ No newline at end of file diff --git a/4-unique_list.py b/4-unique_list.py new file mode 100644 index 0000000..e08bacf --- /dev/null +++ b/4-unique_list.py @@ -0,0 +1,14 @@ +#1 +def fun_uniq(x): + print(set(x)) +unique_list= [1,2,3,3,3,3,4,5,5] +fun_uniq(unique_list) + +#2 +def uniq(n): + unique= [] + for i in n: + if i not in unique: + unique.append(i) + return unique +print(uniq([1,2,3,3,3,3,4,5,5])) \ No newline at end of file diff --git a/5-equal_reverse.py b/5-equal_reverse.py new file mode 100644 index 0000000..7ee55dc --- /dev/null +++ b/5-equal_reverse.py @@ -0,0 +1,10 @@ +def reverse_ctrl(): + x = map(str, input().split(",")) + reverse_list=[] + for i in x: + if i == i[::-1]: + reverse_list.append('True') + else: + reverse_list.append('false') + return reverse_list +print(",".join(i for i in reverse_ctrl())) \ No newline at end of file diff --git a/hakkerrank_1_week3.py b/hakkerrank_1_week3.py new file mode 100644 index 0000000..1c88703 --- /dev/null +++ b/hakkerrank_1_week3.py @@ -0,0 +1,36 @@ +#!/bin/python3 + +import math +import os +import random +import re +import sys + +# +# Complete the 'findDigits' function below. +# +# The function is expected to return an INTEGER. +# The function accepts INTEGER n as parameter. +# + +def findDigits(n): + x=0 + for i in list(map(int,str(n))): + if i!=0: + if n%i == 0: + x+=1 + return x + +if __name__ == '__main__': + fptr = open(os.environ['OUTPUT_PATH'], 'w') + + t = int(input().strip()) + + for t_itr in range(t): + n = int(input().strip()) + + result = findDigits(n) + + fptr.write(str(result) + '\n') + + fptr.close() diff --git a/hakkerrank_2_week3.py b/hakkerrank_2_week3.py new file mode 100644 index 0000000..659af11 --- /dev/null +++ b/hakkerrank_2_week3.py @@ -0,0 +1,25 @@ +#!/bin/python3 + +import math +import os +import random +import re +import sys + +# Complete the solve function below. +def solve(s): + lijst=[] + for i in s.split(' '): + lijst.append(i.capitalize()) + return ' '.join(x for x in lijst) + +if __name__ == '__main__': + fptr = open(os.environ['OUTPUT_PATH'], 'w') + + s = input() + + result = solve(s) + + fptr.write(result + '\n') + + fptr.close()