#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define mp make_pair
signed main()
{
//legenda :
//1 -> jest cacy
//2 -> wymaga przeniesienia
//3 -> nie dziala
//4 -> przenosi i dziala
//5 -> przenosi i wymaga przeniesienia
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string a , b , c;
cin >> a >> b >> c;
int n = a.size();
int ans = 0;
vector <int> dp(7 , 0);
for(int i = n - 1; i >= 0; i--)
{
int sum = a[i] - '0';
sum += b[i] - '0';
int target = c[i] - '0';
if(sum == target)
{
dp[1]++;
dp[2] = 0;
}
else if(sum + 1 == target)
{
dp[1] = dp[2];
dp[2] = 0;
}
else if(sum - 10 == target)
{
dp[2] = dp[1] + 1;
dp[1] = 0;
}
else if(sum - 10 + 1 == target)
{
dp[1] = 0;
}
else
{
dp[1] = 0;
dp[2] = 0;
}
ans += dp[1];
}
cout << ans;
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 48 49 50 51 52 53 54 55 | #include <bits/stdc++.h> using namespace std; #define pb push_back #define int long long #define mp make_pair signed main() { //legenda : //1 -> jest cacy //2 -> wymaga przeniesienia //3 -> nie dziala //4 -> przenosi i dziala //5 -> przenosi i wymaga przeniesienia ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string a , b , c; cin >> a >> b >> c; int n = a.size(); int ans = 0; vector <int> dp(7 , 0); for(int i = n - 1; i >= 0; i--) { int sum = a[i] - '0'; sum += b[i] - '0'; int target = c[i] - '0'; if(sum == target) { dp[1]++; dp[2] = 0; } else if(sum + 1 == target) { dp[1] = dp[2]; dp[2] = 0; } else if(sum - 10 == target) { dp[2] = dp[1] + 1; dp[1] = 0; } else if(sum - 10 + 1 == target) { dp[1] = 0; } else { dp[1] = 0; dp[2] = 0; } ans += dp[1]; } cout << ans; return 0; } |
English