Palindromic Squares 回文平方数

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> jinzhizhuanhua(int number,int b)
{
	vector<int> v;
	int chushu = 1,yushu;
	while(chushu!=0)
	{
		chushu = number / b;
		yushu = number % b;
		v.push_back(yushu);
		number = chushu;
	}
	vector<int>::iterator iter = v.begin();
	reverse(v.begin(),v.end());
	return v;
}

bool huiwen(vector<int>& v)
{
	int length;
	length = v.end() - v.begin();
	int i,j;
	for(i=0,j=length-1;i<j;i++,j--)
	{
		if(v[i] == v[j])
			continue;
		else
			break;
	}
	if(i >= j )
		return true;
	else
		return false;
}

int main(int argc, char const *argv[])
{
	cout<<'B'<<endl;
	int b;
	cin>>b;
	int i;
	vector<int> v1,v2;
	for(i=1;i<=300;i++)
	{
		v1 = jinzhizhuanhua(i*i,b);
		if(huiwen(v1))
		{
			v2 = jinzhizhuanhua(i,b);
			vector<int>::iterator iter = v2.begin();
			for(iter = v2.begin();iter != v2.end();iter++)
			{
				if(*iter >= 10)
				{
					cout<<char('A'+(*iter-10));
				}
				else
					cout<<(*iter);
			}
			cout<<' ';
			for(iter = v1.begin();iter != v1.end();iter++)
			{
				if(*iter >= 10)
				{
					cout<<char('A'+(*iter-10));
				}
				else
					cout<<(*iter);
			}
			cout<<endl;	
		}
	}
	return 0;
}