1079 延迟的回文数

题目链接
注意点：
1.利用了昨天新学到的reverse，但他不能把反转后的结果赋给另一个字符串；
所以我利用了两次反转；

            string b;
			reverse(s.begin(), s.end());//发现不能直接反转
			b = s;
			reverse(s.begin(), s.end());

2.手动模拟加法；如果最后有进位，要化成字符加入字符串的最前面；这里利用string，可方便地实现这一点；

#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<stack>
#include<math.h>
#include<vector>
using namespace std;
int main() {
	string s;
	cin >> s;
	int k = s.size();
	k -= 1;
	int flag = 0;//用来判断回文；
	for (int i = 0;i < s.size() / 2;i++)
	{
		if (s[i] == s[k - i]) continue;
		else {
			flag = 1;
			break;
		}
	}
	if (flag == 0) cout << s << " is a palindromic number." << endl;
	//第一次的初始回文判断，若不是，则进入循环判断；
	else{
		int count = 0;
		while (count != 10)
		{   //模拟加法；
			string b;
			reverse(s.begin(), s.end());//发现不能直接反转
			b = s;
			reverse(s.begin(), s.end());
			cout << s << " + " << b;
			int c = 0;//进位数
			for (int i = s.size() - 1;i >= 0;i--)
			{
				int x = s[i] - '0' + b[i] - '0' + c;
				if (x <= 9) { s[i] = x + '0';c = 0; }
				else {
					c = 1;
					s[i] = x - 10 + '0';
				}
			}
			if (c > 0) {//还有进位
				char jinwei = c + '0';
				s = jinwei + s;
			}
			cout << " = " << s << endl;
			int k = s.size();
			k -= 1;
			int flag = 0;//用来判断回文；
			for (int i = 0;i < s.size()/2;i++)
			{
				if (s[i] == s[k - i]) continue;
				else {
					flag = 1;
					break;
				}
			}
			if (flag == 0)
			{
				cout << s << " is a palindromic number." << endl;
				break;
			}
			count++;
		}
		if (count == 10) cout << "Not found in 10 iterations." << endl;
	}
		return 0;
	}