Cutting an integer means to cut a K digits long 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 x 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<=2³¹). 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.

Sample Input:

3

167334

2333

12345678

Sample Output:

Yes

No

No

思路
水题
1.首先如果输入的数Z的位数为奇数肯定不满足条件，输出No。
2.如果A乘B为0，肯定不满足条件，输出No
3.剩下情况检查Z % (A*B) 是否为0即可。
代码

#include<iostream>

#include<string>

using namespace std;

int main()

{

  int N;

  while(cin >> N)

  {

      while(N--)

      {

          string num;

          cin >> num;

          int len = num.size();

          if(len %  == )

          {

              cout << "No" << endl;

              continue;

          }

          string a = num.substr(,len/);

          string b = num.substr(len/,len/);

          int A = stoi(a),B = stoi(b),Z = stoi(num);

          if(A * B !=  && Z % (A * B) == )

          {

              cout << "Yes" << endl;

          }

          else

              cout << "No" << endl;

      }

  }

}