Words from neighbour ones: Difference between revisions

Line 187:

=={{header|C++}}==

<lang cpp>#include <algorithm>

#include <cstdlib>

Line 194:

Line 195:

#include <string>

#include <vector>

#include <boost/circular_buffer.hpp>

// The input file must consist of one word per line in alphabetical order.

int main(int argc, char** argv) {

const int min_length = 9;

Line 204:

Line 207:

}

std::string line;

~~std~~::~~vector~~<std::string> words;

boost::circular_buffer<std::string> words(min_length);

⚫

while (getline(in, line)) {

⚫

if (line.size() >= min_length)

⚫

words.push_back(line);

}

std::sort(words.begin(), words.end());

std::string previous_word;

int count = 0;

⚫

while (getline(in, line)) {

⚫

~~for~~ ~~(size_t~~ i = ~~0, n =~~ words.size(); ~~i +~~ min_length ~~<= n; ++i~~) {

⚫

if (line.size() < min_length)

continue;

⚫

words.push_back(line);

⚫

if (words.size() < min_length)

continue;

std::string word;

word.reserve(min_length);

for (size_t j = 0; j < min_length; ++j)

for (size_t i = 0; i < min_length; ++i)

word += words[i ~~+ j~~][j];

word += words[i][i];

if (previous_word == word)

continue;

auto w = std::~~lower_bound~~(words.begin(), words.end(), word);

auto it = std::find(words.begin(), words.end(), word);

if (w != words.end() ~~&& *w == word~~)

if (it != words.end())

std::cout << std::setw(2) << ++count << ". " << word << '\n';

previous_word = word;