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.
Sample Input:
3
167334
2333
12345678
Sample Output:
Yes
No
No
思路
注意分母为0的情况,对应测试点2、3
#include <iostream>
#include <vector>
#include <map>
#include <set>
using namespace std;
bool judge(int);
int main()
{
int N;
cin >> N;
for (int i = 0; i < N; i++)
{
int num;
cin >> num;
if (judge(num))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
system("pause");
return 0;
}
bool judge(int n)
{
int copy = n, cnt = 0;
while (copy)
{
cnt++;
copy /= 10;
}
cnt /= 2;
int num = 1;
while (cnt)
{
num *= 10;
cnt--;
}
int b = n % num, a = n / num;
if (a == 0 || b == 0 || (n % (a * b)) != 0)
return false;
return true;
}