#include <cstdio> #include <cstring> // low numbers int ileznakow(long long &m, long long current) { long long pow = 1; int znak = 0; while(1) { znak++; pow *= 10; if (current*pow <= m) { long long roz = m - current*pow; if (roz < pow-1) { m = current*pow + roz + 1; return znak; } } else { m = current*pow; return znak; } } } // high numbers int compare(char *a, char *b) { int i; for (i=0; a[i] && b[i]; ++i) { if (a[i] < b[i]) return -1; if (a[i] > b[i]) return 1; } return 0; } int maxZeros(int z) { switch(z) { case 0: return 0; case 1: return 9; case 2: return 99; case 3: return 999; case 4: return 9999; case 5: return 99999; default: return 999999; } } int main() { int k; long long llmin; long long minzeros = 0; long long llcurrent; long long sum = 0; int zeros = 0; int zerow = 0; char min[20]; char current[20]; int alg = 1; scanf("%d", &k); scanf("%lld", &llmin); for (int i=1; i<k; ++i) { if (alg) { scanf("%lld", &llcurrent); if (llcurrent > llmin) { llmin = llcurrent; continue; } sum += ileznakow(llmin, llcurrent); if (llmin > 1e16) { sprintf(min, "%lld", llmin); alg = 0; } } else { scanf("%s", current); int result = compare(min, current); if (result < 0) { int lenm = strlen(min) + zeros; int lenc = strlen(current); zeros = lenm-lenc; if (zeros < 0) zeros = 0; zerow = 0; } else if (result == 0) { int lenm = strlen(min); int lenc = strlen(current); if (lenm > lenc) strcmp(min, current); lenm = lenm + zeros; lenc = lenc; zeros = lenm - lenc; if (zerow < maxZeros(zeros)) zerow++; else { zeros++; zerow = 0; } } else if (result > 0) { int lenm = strlen(min) + zeros; int lenc = strlen(current); zeros = lenm - lenc + 1; if (zeros < 0) zeros = 0; zerow = 0; } sum += zeros; strcpy(min, current); // int ii,j; // char buffer[1000]; // strcpy(buffer, min); // for (ii=0; buffer[ii]; ++ii); // for (j=0; j<zeros; ++j) // buffer[ii+j] = '0'; // // buffer[ii+j] = 0; // printf("Min: %s | zeros: %d zerow: %d\n", buffer, zeros, zerow); } } printf("%lld\n", sum); return 0; }
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 | #include <cstdio> #include <cstring> // low numbers int ileznakow(long long &m, long long current) { long long pow = 1; int znak = 0; while(1) { znak++; pow *= 10; if (current*pow <= m) { long long roz = m - current*pow; if (roz < pow-1) { m = current*pow + roz + 1; return znak; } } else { m = current*pow; return znak; } } } // high numbers int compare(char *a, char *b) { int i; for (i=0; a[i] && b[i]; ++i) { if (a[i] < b[i]) return -1; if (a[i] > b[i]) return 1; } return 0; } int maxZeros(int z) { switch(z) { case 0: return 0; case 1: return 9; case 2: return 99; case 3: return 999; case 4: return 9999; case 5: return 99999; default: return 999999; } } int main() { int k; long long llmin; long long minzeros = 0; long long llcurrent; long long sum = 0; int zeros = 0; int zerow = 0; char min[20]; char current[20]; int alg = 1; scanf("%d", &k); scanf("%lld", &llmin); for (int i=1; i<k; ++i) { if (alg) { scanf("%lld", &llcurrent); if (llcurrent > llmin) { llmin = llcurrent; continue; } sum += ileznakow(llmin, llcurrent); if (llmin > 1e16) { sprintf(min, "%lld", llmin); alg = 0; } } else { scanf("%s", current); int result = compare(min, current); if (result < 0) { int lenm = strlen(min) + zeros; int lenc = strlen(current); zeros = lenm-lenc; if (zeros < 0) zeros = 0; zerow = 0; } else if (result == 0) { int lenm = strlen(min); int lenc = strlen(current); if (lenm > lenc) strcmp(min, current); lenm = lenm + zeros; lenc = lenc; zeros = lenm - lenc; if (zerow < maxZeros(zeros)) zerow++; else { zeros++; zerow = 0; } } else if (result > 0) { int lenm = strlen(min) + zeros; int lenc = strlen(current); zeros = lenm - lenc + 1; if (zeros < 0) zeros = 0; zerow = 0; } sum += zeros; strcpy(min, current); // int ii,j; // char buffer[1000]; // strcpy(buffer, min); // for (ii=0; buffer[ii]; ++ii); // for (j=0; j<zeros; ++j) // buffer[ii+j] = '0'; // // buffer[ii+j] = 0; // printf("Min: %s | zeros: %d zerow: %d\n", buffer, zeros, zerow); } } printf("%lld\n", sum); return 0; } |