1132 Cut Integer (20point(s)) - C语言 PAT 甲级

1132 Cut Integer (20point(s))

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

3
167334
2333
12345678

Sample Output:

Yes
No
No

题目大意：

输入 N 个正整数，等分成 A、B 两部分，

判断 N 能否被 A 和 B 的乘积整除

设计思路：

以字符串的形式读入数据 N

• 分成前后两部分判断
• 注意判断 A、B 不能为 0

编译器：C (gcc)

#include <stdio.h>
#include <string.h>

int main(void)
{
        char s[11] = {0};
        int n, len;
        long long z, a, b;

        scanf("%d", &n);
        while (n--) {
                scanf("%s", s);
                len = strlen(s);
                z = atol(s);
                b = atol(s + len / 2);
                s[len / 2] = '\0';
                a = atol(s);
                if (a != 0 && b != 0 && z % (a * b) == 0)
                        printf("Yes\n");
                else
                        printf("No\n");
        }
        return 0;
}