1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll pot[11]={1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000,10000000000};

int d(ll x) {
	int i=0;
	while(x) {
		x/=10;
		i++;
	}
	return i;
}

ll q(ll prev,ll a) {
	int i=0;	
	while(prev>a) {
		prev/=10;
		i++;
	}
	return i;	
}

int main() {
	ios_base::sync_with_stdio(0);	cin.tie(0);	cout.tie(0);	
	int N,ile=0;
	ll prev,a,res=0,pom;
	cin >> N;
	cin >> prev;
	for(int i=2;i<=N;i++) {
		cin >> a;
		if(prev<a) continue;		
		else {
			ile = d(prev) - d(a);
			if(ile==0) {
				if(prev>a) {
					res++;
					if(a%10>=8) prev = a+1;
					else prev = a*10;
				}
				else {				
					res++;
					if(a%10>=8) prev = a+1;
					else prev = a*10;
				}
			}
			else {
				pom = q(prev,a);
				res+=pom;
			//	cout << "XD";
				if(prev%pot[pom]+1 > pot[pom]) {
					if(a%10>=8) a++;
					else {
						a*=pot[pom+1];
						a+=prev%pot[pom]+1;
					}
				}
				else {
					if(a%10>=8) a++;
					else {
						a*=pot[pom];
						a+=prev%pot[pom]+1;
					}				
				}
				prev = a;
			}
		//	cout << prev << " " << a << "!\n";
		}
	}
	cout << res;
}