#include <bits/stdc++.h> using namespace std; using u64 = uint64_t; using i64 = int64_t; using ci64 = int64_t const; using vi = vector<i64>; using vvi = vector<vector<i64>>; using cvi = vector<i64> const; using cvvi = vector<vector<i64>> const; // print tuples {{{ template <typename T1, typename T2> ostream& operator<<(ostream& os, const pair<T1, T2>& t) { return os << '[' << t.first << ',' << t.second << ']'; } void print_tpl_helper(ostream&, bool) {} template <typename T, typename ...Ts> void print_tpl_helper(ostream& os, bool first, const T& v, const Ts& ...vs) { if (!first){os << ',';} os << v; print_tpl_helper(os, false, vs...); } template <typename ...Ts> ostream& print_struct(ostream& os, const char* classname, const Ts& ...vs) { // todo: named fields os << classname << '('; print_tpl_helper(os, true, vs...); return os << ')'; } struct Example { char symbol; u64 val; friend ostream& operator<<(ostream& os, const Example& elem) { return print_struct(os, "Op", elem.symbol, elem.val); } }; // }}} // print containers {{{ template <typename It> void print(ostream& os, It begin, It end, u64 len, u64 limit = 17) { u64 count = 0; os << "{"; while (begin != end && count < limit) { os << "(" << *begin << ")"; count++; begin++; } if (begin != end) os << "... " << len << " total"; os << "}"; } #define MAKE_PRINTER_1(container) \ template <typename T> ostream& operator<<(ostream& os, const container<T>& t) { print(os, t.begin(), t.end(), t.size()); return os; } #define MAKE_PRINTER_2(container) \ template <typename T1, typename T2> \ ostream& operator<<(ostream& os, const container<T1, T2>& t) { \ print(os, t.begin(), t.end(), t.size()); \ return os; \ } MAKE_PRINTER_1(vector) MAKE_PRINTER_2(map) MAKE_PRINTER_1(set) MAKE_PRINTER_2(unordered_map) MAKE_PRINTER_1(unordered_set) #undef MAKE_PRINTER_1 #undef MAKE_PRINTER_2 // }}} // read/write {{{ template <typename T> T read() { T e; cin >> e; return e; } void read() {} template <typename T, typename ...Ts> void read(T& v, Ts& ...ts) { v = read<T>(); read(ts...); } template <typename T> vector<T> readv(u64 n) { vector<T> v; for (u64 i = 0; i < n; i++) v.push_back(read<T>()); return v; } template <typename T> struct identity { const T& operator()(const T& t) const { return t; } }; #define PRINTERS(FNAME, OUTP) \ template <typename T> void FNAME(const T& t) { OUTP << t << ' '; } \ void FNAME##ln() { OUTP << '\n'; } \ template <typename T> void FNAME##ln(const T& t) { OUTP << t << '\n'; } \ template <typename T, typename F = identity<typename T::value_type>> \ void FNAME##v(const T& t, F f = F()) { for (const auto& e : t) FNAME(f(e)); FNAME##ln(); } PRINTERS(print, cout) #ifdef DEBUG_PRINTS PRINTERS(dprint, cerr) #else # define dprint(...) # define dprintv(...) # define dprintln(...) #endif /// }}} // range, len, max {{{ vi range(i64 start, i64 end) { vi v; for (i64 i = start; i < end; i++) v.push_back(i); return v; } vi range(i64 end) { return range(0, end); } template <typename DS> i64 len(DS t) { return (i64)t.size(); } template <typename DS> i64 tmax(DS t) { if (t.empty()) { dprintln("'max' on empty range, returning 0."); return 0; } return *max_element(t.begin(), t.end()); } // }}} i64 gp10(i64 b) { if (b >= 21) b = 21; i64 res = pow(static_cast<double>(10), b); if (res % 10 == 9) ++res; return res; } i64 cdigs(i64 x) { if (x == 0) return 0; i64 res = 1; while (x /= 10) ++res; return res; } struct Exp { i64 a, k, b; i64 da; i64 value() const { if (k >= 21) return 42ll; // return 42ll; return a * gp10(k) + b; } i64 full_len() const { return da + k; } i64 get_prefix(i64 digs) const { ci64 adigs = da; ci64 full_len = adigs + k; if (digs >= full_len) return value(); if (digs <= adigs) return a / gp10(adigs - digs); i64 res = a * gp10(digs - adigs); res = res + b / gp10(full_len - digs); return res; } void increment() { ++b; if (b != gp10(k)) return; ++a; if (a == gp10(da)) ++da; b = 0; } }; i64 max(i64 a, i64 b) { return a < b ? b : a; } void go() { ci64 n = read<i64>(); // ci64 n = 13; // dprintln(cdigs(1)); // dprintln(cdigs(10)); // dprintln(cdigs(99)); // dprintln(cdigs(666)); //println("here"); // { // Exp e = {47, 2, 0}; // dprint(e.a); dprint(e.k); dprintln(e.b); // dprintln(e.value()); // e.increment(); // dprint(e.a); dprint(e.k); dprintln(e.b); // dprintln(e.value()); // dprintln(e.get_prefix(3)); // } // return; Exp e = {}; i64 res = 0; for (ci64 i : range(n)) { e.increment(); ci64 x = read<i64>(); i64 xdigs = cdigs(x); i64 e_full_len = e.full_len(); //ci64 epref = x; ci64 epref = e.get_prefix(xdigs); if (epref < x) { e.k = max(0ll, e_full_len - xdigs); e.a = x; e.da = xdigs; e.b = 0; } else if (epref > x) { e.k = max(0ll, e_full_len - xdigs + 1ll); e.a = x; e.da = xdigs; e.b = 0; } //dprint(e.a); dprint(e.k); dprint(e.b); res += e.full_len() - xdigs; dprintln(e.value()); // dprint(e.a); dprint(e.k); dprintln(e.b); } println(res); // while (true) { // Exp e; // dprintln("provide a, k, b"); // read(e.a, e.k, e.b); // while (true) { // dprint("value:"); dprintln(e.value()); // string s; // dprintln("e - provide again; i - increment; p <num> - prefix"); // read(s); // if (!s.size() || s[0] == 'e') // break; // if (s[0] == 'i') // e.increment(); // else { // print("prefix:"); println(e.get_prefix(read<i64>())); // } // } // } } int main () { // {{{ ios_base::sync_with_stdio(0); cin.tie(0); go(); } //
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 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 | #include <bits/stdc++.h> using namespace std; using u64 = uint64_t; using i64 = int64_t; using ci64 = int64_t const; using vi = vector<i64>; using vvi = vector<vector<i64>>; using cvi = vector<i64> const; using cvvi = vector<vector<i64>> const; // print tuples {{{ template <typename T1, typename T2> ostream& operator<<(ostream& os, const pair<T1, T2>& t) { return os << '[' << t.first << ',' << t.second << ']'; } void print_tpl_helper(ostream&, bool) {} template <typename T, typename ...Ts> void print_tpl_helper(ostream& os, bool first, const T& v, const Ts& ...vs) { if (!first){os << ',';} os << v; print_tpl_helper(os, false, vs...); } template <typename ...Ts> ostream& print_struct(ostream& os, const char* classname, const Ts& ...vs) { // todo: named fields os << classname << '('; print_tpl_helper(os, true, vs...); return os << ')'; } struct Example { char symbol; u64 val; friend ostream& operator<<(ostream& os, const Example& elem) { return print_struct(os, "Op", elem.symbol, elem.val); } }; // }}} // print containers {{{ template <typename It> void print(ostream& os, It begin, It end, u64 len, u64 limit = 17) { u64 count = 0; os << "{"; while (begin != end && count < limit) { os << "(" << *begin << ")"; count++; begin++; } if (begin != end) os << "... " << len << " total"; os << "}"; } #define MAKE_PRINTER_1(container) \ template <typename T> ostream& operator<<(ostream& os, const container<T>& t) { print(os, t.begin(), t.end(), t.size()); return os; } #define MAKE_PRINTER_2(container) \ template <typename T1, typename T2> \ ostream& operator<<(ostream& os, const container<T1, T2>& t) { \ print(os, t.begin(), t.end(), t.size()); \ return os; \ } MAKE_PRINTER_1(vector) MAKE_PRINTER_2(map) MAKE_PRINTER_1(set) MAKE_PRINTER_2(unordered_map) MAKE_PRINTER_1(unordered_set) #undef MAKE_PRINTER_1 #undef MAKE_PRINTER_2 // }}} // read/write {{{ template <typename T> T read() { T e; cin >> e; return e; } void read() {} template <typename T, typename ...Ts> void read(T& v, Ts& ...ts) { v = read<T>(); read(ts...); } template <typename T> vector<T> readv(u64 n) { vector<T> v; for (u64 i = 0; i < n; i++) v.push_back(read<T>()); return v; } template <typename T> struct identity { const T& operator()(const T& t) const { return t; } }; #define PRINTERS(FNAME, OUTP) \ template <typename T> void FNAME(const T& t) { OUTP << t << ' '; } \ void FNAME##ln() { OUTP << '\n'; } \ template <typename T> void FNAME##ln(const T& t) { OUTP << t << '\n'; } \ template <typename T, typename F = identity<typename T::value_type>> \ void FNAME##v(const T& t, F f = F()) { for (const auto& e : t) FNAME(f(e)); FNAME##ln(); } PRINTERS(print, cout) #ifdef DEBUG_PRINTS PRINTERS(dprint, cerr) #else # define dprint(...) # define dprintv(...) # define dprintln(...) #endif /// }}} // range, len, max {{{ vi range(i64 start, i64 end) { vi v; for (i64 i = start; i < end; i++) v.push_back(i); return v; } vi range(i64 end) { return range(0, end); } template <typename DS> i64 len(DS t) { return (i64)t.size(); } template <typename DS> i64 tmax(DS t) { if (t.empty()) { dprintln("'max' on empty range, returning 0."); return 0; } return *max_element(t.begin(), t.end()); } // }}} i64 gp10(i64 b) { if (b >= 21) b = 21; i64 res = pow(static_cast<double>(10), b); if (res % 10 == 9) ++res; return res; } i64 cdigs(i64 x) { if (x == 0) return 0; i64 res = 1; while (x /= 10) ++res; return res; } struct Exp { i64 a, k, b; i64 da; i64 value() const { if (k >= 21) return 42ll; // return 42ll; return a * gp10(k) + b; } i64 full_len() const { return da + k; } i64 get_prefix(i64 digs) const { ci64 adigs = da; ci64 full_len = adigs + k; if (digs >= full_len) return value(); if (digs <= adigs) return a / gp10(adigs - digs); i64 res = a * gp10(digs - adigs); res = res + b / gp10(full_len - digs); return res; } void increment() { ++b; if (b != gp10(k)) return; ++a; if (a == gp10(da)) ++da; b = 0; } }; i64 max(i64 a, i64 b) { return a < b ? b : a; } void go() { ci64 n = read<i64>(); // ci64 n = 13; // dprintln(cdigs(1)); // dprintln(cdigs(10)); // dprintln(cdigs(99)); // dprintln(cdigs(666)); //println("here"); // { // Exp e = {47, 2, 0}; // dprint(e.a); dprint(e.k); dprintln(e.b); // dprintln(e.value()); // e.increment(); // dprint(e.a); dprint(e.k); dprintln(e.b); // dprintln(e.value()); // dprintln(e.get_prefix(3)); // } // return; Exp e = {}; i64 res = 0; for (ci64 i : range(n)) { e.increment(); ci64 x = read<i64>(); i64 xdigs = cdigs(x); i64 e_full_len = e.full_len(); //ci64 epref = x; ci64 epref = e.get_prefix(xdigs); if (epref < x) { e.k = max(0ll, e_full_len - xdigs); e.a = x; e.da = xdigs; e.b = 0; } else if (epref > x) { e.k = max(0ll, e_full_len - xdigs + 1ll); e.a = x; e.da = xdigs; e.b = 0; } //dprint(e.a); dprint(e.k); dprint(e.b); res += e.full_len() - xdigs; dprintln(e.value()); // dprint(e.a); dprint(e.k); dprintln(e.b); } println(res); // while (true) { // Exp e; // dprintln("provide a, k, b"); // read(e.a, e.k, e.b); // while (true) { // dprint("value:"); dprintln(e.value()); // string s; // dprintln("e - provide again; i - increment; p <num> - prefix"); // read(s); // if (!s.size() || s[0] == 'e') // break; // if (s[0] == 'i') // e.increment(); // else { // print("prefix:"); println(e.get_prefix(read<i64>())); // } // } // } } int main () { // {{{ ios_base::sync_with_stdio(0); cin.tie(0); go(); } // |