#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<vector<int> > VVI;
const int INFTY=20000000;
const int MAX=1000100;
const int MOD=10000000;
void coutTab(int* tab,int n){
loop(i,0,n){
cout<<tab[i]<<" ";
}
cout<<"\n";
}
template<class T> void coutVec(vector<T> tab){
for(T t : tab){
cout<<t<<" ";
}
cout<<"\n";
}
//------------------------------------------
int a[MAX],b[MAX],c[MAX];
int main(){
ios_base::sync_with_stdio(0);
string A,B,C;
cin>>A>>B>>C;
int n=SIZE(A);
loop(i,0,n){
a[n-i-1]=A[i]-'0';
b[n-i-1]=B[i]-'0';
c[n-i-1]=C[i]-'0';
}
ll cnt0=0,cnt1=0,res=0;
loop(k,0,n){
cnt0++;
ll new_cnt0=0,new_cnt1=0;
int s0=a[k]+b[k];
if(s0%10==c[k]){
if(s0/10==0){ res+=cnt0; new_cnt0+=cnt0; }
else new_cnt1+=cnt0;
}
int s1=s0+1;
if(s1%10==c[k]){
if(s1/10==0){ res+=cnt1; new_cnt0+=cnt1; }
else new_cnt1+=cnt1;
}
cnt0=new_cnt0;
cnt1=new_cnt1;
}
pln(res);
}
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 | #include<bits/stdc++.h> #define VAR(i,n) __typeof(n) i = (n) #define loop(i,j,s) for(int i=j;i<s;i++) #define loopback(i,j,s) for(int i=j;i>=s;i--) #define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++) #define pln( x ) cout << x << "\n" #define ps( x ) cout << x << " " #define entr cout << "\n" #define pcnt(i) __builtin_popcount(i) #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second #define SIZE(c) (c).size() #define ALL(c) (c).begin(), (c).end() using namespace std; typedef vector<int> VI; typedef pair<int, int> PII; typedef vector<vector<int> > VVI; const int INFTY=20000000; const int MAX=1000100; const int MOD=10000000; void coutTab(int* tab,int n){ loop(i,0,n){ cout<<tab[i]<<" "; } cout<<"\n"; } template<class T> void coutVec(vector<T> tab){ for(T t : tab){ cout<<t<<" "; } cout<<"\n"; } //------------------------------------------ int a[MAX],b[MAX],c[MAX]; int main(){ ios_base::sync_with_stdio(0); string A,B,C; cin>>A>>B>>C; int n=SIZE(A); loop(i,0,n){ a[n-i-1]=A[i]-'0'; b[n-i-1]=B[i]-'0'; c[n-i-1]=C[i]-'0'; } ll cnt0=0,cnt1=0,res=0; loop(k,0,n){ cnt0++; ll new_cnt0=0,new_cnt1=0; int s0=a[k]+b[k]; if(s0%10==c[k]){ if(s0/10==0){ res+=cnt0; new_cnt0+=cnt0; } else new_cnt1+=cnt0; } int s1=s0+1; if(s1%10==c[k]){ if(s1/10==0){ res+=cnt1; new_cnt0+=cnt1; } else new_cnt1+=cnt1; } cnt0=new_cnt0; cnt1=new_cnt1; } pln(res); } |
English