1132 Cut Integer (20 分)

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

#include <iostream>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
using namespace std;

int main(){
	
	int n;
	cin>>n;
	
	for(int i=0;i<n;i++){
		
		string s;
		
		cin>>s;
		
		long long sum1=0;
		for(int j=0;j<s.length()/2;j++){
			
			sum1=sum1*10+(s[j]-'0');
		}
		
		long long sum2=0;
		for(int j=s.length()/2;j<s.length();j++){
			
			sum2=sum2*10+(s[j]-'0'); 
		}
		
		long long res;
		stringstream str;
		str<<s;
		str>>res;
		
		if((sum1*sum2!=0)&&res%(sum1*sum2)==0){
			cout<<"Yes"<<endl;
		}
		else{
			cout<<"No"<<endl;
		}
	}
	
	
	return 0;
}

 //浮点错误小心！！因为分母可能为0