Question: We want to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, we

We want to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, we can represent 121 as 121=111+11+1. Help us to find the least number of digits 1 in such sum.

Input: The first line of the input contains integer n (1n<1015).

Output: Print expected minimal number of digits 1.

(ex. input:121, output:6)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!