PAT 1132 Cut Integer（20 分）（字符串）

最新推荐文章于 2020-07-18 10:50:42 发布

littlefox993

最新推荐文章于 2020-07-18 10:50:42 发布

阅读量157

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/weixin_42671353/article/details/82286668

版权

PAT 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

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

题解：学到stoi()函数 ,头文件#include<string>;to_string()数值转换字符串函数（C++11支持）。

代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int x;
        cin>>x;
        string s=to_string(x);
        int len=s.length();
        int a=stoi(s.substr(0,len/2));
        int b=stoi(s.substr(len/2));
        if(a*b!=0&&x%(a*b)==0)
            cout<<"Yes"<<endl;
        else
            cout<<"No"<<endl;
    }
    return 0;
}