MINNUM  Minimum Number
Problem Statement:Prana has given a number. Now she wonder what will be the maximum number of digits that the sum of these digits is equals to the given number. After thinking sometimes she laughed at herself, cause the number is infinite.
Now your task is to find the minimum number of digits that the sum of these digits is equals to the given number.
Input:
The input contain a single integer N ( 0 ≤ N ≤ 10^{31} ). The input is terminated by a line containing 1.
Output:
Output a single line the number of digits that the sum of the digits is equals to the given number. See the sample input/output for exact formatting.
Sample Input/Output:
Sample Input
Sample Output
11
1
1
2
1
Explanation :
For the first test case given number is 11. Some possible way to make 11 is
7+4=11 which costs 2 digits.
2+3+6=11 which costs 3 digits.
1+2+3+5=11 which costs 4 digits.
1+2+3+0+5=11 which costs 5 digits.
So, here first example costs the minimum number of digits which is 2.
Note: There are no extra new lines between different numbers.
____________________________________________________________________________________________
Problem setter: Abu Sufian, Dept. of CSE
Bangladesh University of Business and Technology (BUBT)
hide comments
sudhanshu6324:
20190205 19:32:02
observe that it's not 2^31 rather 10^31 so this value won't fit in long long Last edit: 20190205 19:32:11 

sagnik_66:
20170906 13:49:09
Implemented within 2 mins, then noticed that Java wasn't allowed.... Lol 

candide:
20170414 03:52:53
Elementary but tedious to get right, C is not Python! Tests are weak, for instance a file returning incorrectly 1000 (instead of 1002) to 9010 as input got accepted. The correct answer for 0 as input remains unclear (the valid answer is 0, not 1). Last edit: 20170414 16:57:28 

madhavgaba:
20161229 11:46:38
doing without big integer....really a workout! 

sonu:
20161106 13:07:57
if you are getting wa then do check for 92 

topke:
20160309 15:00:41
Clarify 0 test case, cause right answer by problem statement is 1 

msainkhil:
20151229 18:42:54
good questin, implemented my bigint 

Satyam Mishra:
20150726 12:06:31
Nice and easy one...


:.Mohib.::
20150722 15:07:16
Very good question.... :)


vasayashwanth:
20150713 09:37:23
test cases with answers:

Added by:  Shipu Ahamed 
Date:  20130918 
Time limit:  1s 
Source limit:  3100B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  C C++ 4.3.2 CPP PASGPC PASFPC 