A9521 | $One-Based Arithmetic$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Prof. Vasechkin wants to represent positive integer $n$ as a sum of addends, where each addends is an integer number containing only 1s. For example, he can represent 121 as 121=111+11+-1. Help him to find the least number of digits 1 in such sum.

The first line of the input contains integer $n$ ( $1<=n<10^{15}$ ).

Print expected minimal number of digits 1.

输入 #1

输出 #1

C++ 编辑器

输入

输出