蓝桥 特殊回文数

暴力枚举

 

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<map>
map<char, int> mp;
#include<bitset>
#include<iomanip>

int main()
{

	int n;
	cin >> n;
	vector<int> v;
	for (int i = 1; i < 9; i++)
	{
		for (int j = 0; j < 9; j++)
		{
			for (int k = 0; k < 9; k++)
			{
				if (i * 2 + j * 2 + k == n)
				{
					int a;
					a = i * 10000 + j * 1000 + k * 100 + j * 10 + i;
					v.push_back(a);
				}

				if (i * 2 + j * 2 + k * 2 == n)
				{
					int a;
					a = i * 100000 + j * 10000 + k * 1000 + k * 100 + j * 10 + i;
					v.push_back(a);
				}
			}
		}
	}

	for (int i = 0; i < v.size(); i++)
	{
		cout << v[i] << endl;
	}
}