#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
vector<int> tv(string s) {
vector<int> ans;
for(auto c : s) {
ans.push_back(c - '0');
}
return ans;
}
void solve() {
string sa, sb, sc;
cin >> sa >> sb >> sc;
vector<int> a = tv(sa);
vector<int> b = tv(sb);
vector<int> c = tv(sc);
ll zero = (a[0] + b[0] == c[0]);
ll one = (a[0] + b[0] + 1 == c[0]);
ll ans = zero;
int n = a.size();
for(int i = 1; i < n; i++) {
ll nz = 0;
ll no = 0;
ll v = a[i] + b[i];
if(v % 10 == c[i]) {
if(v < 10) {
nz = zero + 1;
}
else {
nz = one;
}
}
v++;
if(v % 10 == c[i]) {
if(v < 10) {
no = zero + 1;
}
else {
no = one;
}
}
one = no;
zero = nz;
ans += zero;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//freopen("in", "r", stdin);
solve();
}
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 | #include <bits/stdc++.h> using namespace std; using ll = int64_t; vector<int> tv(string s) { vector<int> ans; for(auto c : s) { ans.push_back(c - '0'); } return ans; } void solve() { string sa, sb, sc; cin >> sa >> sb >> sc; vector<int> a = tv(sa); vector<int> b = tv(sb); vector<int> c = tv(sc); ll zero = (a[0] + b[0] == c[0]); ll one = (a[0] + b[0] + 1 == c[0]); ll ans = zero; int n = a.size(); for(int i = 1; i < n; i++) { ll nz = 0; ll no = 0; ll v = a[i] + b[i]; if(v % 10 == c[i]) { if(v < 10) { nz = zero + 1; } else { nz = one; } } v++; if(v % 10 == c[i]) { if(v < 10) { no = zero + 1; } else { no = one; } } one = no; zero = nz; ans += zero; } cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); //freopen("in", "r", stdin); solve(); } |
English