1132 Cut Integer (20分)-CSDN博客

本文链接：https://blog.csdn.net/little_small_joze/article/details/107425517

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:

Sample Output:

Yes
No
No

思路：直到现在我还没有读懂题目。不知道如果切开以后子串中有前导零算不算长度不符合要求，看样子好像不需要考虑这个。如果需要考虑就要判断一下位数。

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n, sn;
    string s, a, b;
    cin>>n;
    for(int i=0; i<n; ++i){
        cin>>s;
        int len = s.length();
        a = s.substr(0, len/2);
        b = s.substr(len/2, len/2);
        long long aa = stoll(a), bb=stoll(b), cc=stoll(s);
        if(aa && bb){
            if(cc%(aa*bb)==0) puts("Yes");
            else puts("No");
        }else puts("No");
    }
    return 0;
}