保姆级解法
2026-01-26 10:34:42
发布于:广东
2阅读
0回复
0点赞
首先,考虑到黑洞会坍塌,时空会毁灭 作者可能会 Q规则 坑我们,所以应用以下代码:
#include <iostream>
#include <vector>
#include <string>
using std::cout;
using std::cin;
using std::endl;
using std::vector;
using std::string;
class AB{
private:
vector<int> add(const vector<int>& a, const vector<int>& b) {
vector<int> res;
int carry = 0;
int i = 0;
while (i < a.size() || i < b.size() || carry > 0) {
int sum = carry;
if (i < a.size()) sum += a[i];
if (i < b.size()) sum += b[i];
res.push_back(sum % 10);
carry = sum / 10;
i++;
}
return res;
}
vector<int> stb(const string& s) {
vector<int> res;
for (int i = s.size() - 1; i >= 0; i--) {
res.push_back(s[i] - '0');
}
return res;
}
public:
AB(bool YES_RUN_GO){
if(YES_RUN_GO){
string A,B;
cin>>A>>B;
vector<int> a = this->stb(A);
vector<int> b = this->stb(B);
vector<int> c = this->add(a,b);
for(int i = c.size()-1;i>=0;i--){
cout<<c[i];
}
cout<<endl;
}
}
};
static bool AB_PROBLEM_YES=true;
int main(int argc,const char* argv[]){
AB * ab = new AB(AB_PROBLEM_YES);
delete ab;
}
这里空空如也




有帮助,赞一个