题解 | #守形数#

#include<stdlib.h>
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<string.h>
#include<math.h>
#include<vector>
using namespace std;
typedef long long LL;
const int MAXN=1e5+10;
int main(){
    int x;
    while(cin>>x){
        int num=x*x;
        string s=to_string(x);
        string numl=to_string(num);
        int len1=s.size();
        int len2=numl.size();
        string hh=numl.substr(len2-len1,len1);
        if(s==hh)cout<<"Yes!";
        else cout<<"No!";
        cout<<endl;
    }

    return 0;
}