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
#include<bits/stdc++.h>
using namespace std;
int n, result = 0, last = 0, cost, dif, l;
int length(int a)
{
    int border = 10, digits = 1;
    while(border < a)
    {
        border *= 10;
        digits++;
    }
    return digits;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cin >> n;
    for(int i = 0; i < n; ++i)
    {
        cin >> cost;
        while(cost <= last)
        {
            cost *= 10;
            dif = length(last) - length(cost);
            l = pow(10, dif);
            if (l > 1)
            {
                if(cost - cost % 10 == (last / l) - (last / l) % 10)
                {
                    if((last / l) % 10 == 9)
                        cost *= 10;
                    else cost += (last / l) % 10 - cost % 10;
                }
            }
            else
            {
                if(cost - cost & 10 == last - last % 10)
                {
                    if(last % 10 == 9)
                        cost *= 10;
                    else cost += last % 10 - cost % 10 + 1;
                }
            }
            result++;
        }
        last = cost;
    }
    cout << result;
    return 0;
}