Cutting an integer means to cut a K digits lone integer Z into two integers of (K/2) digits long integers A and B. For example, after cutting Z = 167334, we have A = 167 and B = 334. It is interesting to see that Z can be devided by the product of A and B, as 167334 / (167 × 334) = 3. Given an integer Z, you are supposed to test if it is such an integer.
Each input file contains one test case. For each case, the first line gives a positive integer N (≤ 20). Then N lines follow, each gives an integer Z (10 ≤ Z <231 ). It is guaranteed that the number of digits of Z is an even number.
For each case, print a single line Yes if it is such a number, or No if not.
3
167334
2333
12345678
Yes
No
No
#include
using namespace std;
void judge(string s){
int t=s.size()/2;
int a=stoi(s.substr(0,t));
int b=stoi(s.substr(t,t));
int c=stoi(s);
if(b==0)printf("No\n");
else{
if(c%(a*b)==0)printf("Yes\n");
else printf("No\n");
}
}
int main(){
int N;
scanf("%d",&N);
string s;
for (int i=0;i<N;i++){
cin>>s;
judge(s);
}
return 0;
}