#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
auto &operator<<(auto &o, pair<auto, auto> p) {
return o << "(" << p.first << ", " << p.second <<")";
}
auto operator<<(auto &o, auto x)-> decltype(x.end(), o) {
o << "{";int i = 0;
for(auto e : x) o << ", "+!i++<<e;
return o <<"}";
}
#define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif
#define int long long
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define fi first
#define se second
typedef pair <int, int> pii;
void test() {
debug("TC______________________");
string a, b, c; cin>>a>>b>>c;
int n = sz(a);
vector <int> A(n+1);
vector <int> B(n+1);
vector <int> C(n+1);
for (int i=0; i<n; ++i) {
A[i] = a[i] - '0';
}
for (int i=0; i<n; ++i) {
B[i] = b[i] - '0';
}
for (int i=0; i<n; ++i) {
C[i] = c[i] - '0';
}
vector <int> pot(n);
vector <int> gen(n);
vector <int> z(n);
for (int i=0; i<n; ++i) {
int x = A[i] + B[i];
if ((x+1)%10 == C[i]) {
pot[i] = 1;
if (x >= 9) {
gen[i] = 1;
}
else {
gen[i] = 0;
}
}
else if (x%10 == C[i]) {
if (x >= 10) {
gen[i] = 1;
}
else {
gen[i] = 0;
}
}
else {
z[i] = 1;
debug(i, a[i], b[i], c[i], "zle");
}
}
int cng = 0;
int res = 0;
for (int i=0; i<n; ++i) {
if (z[i]) {
cng = 0;
continue;
}
if (pot[i] && gen[i+1]) {
if (!gen[i]) cng++;
}
else if (pot[i] && !gen[i+1]) {
cng = 0;
}
else if (!pot[i] && gen[i+1]) {
if (!gen[i]) cng++;
res += cng;
cng = 0;
}
else { // !pot && !gen
if (!gen[i]) cng++;
res += cng;
}
}
cout<<res<<'\n';
debug(pot);
debug(gen);
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int t = 1;
while (t--) {
test();
}
}
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 | #include <bits/stdc++.h> using namespace std; #ifdef DEBUG auto &operator<<(auto &o, pair<auto, auto> p) { return o << "(" << p.first << ", " << p.second <<")"; } auto operator<<(auto &o, auto x)-> decltype(x.end(), o) { o << "{";int i = 0; for(auto e : x) o << ", "+!i++<<e; return o <<"}"; } #define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x) #else #define debug(...) {} #endif #define int long long #define all(x) x.begin(), x.end() #define sz(x) (int)(x).size() #define pb push_back #define fi first #define se second typedef pair <int, int> pii; void test() { debug("TC______________________"); string a, b, c; cin>>a>>b>>c; int n = sz(a); vector <int> A(n+1); vector <int> B(n+1); vector <int> C(n+1); for (int i=0; i<n; ++i) { A[i] = a[i] - '0'; } for (int i=0; i<n; ++i) { B[i] = b[i] - '0'; } for (int i=0; i<n; ++i) { C[i] = c[i] - '0'; } vector <int> pot(n); vector <int> gen(n); vector <int> z(n); for (int i=0; i<n; ++i) { int x = A[i] + B[i]; if ((x+1)%10 == C[i]) { pot[i] = 1; if (x >= 9) { gen[i] = 1; } else { gen[i] = 0; } } else if (x%10 == C[i]) { if (x >= 10) { gen[i] = 1; } else { gen[i] = 0; } } else { z[i] = 1; debug(i, a[i], b[i], c[i], "zle"); } } int cng = 0; int res = 0; for (int i=0; i<n; ++i) { if (z[i]) { cng = 0; continue; } if (pot[i] && gen[i+1]) { if (!gen[i]) cng++; } else if (pot[i] && !gen[i+1]) { cng = 0; } else if (!pot[i] && gen[i+1]) { if (!gen[i]) cng++; res += cng; cng = 0; } else { // !pot && !gen if (!gen[i]) cng++; res += cng; } } cout<<res<<'\n'; debug(pot); debug(gen); } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) { test(); } } |
English