1132 Cut Integer（17行代码）

最新推荐文章于 2024-10-03 23:44:20 发布

我的多巴胺来自ac

最新推荐文章于 2024-10-03 23:44:20 发布

阅读量185

点赞数

分类专栏： pat甲级文章标签： c++

本文链接：https://blog.csdn.net/m0_66329385/article/details/131037836

版权

pat甲级专栏收录该内容

109 篇文章 1 订阅

订阅专栏

分数 20

全屏浏览题目

切换布局

作者 CHEN, Yue

单位浙江大学

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

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

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