#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
bool StringContain(string &a,string &b){
const int p[26] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31,
37, 41, 43, 47, 53, 59, 61, 67, 71, 73,
79, 83, 89, 97, 101 };
int f = 1;
for (int i = 0; i < a.length(); ++i){
int x = p[a[i] - 'a'];
if (f%x){
f *= x;
}
}
for (int i = 0; i < b.length(); ++i){
int x = p[b[i] - 'a'];
if (f%x){
return false;
}
}
return true;
}
int main()
{
string a, b;
cin >> a;
cin >> b;
bool c;
c=StringContain(a, b);
if (c == true)
cout << "true";
else
cout << "error";
#include<string>
#include<algorithm>
using namespace std;
bool StringContain(string &a,string &b){
const int p[26] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31,
37, 41, 43, 47, 53, 59, 61, 67, 71, 73,
79, 83, 89, 97, 101 };
int f = 1;
for (int i = 0; i < a.length(); ++i){
int x = p[a[i] - 'a'];
if (f%x){
f *= x;
}
}
for (int i = 0; i < b.length(); ++i){
int x = p[b[i] - 'a'];
if (f%x){
return false;
}
}
return true;
}
int main()
{
string a, b;
cin >> a;
cin >> b;
bool c;
c=StringContain(a, b);
if (c == true)
cout << "true";
else
cout << "error";
}
时间复杂度O(m+n)
整数溢出问题