#include <stdio.h> #include <stdlib.h> #define MAXL 256000 #define MAXB 16 int xmax(int a, int b) { return (a>b) ? a : b; } void show(int* ll, int nl, int lz) { int i; for (i=0;i<nl;i++) { if (i==lz) printf("|"); printf("%d", ll[i]); } printf("\n"); } int main() { int n, i, j, p1, p2; long long s = 0; int ll[MAXL]; int bb[MAXB]; int nl = 0; int lz = 0; int nb; scanf("%d", &n); scanf("%d", &p1); while (p1>0) { bb[nl++] = p1 % 10; p1 /= 10; } lz = nl; for (i=0;i<nl;i++) ll[nl-1-i] = bb[i]; for (i=1;i<n;i++) { scanf("%d", &p2); //printf("%d <---\n", p2); nb = 0; while (p2>0) { bb[nb++] = p2 % 10; p2 /= 10; } if (nb>nl) { //printf("Nowy po prostu większy +0 = %lld\n", s); for (j=0;j<nb;j++) ll[j] = bb[nb-1-j]; nl = nb; lz = nl; } else { j = 0; while (j<nl && j<nb && ll[j]==bb[nb-1-j]) j++; if (j>=nl && j>=nb) { ll[nl] = 0; nl++; s++; //printf("Oba takie same '0' na końcu +1 = %lld\n", s); /*} else if (j>=nl) { printf("WTF2?!\n"); while (j<nl || j<nb) { ll[j] = (j<nb) ? bb[nb-1-j] : 0; j++; } nl = j; lz = nb;*/ } else if (j>=nb) { int k = nl - 1; while (k>nb-1 && ll[k]==9) k--; lz = k + 1; if (k==nb-1) { k++; while (k<=nl) ll[k++] = 0; s += (nl - nb + 1); //printf("Takie same, ale stara dłuższa - trzeba wydłużyć +%d = %lld\n", nl - nb + 1, s); nl++; } else { ll[k]++; s += (nl - nb); //printf("Takie same, ale stara dłuższa - kolejna w kolejności +%d = %lld\n", nl - nb, s); k++; while (k<nl) ll[k++] = 0; } } else if (bb[nb-1-j]>ll[j]) { if (nb<=nl) { while (j<nb) { ll[j] = bb[nb-1-j]; j++; } int lz2 = j; while (j<nl && j<lz) { ll[j] = 0; j++; } s += (nl-nb); //printf("Dopisanie sufiksu do większej +%d = %lld\n", nl-nb, s); //lz = (lz2<lz) ? lz2 : lz; lz = lz2; } else { //printf("WTF4?\n"); while (j<nl || j<nb) { ll[j] = (j<nb) ? bb[nb-1-j] : 0; j++; } nl = j; lz = nl; } } else if (bb[nb-1-j]<ll[j]) { if (nb<=nl) { while (j<nb) { ll[j] = bb[nb-1-j]; j++; } int lz2 = j; while (j<nl && j<lz) { ll[j] = 0; j++; } s += 1 + nl - nb; //printf("Dopisanie sufiksu do mniejszej +%d = %lld\n", 1+nl-nb, s); ll[nl] = 0; nl++; //lz = (lz2<lz) ? lz2 : lz; lz = lz2; } else { printf("WTF3?\n"); while (j<nl || j<nb) { ll[j] = (j<nb) ? bb[nb-1-j] : 0; j++; } s += 1; ll[j] = 0; nl = j+1; lz = nl; } } else { printf("WTF j=%d nl=%d nb=%d j>nl=%d j>nb%d!?\n", j, nl, nb, j>nl, j>nb, ll[j], bb[nb-1-j]); } } //show(ll, nl, lz); } printf("%lld\n", s); 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 142 143 144 145 146 147 148 149 | #include <stdio.h> #include <stdlib.h> #define MAXL 256000 #define MAXB 16 int xmax(int a, int b) { return (a>b) ? a : b; } void show(int* ll, int nl, int lz) { int i; for (i=0;i<nl;i++) { if (i==lz) printf("|"); printf("%d", ll[i]); } printf("\n"); } int main() { int n, i, j, p1, p2; long long s = 0; int ll[MAXL]; int bb[MAXB]; int nl = 0; int lz = 0; int nb; scanf("%d", &n); scanf("%d", &p1); while (p1>0) { bb[nl++] = p1 % 10; p1 /= 10; } lz = nl; for (i=0;i<nl;i++) ll[nl-1-i] = bb[i]; for (i=1;i<n;i++) { scanf("%d", &p2); //printf("%d <---\n", p2); nb = 0; while (p2>0) { bb[nb++] = p2 % 10; p2 /= 10; } if (nb>nl) { //printf("Nowy po prostu większy +0 = %lld\n", s); for (j=0;j<nb;j++) ll[j] = bb[nb-1-j]; nl = nb; lz = nl; } else { j = 0; while (j<nl && j<nb && ll[j]==bb[nb-1-j]) j++; if (j>=nl && j>=nb) { ll[nl] = 0; nl++; s++; //printf("Oba takie same '0' na końcu +1 = %lld\n", s); /*} else if (j>=nl) { printf("WTF2?!\n"); while (j<nl || j<nb) { ll[j] = (j<nb) ? bb[nb-1-j] : 0; j++; } nl = j; lz = nb;*/ } else if (j>=nb) { int k = nl - 1; while (k>nb-1 && ll[k]==9) k--; lz = k + 1; if (k==nb-1) { k++; while (k<=nl) ll[k++] = 0; s += (nl - nb + 1); //printf("Takie same, ale stara dłuższa - trzeba wydłużyć +%d = %lld\n", nl - nb + 1, s); nl++; } else { ll[k]++; s += (nl - nb); //printf("Takie same, ale stara dłuższa - kolejna w kolejności +%d = %lld\n", nl - nb, s); k++; while (k<nl) ll[k++] = 0; } } else if (bb[nb-1-j]>ll[j]) { if (nb<=nl) { while (j<nb) { ll[j] = bb[nb-1-j]; j++; } int lz2 = j; while (j<nl && j<lz) { ll[j] = 0; j++; } s += (nl-nb); //printf("Dopisanie sufiksu do większej +%d = %lld\n", nl-nb, s); //lz = (lz2<lz) ? lz2 : lz; lz = lz2; } else { //printf("WTF4?\n"); while (j<nl || j<nb) { ll[j] = (j<nb) ? bb[nb-1-j] : 0; j++; } nl = j; lz = nl; } } else if (bb[nb-1-j]<ll[j]) { if (nb<=nl) { while (j<nb) { ll[j] = bb[nb-1-j]; j++; } int lz2 = j; while (j<nl && j<lz) { ll[j] = 0; j++; } s += 1 + nl - nb; //printf("Dopisanie sufiksu do mniejszej +%d = %lld\n", 1+nl-nb, s); ll[nl] = 0; nl++; //lz = (lz2<lz) ? lz2 : lz; lz = lz2; } else { printf("WTF3?\n"); while (j<nl || j<nb) { ll[j] = (j<nb) ? bb[nb-1-j] : 0; j++; } s += 1; ll[j] = 0; nl = j+1; lz = nl; } } else { printf("WTF j=%d nl=%d nb=%d j>nl=%d j>nb%d!?\n", j, nl, nb, j>nl, j>nb, ll[j], bb[nb-1-j]); } } //show(ll, nl, lz); } printf("%lld\n", s); return 0; } |