F
бля
Size: a a a
2020 May 16
F
как звали того чувака имя котрого нелья проиносить
F
курсы
ПЯ
@alext18 A step(x) operation works like this: it changes a number x into x - s(x), where s(x) is the sum of x's digits. You like applying functions to numbers, so given the number n, you decide to build a decreasing sequence of numbers: n, step(n), step(step(n)), etc., with 0 as the last element.
Building a single sequence isn't enough for you, so you replace all elements of the sequence with the sums of their digits (s(x)). Now you're curious as to which number appears in the new sequence most often. If there are several answers, return the maximal one.
Example
For n = 88, the output should be 9.
Here is the first sequence you built: 88, 72, 63, 54, 45, 36, 27, 18, 9, 0;
And here is s(x) for each of its elements: 16, 9, 9, 9, 9, 9, 9, 9, 9, 0.
As you can see, the most frequent number in the second sequence is 9.
For n = 8, the output should be 8.
At first you built the following sequence: 8, 0
s(x) for each of its elements is: 8, 0
As you can see, the answer is 8 (it appears as often as 0, but is greater than it).
Input/Output
[input] integer n
Constraints: 1 ≤ n ≤ 105
[output] an integer
The most frequent number in the sequence s(n), s(step(n)), s(step(step(n))), etc.
Building a single sequence isn't enough for you, so you replace all elements of the sequence with the sums of their digits (s(x)). Now you're curious as to which number appears in the new sequence most often. If there are several answers, return the maximal one.
Example
For n = 88, the output should be 9.
Here is the first sequence you built: 88, 72, 63, 54, 45, 36, 27, 18, 9, 0;
And here is s(x) for each of its elements: 16, 9, 9, 9, 9, 9, 9, 9, 9, 0.
As you can see, the most frequent number in the second sequence is 9.
For n = 8, the output should be 8.
At first you built the following sequence: 8, 0
s(x) for each of its elements is: 8, 0
As you can see, the answer is 8 (it appears as often as 0, but is greater than it).
Input/Output
[input] integer n
Constraints: 1 ≤ n ≤ 105
[output] an integer
The most frequent number in the sequence s(n), s(step(n)), s(step(step(n))), etc.
ПЯ
дело в том, что на одном тесте фейлюсь
ПЯ
def most_common(obj):
dt = dict([(obj.count(i),i) for i in obj])
return dt[max(dt.keys())]
def most_frequent_digit_sum(n):
k=n
digits = [n]
while n!=0:
n-=sum([int(x) for x in str(n)])
digits.append(n)
for j,i in enumerate(digits):
tmp = [int(x) for x in str(i)]
digits[j]=sum(tmp)
if len(str(k)) > most_common(digits):
return k
else:
return most_common(digits)
print(most_frequent_digit_sum(99999))CJ
Ferdinand
как звали того чувака имя котрого нелья проиносить
Водан де морт
ПЯ
при вводе 17 должно выводить 9, а выводит 17
R3
Евклид Шуруповертов, Бензофуран Гетероцикл...
R3
Ребят, вы случаем не братья?
ПЯ
CJ
Ребят, вы случаем не братья?
Секта какая-то
CJ
Кто щто долбит тот то и носит
ПЯ
я из Беларуси, о чем ты...
ПЯ
@Rud356 можешь помочь?
R3
Я сейчас занят пожиранием коржика и написанием кода для чат приложухи
R3
Пилю эндпоинты и обвязку
F
весело?