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.

## Input Specification:

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.

## Output Specification:

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<iostream>
#include<string>

using namespace std;

bool check(string num) {
int k = num.length();
int mid = k / 2, left = 0, right = 0;
left = stoi(num.substr(0, mid));
right = stoi(num.substr(mid));
if (left == 0 || right == 0) return false;
int num1 = stoi(num);
return num1 % (right*left) == 0;
}

int main()
{
int n;
string num;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
printf("%s\n", check(num) ? "Yes" : "No");
}
return 0;
}