1132. Cut Integer (20)

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:

Sample Output:

Yes
No
No


代码：

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <map>
using namespace std;
int coun(int d)
{
    int c = 0;
    while(d)
    {
        c ++;
        d /= 10;
    }
    return c;
}
int main()
{
    int n,d;
    scanf("%d",&n);
    while(n --)
    {
        scanf("%d",&d);
        int s = coun(d),p = 1;
        s /= 2;
        for(int i = 0;i < s;i ++)
        p *= 10;
        s = (d/p)*(d%p);///如果是0不能做取模
        if(s && d % s == 0)printf("Yes
");
        else printf("No
");
    }
}