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 <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:
3
167334
2333
12345678
Sample Output:
Yes
No
No
题目大意:
给出n个长整数,已经保证是复数了,请问能不能被所分出来的两个整数整除呢?
思路:
用string存储后,找到一半的长度然后利用stoi来解决就好了。
留意有可能会产生0。
参考代码:
#include<string>
#include<iostream>
using namespace std;
int n;
string s;
int main(){
scanf("%d", &n);
for(int i = 0; i < n; ++i){
cin >> s;
int mid = s.size() / 2;
int a = stoi(s.substr(0, mid)), b = stoi(s.substr(mid, mid));
if(a * b == 0) printf("No\n");
else{
if(stoi(s) % (a * b)) printf("No\n");
else printf("Yes\n");
}
}
return 0;
}