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
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

vector<int> to_digits(long long num) {
	vector<int> ret;
	while(num) {
		ret.push_back(num%10);
		num/=10;
	}
	reverse(ret.begin(), ret.end());
	return ret;
}

struct number {
	map<int, int> digits;
	int numdigits;
	int minleft;
};

int getdigit(number& a, size_t index) {
	if (a.digits.count(index)) return a.digits[index];
	return 0;
}

bool operator<(number& a, number& b) {
	if (a.numdigits != b.numdigits){
		return a.numdigits < b.numdigits;
	}
	int i = 0;
	int n = a.numdigits;
	while (i < n) {
		int ai = getdigit(a, i);
		int bi = getdigit(b, i);
		if (ai < bi) return true;
		if (ai > bi) return false;
		int inext = n;
		auto it = a.digits.upper_bound(i);
		if (it != a.digits.end()) 
			inext = min(inext, it->first);
		auto it2 = b.digits.upper_bound(i);
		if (it2 != b.digits.end()) 
			inext = min(inext, it2->first);
		i = inext;
	}
	return false;
}

long long p10[20];

void printnumber(number& prev) {
	int i = -1;
	for (auto kv: prev.digits) {
		if (kv.first != i+1) {
			printf("[%d zeros]", kv.first - (i+1));
		}
		printf("%d", kv.second);
		i = kv.first;
	}
		if (prev.numdigits != i+1) {
			printf("[%d zeros]", prev.numdigits - (i+1));
		}
	printf("\n");
}

number increment(number x) {
	int carry = 1;
	for (int i=x.numdigits-1; i>=x.minleft; i--) {
		x.digits[i]++;
		if (x.digits[i] == 10) {
			x.digits[i] = 0;
		}
		else {
			carry = 0;
			break;
		}
	}
	if (carry == 0) return x;
	vector<int> torem;
	for (auto kv: x.digits)
		if (kv.first >= x.minleft)
			torem.push_back(kv.first);

	for (auto t: torem)
		x.digits.erase(t);

	x.numdigits++;
	return x;
}

number maxnumber(number x) {
	vector<int> torem;
	for (auto kv: x.digits)
		if (kv.first >= x.minleft)
			torem.push_back(kv.first);

	for (auto t: torem)
		x.digits.erase(t);

	for (int i=x.minleft; i<min(x.numdigits, x.minleft+20); i++){
		x.digits[i] = 9;
	}
	return x;
}

int main() {
	p10[0] = 1;
	for (int i=1; i<18; i++) {
		p10[i] = 10 * p10[i-1];
	}

	int n;
	scanf("%d", &n);
	number prev{ {}, 0, 0};
	long long sum = 0;
	while(n--) {
		long long x;
		scanf("%lld", &x);
		//printf("New number %lld\n", x);
		number cur;
		auto digs = to_digits(x);
		for (size_t i=0; i<digs.size(); i++) {
			cur.digits[i] = digs[i];
		}
		cur.numdigits = digs.size();
		cur.minleft = digs.size();

		if (prev.numdigits < cur.numdigits) {
			//printf("Was already beter\n");
			prev = cur;
		}
		else {
			//printf("Gotta\n");
			sum += prev.numdigits - cur.numdigits;
			cur.numdigits = prev.numdigits;
			if (!(prev < cur)) {
				number maxcur = maxnumber(cur);
				//printf("    maxnum would be ");
				//fflush(stdout);
				//printnumber(maxcur);
				if (prev < maxcur) {
					cur.digits = prev.digits;
					//printf("After leftpad: ");
					//printnumber(cur);
					cur = increment(cur);
					//printf("Final inc: ");
					//printnumber(cur);
				}
				else {
					cur.numdigits++;
				}
				if (cur.numdigits > prev.numdigits) {
					sum++;
				}
			}
			prev = cur;
		}

		//printf("  Now got: ");
		//		fflush(stdout);
		//printnumber(prev);
	}
	printf("%lld\n", sum);
}