find the length of the longest subsequence of successive rolls, in which the value 6 does not occur

manpreet Best Answer 2 years ago

manpreet 2 years ago

One solution is to tokenize your input. Then finding the largest size.

Part example using boost:

for (const auto & token : input_range | boost::adaptors::tokenized( six_expr, sub_ranges)) {
    std::cout << token.size() << std::endl;
}

Then it is just a matter of finding the longest tokens.