UVaOJ 10391 – Compound Words

问题描述

解法一：集合+字符串子串

水题，直接用集合存储，扫描出每个符合条件的字符串即可。

#include <bits/stdc++.h>

using namespace std;

int main() {
  string s;
  set<string> words;
  while (cin >> s) words.insert(s);

  for (auto &word: words)
    for (int i = 0; i < word.size(); i++) 
      if (words.count(word.substr(0, i)) && words.count(word.substr(i))) {
        cout << word << endl;
        break;
      }
  return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {

string s;

set<string> words;

while (cin >> s) words.insert(s);

for (auto &word: words)

for (int i = 0; i < word.size(); i++)

if (words.count(word.substr(0, i)) && words.count(word.substr(i))) {

cout << word << endl;

break;

}

return 0;

}

#TODO

#TODO

AOAPC II UVaOJ

UVaOJ 10391 - Compound Words

问题描述

解法一：集合+字符串子串