Created
October 22, 2015 11:07
-
-
Save ZeronSix/5810e2c035ed8cde7f00 to your computer and use it in GitHub Desktop.
11.3. Красивые числа
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
n = int(input()) | |
split_table = {} | |
def get_split_sum(a, start_index, end): | |
l = end - start_index + 1 | |
if l <= 2: | |
return 0 | |
if (start_index + 1, end) in split_table: | |
sum1 = split_table[(start_index + 1, end)] | |
else: | |
sum1 = get_split_sum(a, start_index + 1, end) | |
if (start_index + 2, end) in split_table: | |
sum2 = split_table[(start_index + 2, end)] | |
else: | |
sum2 = get_split_sum(a, start_index + 2, end) | |
split_table[(start_index, end)] = min(a[start_index] + a[start_index + 1] + sum1, | |
a[start_index + 1] + a[start_index + 2] + sum2) | |
return split_table[(start_index, end)] | |
digits = [] | |
while n > 0: | |
digits.append(n % 10) | |
n //= 10 | |
IN_EVEN = 0 | |
IN_ODD = 1 | |
state = IN_EVEN | |
i = 0 | |
start = 0 | |
split_sum = 0 | |
while i < len(digits): | |
is_even = (digits[i] % 2 == 0) | |
if is_even: | |
if state == IN_ODD: | |
if i - start + 1 > 2: | |
split_sum += get_split_sum(digits, start, i) | |
start = i | |
state = IN_EVEN | |
else: | |
if state == IN_EVEN: | |
if i - start + 1 > 2: | |
split_sum += get_split_sum(digits, start, i) | |
start = i | |
state = IN_ODD | |
i += 1 | |
if i - start > 2: | |
split_sum += get_split_sum(digits, start, i - 1) | |
print(split_sum) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment