/*
* @Author: 365JHWZGo
* @Description: 1016 部分A+B (15 分)
* @Date: 2021-09-13 14:11:45
* @FilePath: \VScodeC++practice\PAT\partA+B.cpp
* @LastEditTime: 2021-09-13 14:41:57
* @LastEditors: 365JHWZGo
*/
#include <iostream>
#include <stack>
#include <algorithm>
#include <math.h>
using namespace std;
void findNum(stack<int> &s, int A, int Da)
{
while (A != 0)
{
int temp = A % 10;
if (temp == Da)
s.push(temp);
A /= 10;
}
}
int returnResult(stack<int> &s)
{
int i = 0, result = 0;
while (!s.empty())
{
result += s.top() * pow(10, i);
i++;
s.pop();
}
return result;
}
int main()
{
int A, Da, B, Db;
long long int result1, result2;
stack<int> s;
cin >> A >> Da >> B >> Db;
findNum(s, A, Da);
result1 = returnResult(s);
findNum(s, B, Db);
result2 = returnResult(s);
cout<<result1+result2;
return 0;
}
1016 部分A+B (15 分)
最新推荐文章于 2024-06-12 11:17:56 发布