1132 Cut Integer

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 <). 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

题意：

　　将一个数分成前后等长的两部分，判断原来的数能不能整除分后的两部分的乘积。

思路：

　　以为所给的测试样例最大就到2^31所以可以不用大数乘法，直接求解救好了。注意为0的情况。

Code：

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    cin >> n;
    long long a, b, c;
    string str;
    for (int i = 0; i < n; ++i) {
        cin >> str;
        int len = str.length();
        a = stoll(str.substr(0, len / 2));
        b = stoll(str.substr(len / 2));
        c = stoll(str);
        if (a == 0 || b == 0 || c == 0) cout << "No" << endl;
        else {
            if (c % (a * b) == 0)
                cout << "Yes" << endl;
            else
                cout << "No" << endl;
        }
    }

    return 0;
}