题目大意:
给出一个偶数位的数字,分成两部分,看原数字能否整除被分成两部分的数字乘积
代码:
#include <iostream>
#include <string>
using namespace std;
string s;
int N,Z, A, B;
int main() {
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> s;
int l = s.size();
Z=stoi(s);
A=stoi(s.substr(0,l/2));
B=stoi(s.substr(l/2,l/2));
if(B &&(Z%(A*B)==0))
cout << "Yes" << endl;
else
cout<<"No"<<endl;
}
}