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
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
while (n--)
{
string s, a, b;
cin >> s;
int l = s.size();
a = s.substr(0, l / 2);
b = s.substr(l / 2, l / 2);
long long z, x, y;
z = stol(s), x = stol(a), y = stol(b);
if (x != 0 && y != 0 && z % (x*y) == 0) puts("Yes");
else puts("No");
}
return 0;
}

293

被折叠的 条评论
为什么被折叠?



