#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
string A,B,C; ll n=0,spr=0,ans=0; vector<ll> suma,k,dp;
cin>>A>>B>>C; n=(int)A.size();
for(int i=n-1; i>=0; --i){suma.push_back((int)A[i]+(int)B[i]-96); k.push_back((int)C[i]-48); dp.push_back(0);}
for(int i=0; i<n; ++i)
{
if(suma[i]%10==k[i])++dp[i];
if(i>0)
{
if(suma[i-1]<=8){if(suma[i]%10==k[i]) dp[i]+=dp[i-1];}
else if(suma[i-1]>=10){if((suma[i]+1)%10==k[i]) dp[i]+=dp[i-1];}
else
{
if(k[i-1]==9){if(suma[i]%10==k[i]) dp[i]+=dp[i-1];}
else if (k[i-1]==0){if((suma[i]+1)%10==k[i]) dp[i]+=dp[i-1];}
}
}
}
for(int i=0; i<n; ++i)
{
if(i>0)
{
if(suma[i]<=8){ans+=dp[i];}
else if(suma[i]>=10){}
else
{
if(k[i]==9){ans+=dp[i];}
}
}
else if(suma[i]==k[i]) ++ans;
}
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int MAKUMBA=1;
//cin>>MAKUMBA;
for(int KOKOJAMBO=0; KOKOJAMBO<MAKUMBA; ++KOKOJAMBO){solve();}
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 | #include<bits/stdc++.h> using namespace std; typedef long long ll; void solve() { string A,B,C; ll n=0,spr=0,ans=0; vector<ll> suma,k,dp; cin>>A>>B>>C; n=(int)A.size(); for(int i=n-1; i>=0; --i){suma.push_back((int)A[i]+(int)B[i]-96); k.push_back((int)C[i]-48); dp.push_back(0);} for(int i=0; i<n; ++i) { if(suma[i]%10==k[i])++dp[i]; if(i>0) { if(suma[i-1]<=8){if(suma[i]%10==k[i]) dp[i]+=dp[i-1];} else if(suma[i-1]>=10){if((suma[i]+1)%10==k[i]) dp[i]+=dp[i-1];} else { if(k[i-1]==9){if(suma[i]%10==k[i]) dp[i]+=dp[i-1];} else if (k[i-1]==0){if((suma[i]+1)%10==k[i]) dp[i]+=dp[i-1];} } } } for(int i=0; i<n; ++i) { if(i>0) { if(suma[i]<=8){ans+=dp[i];} else if(suma[i]>=10){} else { if(k[i]==9){ans+=dp[i];} } } else if(suma[i]==k[i]) ++ans; } cout<<ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int MAKUMBA=1; //cin>>MAKUMBA; for(int KOKOJAMBO=0; KOKOJAMBO<MAKUMBA; ++KOKOJAMBO){solve();} return 0; } |
English