个人练习-PAT甲级-1132 Cut Integer

题目链接https://pintia.cn/problem-sets/994805342720868352/problems/994805347145859072

题目大意：给一个十进制整数Z，位数为偶数，将其对等拆分为前半部分a和b，判断Z是否能被a*b整除

简单题，注意a*b == 0的情况单独判断即可

完整代码

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 


using namespace std;



int main() {
    int N;
    scanf("%d", &N);

    for (int i = 0; i < N; i++) {
        string Z;
        cin>>Z;
        int z = stoi(Z);
        int a = stoi(Z.substr(0, Z.length()/2));
        int b = stoi(Z.substr(Z.length()/2));

        if (a*b == 0) {
            printf("No\n");
            continue;
        }

        if (z % (a*b) == 0)
            printf("Yes\n");
        else
            printf("No\n");
    }



    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43