Problem:
Score : 1300 points

Problem Statement

We will call a non-negative integer increasing if, for any two adjacent digits in its decimal representation, the digit to the right is greater than or equal to the digit to the left.
For example, 1558, 11, 3 and 0 are all increasing; 10 and 20170312 are not.

Snuke has an integer N. Find the minimum number of increasing integers that can represent N as their sum.

Constraints

1 \leq N \leq 10^{500000}

Input

The input is given from Standard Input in the following format:

N

Output

Print the minimum number of increasing integers that can represent N as their sum.

Sample Input 1

80

Sample Output 1

2

One possible representation is 80 = 77 + 3.

Sample Input 2

123456789

Sample Output 2

1

123456789 in itself is increasing, and thus it can be represented as the sum of one increasing integer.

Sample Input 3

20170312

Sample Output 3

4

Sample Input 4

7204647845201772120166980358816078279571541735614841625060678056933503

Sample Output 4

31

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back

const int maxn = 1e5 + 20;

string s;

void mkay()
{
	int n = s.size();

	s[n - 1]++;
	for(int j = n - 1; j >= 0; j--)
	{
		if(s[j] <= '9')
			break;

		s[j - 1]++;
		s[j] = '0';
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> s;

	int n = s.size() , res = 0 , prefix = 0;
	for(int i = 0; i < n; i++)
	{
		res++;
		int n = s.size();
		int T = 1 , last = i , j = i + 1;

		while(j < n && s[j] >= s[j - 1])
		{
			if(s[j] > s[j - 1])
				last = j;
			j++;
		}

		if(j == n)
			break;

		while(i < last + 1)
			s[i] = '0' , i++;
		i--;

		if(n - i >= 20)
		{
			i++;
			while(i < j)
			{
				res++;
				mkay();
				i++;
			}
			i--;
		}
	}

	cout << res << endl;
}