Teacup rim text: Difference between revisions
m
Minor edit to C++ code
(Added Java solution) |
m (Minor edit to C++ code) |
||
Line 107:
break;
teacup_words.push_back(word);
found.insert(word);▼
}
if (teacup_words.size() == len) {
std::cout << teacup_words[0];
for (size_t i = 1; i < len; ++i)
| |||