题目大意:给定n个字符串,判断每个字符串能否用其他两个字符串相加而得(两个字符串可以相同)
输出为一个二进制数,1表示第i个字符串可以由其他字符串相加而得,0反之
考虑用STL中的map记录该种字符串是否存在,每次枚举时用substr截取改字符串的前半段和后半段,均存在则输出1,反之输出0
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 200010, M = 200010, INF = 0x3f3f3f3f;
string s[N];
void solve() {
map <string, bool> mp;
int n;
cin >> n;
for (int i = 1; i <= n; ++ i) {
cin >> s[i];
mp[s[i]] = 1;
}
for (int i = 1; i <= n; ++ i) {
bool f = 0;
for (int j = 1; j < s[i].size(); ++ j) {
string pres = s[i].substr(0, j), lasts = s[i].substr(j, s[i].size() - j);
// 截取前半段和后半段,判断是否均出现在 mp 中
if (mp[pres] && mp[lasts]) {
f = 1;
break;
}
}
cout << f ;
}
cout << endl;
}
int main(){
int T = 1;
cin >> T;
while (T -- )
solve();
return 0;
}