题目
Cutting an integer means to cut a K digits long 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
题意
将一个偶数位数的数分成两截,问该数能否整除截断俩数的乘积
陷阱
如果分拆后有个数是0的话,要直接输出No
思路
分裂整数这种操作,适合用string的库函数来做。
c能不能整除(a*b)就是if(c%(a*b)==0)。
满分代码
#include<iostream>
using namespace std;
int n,l;
long long a,b,c;
string s;
int main(){
scanf("%d\n",&n);
while(n--){
cin>>s;
l=(int)s.size();
a=stoll(s.substr(0,l/2));
b=stoll(s.substr(l/2,l/2));
c=stoll(s);
if(a==0||b==0)cout<<"No"<<endl;
else if(c%(a*b)==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
如果喜欢我的文章,请给我点赞噢,欢迎评论!