PAT (Advanced Level) 1024 Palindromic Number (大数加法)

模拟大数加法

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
string n;
int k, cnt = 0;
string add(string x, string y){
	string res = "";
	int len = x.size();
	int curx, cury, flag = 0, tmp;
	for(int i = len-1; i >= 0; --i){
		curx = x[i] - '0'; cury = y[i] - '0';
		tmp = curx + cury + flag;
		if(tmp > 9) flag = 1;
		else flag = 0;
		res.insert(res.begin(),tmp%10+'0');
	}
	if(flag)
		res.insert(res.begin(),flag+'0');
//	cout << res << endl;
	return res;
}
int main(){
	cin >> n >> k;
	string s;
	for(int i = 1; i <= k; i++){
		s = n;
		reverse(n.begin(),n.end());
		if(s == n){
			break;
		}
		else{
			n = add(s,n);
			cnt++;
		}
	}
	cout << n << endl << cnt;
	return 0;
}