#include <bits/stdc++.h> using namespace std; int n; long long wynik; string s1 = "", s2 = ""; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0, a; i < n; i++, s1.swap(s2)) { cin >> a; s2 = to_string(a); if (s1.size() > s2.size()) { bool p1 = false, p2 = false; for (int j = 0; j < s2.size(); j++) { if (s1[j] < s2[j]) { p1 = true; break; } if (s1[j] > s2[j]) { p2 = true; break; } } if (p1 || p2) { wynik += s1.size() - s2.size(); for (int i = s1.size(); i < s2.size(); i++) s2.append("0"); } if (p2) { s2.append("0"); wynik++; } if (!p1 && !p2) { bool p3 = false; for (int j = s1.size() - 1; j >= s2.size(); j--) { if (s1[j] == '9') s1[j] == '0'; else { s1[j]++; p3 = true; break; } } wynik += s1.size() - s2.size(); s2.append(s1.begin() + s2.size(), s1.end()); if (!p3) { s2.append("0"); wynik++; } } } else if (s1.size() == s2.size()) { bool p = false; for (int j = 0; j < s1.size(); j++) { if (s1[j] > s2[j]) break; if (s1[j] < s2[j]) { p = true; break; } } if (!p) { s2.append("0"); wynik++; } } } cout << wynik << '\n'; }
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 | #include <bits/stdc++.h> using namespace std; int n; long long wynik; string s1 = "", s2 = ""; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0, a; i < n; i++, s1.swap(s2)) { cin >> a; s2 = to_string(a); if (s1.size() > s2.size()) { bool p1 = false, p2 = false; for (int j = 0; j < s2.size(); j++) { if (s1[j] < s2[j]) { p1 = true; break; } if (s1[j] > s2[j]) { p2 = true; break; } } if (p1 || p2) { wynik += s1.size() - s2.size(); for (int i = s1.size(); i < s2.size(); i++) s2.append("0"); } if (p2) { s2.append("0"); wynik++; } if (!p1 && !p2) { bool p3 = false; for (int j = s1.size() - 1; j >= s2.size(); j--) { if (s1[j] == '9') s1[j] == '0'; else { s1[j]++; p3 = true; break; } } wynik += s1.size() - s2.size(); s2.append(s1.begin() + s2.size(), s1.end()); if (!p3) { s2.append("0"); wynik++; } } } else if (s1.size() == s2.size()) { bool p = false; for (int j = 0; j < s1.size(); j++) { if (s1[j] > s2[j]) break; if (s1[j] < s2[j]) { p = true; break; } } if (!p) { s2.append("0"); wynik++; } } } cout << wynik << '\n'; } |