『1132』Cut Integer-CSDN博客

本文链接：https://blog.csdn.net/weixin_52435933/article/details/128290783

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

Ω

给出一个具有偶数位数的整数P，将P拆成位数相同的前后两半A、B，如果P能够被A、B的乘积整除就输出Yes，反之输出No。

用字符串存储P，再用substr计算出AB。⚠️A or B为0时直接输出No，取余会发生“Float Point Exception“。

🐎

#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    string k;
    for (int i = 0; i < n; ++i)
    {
        cin >> k;
        if (!stoi(k.substr(0, k.size() / 2)) || !stoi(k.substr(k.size() / 2)))
            printf("No\n");
        else
            printf(stoi(k) % (stoi(k.substr(0, k.size() / 2)) * stoi(k.substr(k.size() / 2))) ? "No\n" : "Yes\n");
    }
}