题目1183：守形数

PRoblem:

Solution:

#include <iostream>#include <string>using namespace std;int main(){    int m;    while(cin >> m)    {        int n = m * m;        string ss = to_string(n);        string kk = to_string(m);        int len_n = ss.size();        int len_m = kk.size();        int i,j;        bool flag = true;        for (i = len_m-1,j = len_n-1;i >= 0;i--,j--)        {            if (ss[j] != kk[i])            {                flag = false;                break;            }        }        if (flag) cout << "Yes!" << endl;        else cout << "No!" << endl;    }    return 0;}