|
|
@@ -11,7 +11,7 @@ def solution(string):
|
|
|
|
|
|
# ------------------------------------------------------------------------------- #
|
|
|
|
|
|
-
|
|
|
+# Убирает все повторяющиеся буквы.
|
|
|
def unique_in_order(iterable):
|
|
|
s = set(iterable)
|
|
|
l = []
|
|
|
@@ -22,7 +22,59 @@ def unique_in_order(iterable):
|
|
|
|
|
|
return l
|
|
|
|
|
|
+#print(unique_in_order("qwereteyty"))
|
|
|
+
|
|
|
+
|
|
|
+# ------------------------------------------------------------------------------- #
|
|
|
+# Вывод суммы чисел в двоичном виде без символо '0b'
|
|
|
+
|
|
|
+def add_binary(a,b):
|
|
|
+ return bin(a + b)[2:]
|
|
|
|
|
|
+'''
|
|
|
+# Интересное решение
|
|
|
+def add_binary(a,b):
|
|
|
+ return f"{a + b:b}"
|
|
|
+'''
|
|
|
+
|
|
|
+
|
|
|
+#print(add_binary(1, 1))
|
|
|
+
|
|
|
+# ------------------------------------------------------------------------------- #
|
|
|
+'''
|
|
|
+def find_smallest_int(arr):
|
|
|
+ min = arr[0]
|
|
|
+ for i in arr:
|
|
|
+ if i < min:
|
|
|
+ min = i
|
|
|
+ return min
|
|
|
+'''
|
|
|
+
|
|
|
+def find_smallest_int(arr):
|
|
|
+ return min(arr)
|
|
|
+
|
|
|
+# print(find_smallest_int([0, 1-2**64, 2**64]))
|
|
|
+
|
|
|
+# ------------------------------------------------------------------------------- #
|
|
|
+# Сумма цифр в стпени равной длине числа должна быть равна самому числу
|
|
|
+'''
|
|
|
+def narcissistic(value):
|
|
|
+
|
|
|
+ number_digits = len(str(value))
|
|
|
+ new_value = value
|
|
|
+ sum = 0
|
|
|
+ digit = 0
|
|
|
+
|
|
|
+ for i in range(number_digits - 1, -1, -1):
|
|
|
+ digit = int(new_value/10**i)
|
|
|
+ sum += digit**number_digits
|
|
|
+ new_value -= digit*10**i
|
|
|
+
|
|
|
+ return sum == value
|
|
|
+'''
|
|
|
|
|
|
+# Красивое решение решение
|
|
|
+def narcissistic(value):
|
|
|
+ return value == sum(int(x) ** len(str(value)) for x in str(value))
|
|
|
|
|
|
-print(unique_in_order("qwereteyty"))
|
|
|
+# print(narcissistic(371))
|
