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
#include <iostream>
#include <algorithm>
using namespace std;

string kon[200001];

int t[300001];



int main() {
    int n;
    long long suma = 0;
    cin>>n;
    for(int i =0;i<n;i++)
        cin>>kon[i];
    for(int j = 0; j < kon[0].size(); j++)
        t[j] = kon[0][j]-'0';
    int dl = kon[0].size();
    int stan = 0;
    for(int i = 1;i<n;i++){
        stan = 3;
        for(int j = 0;j<kon[i].size();j++){
            if(t[j]>kon[i][j]-'0'){
                stan = 1;
                break;
            }
            if(t[j]<kon[i][j]-'0'){
                stan = 2;
                break;
            }
        }
        if(stan == 1){
            for(int j = 0;j<kon[i].size();j++){
                t[j] = kon[i][j]-'0';
            }
            int w = dl - kon[i].size();
            if(w < 0 )
                w=0;
            else 
                w=w+1;
            suma += w;
            for(int j=kon[i].size();j<=20;j++)
                t[j]=0;
            for(int j=dl;j>=max(dl-20,(int)kon[i].size());j--)
                t[j]=0;
            dl++;
            dl = max(dl,(int)kon[i].size());
        }
        if(stan == 2){
            for(int j = 0;j<kon[i].size();j++){
                t[j] = kon[i][j]-'0';
            }
            int w = dl - kon[i].size();
            if(w <= 0 )
                w=0;
            else 
                w=w;
            suma += w;
            dl = max(dl,(int)kon[i].size());
            for(int j=kon[i].size();j<=20;j++)
                t[j]=0;
            for(int j=dl;j>=max(dl-20,(int)kon[i].size());j--)
                t[j]=0;
        }
        if(stan == 3){
            int w = dl - kon[i].size();
            if(w < 0 ){
                w=0;
                dl = max(dl, (int)kon[i].size());
                for(int j = 0;j<kon[i].size();j++){
                    t[j] = kon[i][j]-'0';
                }
                for(int j=kon[i].size();j<=20;j++)
                    t[j]=0;
                for(int j=dl;j>=max(dl-20,(int)kon[i].size());j--)
                    t[j]=0;
            }else if(w == 0 ){
                for(int j = 0;j<kon[i].size();j++){
                    t[j] = kon[i][j]-'0';
                }
                for(int j=kon[i].size();j<=20;j++)
                    t[j]=0;
                for(int j=dl;j>=max(dl-20,(int)kon[i].size());j--)
                    t[j]=0;
                w=1;
                dl++;
            }else{ 
                t[dl-1]+=1;
                int g = dl-1;
                bool ok = true;
                while(t[g]>=10){
                    t[g]=0;
                    t[g-1]+1;
                    g--;
                    if(g==kon[i].size()-1){
                        ok = false;
                        break;
                    }
                }
                if(ok==false){
                    dl++;
                    w=w+1;
                    for(int j=kon[i].size();j<=20;j++)
                        t[j]=0;
                    for(int j=dl;j>=max(dl-20,(int)kon[i].size());j--)
                        t[j]=0;
                }
                
            }
            suma += w;
         
        }
      //  for(int i = 0;i<dl;i++)cout<<t[i];
       // cout<<"\n";
        //cout<<"K: "<<kon[i]<<" suma: "<<suma<<" dl: "<<dl<<"\n";
    }
    
    cout<<suma<<"\n";
    return 0;
}