找出11-999范围内的数m,满足m,m^2,m^3均为回文数（C++）

#include <iostream>
using namespace std;

// 判断n是否为回文数
bool symm(unsigned n){
    unsigned i=n;
    unsigned m=0;
    while(i>0){
        m=m*10+i%10;
        i/=10;
    }
    return m==n;
}

int main()
{
    for(unsigned m=11;m<1000;m++){
        if(symm(m)&&symm(m*m)&&symm(m*m*m)){
            cout<<"m="<<m;
            cout<<" m^2="<<m*m;
            cout<<" m^3="<<m*m*m<<endl;
        }
    }
    return 0;
}

运行结果：