1132 Cut Integer (20 分)

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

思路:

一个偶数个位的正整数z,把它从中间分成左右两个整数a、b,问z能不能被a和b的乘积整除,能的话输出yes,不能的话输出no。判断一下a*b!=0才能取余,否则会出现错误

代码如下:

#include 
using namespace std;


int main(){
    int n,k,c;
    int a,b;
    string z;
    cin>>n;
    while (n--)
    {
        cin>>z;
        int len=z.length(),ans=stoi(z);
        a=stoi(z.substr(0,len/2));
        b=stoi(z.substr(len/2,len));
        if (a*b!=0&&(ans%(a*b))==0)
            cout<<"Yes"<

 

你可能感兴趣的:(PAT集训)