|
N n(4);
while (n.hasNext()) std::cout << n.next() << "\t* " << std::bitset<4>(n.next()) << std::endl;
</lang>
{{out}}
5 * 0101
</pre>
I can count the length of the sequence:
<lang cpp>/*
Not best code, wrote it really quick. Will add updated code using more C++11 features soon!
*/
N n(31);
int z{};for (;n.hasNext();++z); std::cout << z << std::endl;
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
std::vector<int> sequence = { 0, 1, 2, 3, 4 };
std::vector<int> work = { 0 };
std::vector<std::vector<int>> results;
while (work != sequence) {
bool zeroed = false;
size_t index_zero_started = 0;
for (size_t i = 0; i < work.size(); ++i) {
if (work[i] >= sequence.size()) {
if (i == 0) {
work[i] = 0;
work.push_back(0);
index_zero_started = i;
} else {
++work[i - 1];
for (size_t j = i; j < work.size(); ++j) {
work[j] = 0;
}
index_zero_started = i - 1;
}
zeroed = true;
break;
}
}
if (zeroed) {
for (size_t i = index_zero_started + 1; i < work.size(); ++i) {
work[i] = work[i - 1] + 1;
}
} else {
std::vector<int> temp_differences;
std::adjacent_difference(std::begin(work), std::end(work), std::back_inserter(temp_differences));
if (std::find_if(std::begin(temp_differences) + 1, std::end(temp_differences),
[](const int& n) { return n > 1; }) != std::end(temp_differences)) {
results.push_back(work);
}
++work.back();
}
std::cout << "Non-continuous subsequences of ";
std::copy(std::begin(sequence), std::end(sequence), std::ostream_iterator<int>(std::cout, " "));
std::cout << std::endl;
for (auto& e: results) {
std::cout << "- ";
std::copy(std::begin(e), std::end(e), std::ostream_iterator<int>(std::cout, " "));
std::cout << std::endl;
return 0;
{{out}}
<pre>
<pre>Non-continuous subsequences of 0 1 2 3 4
2147483151
- 0 2
</pre>
- 0 3
- 0 4
- 1 3
- 1 4
- 2 4
- 0 1 3
- 0 1 4
- 0 2 3
- 0 2 4
- 0 3 4
- 1 2 4
- 1 3 4
- 0 1 2 4
- 0 1 3 4
- 0 2 3 4 </pre>
=={{header|Clojure}}==
| 