/* GOLOMB SEQUENCE [ Coding Challenge ] The Golomb sequence is uniquely defined by the following rules: All terms are positive integers. No term is smaller than any previous term. The nth term is equal to the total number of times that the integer n appears within the sequence. Write a function that returns the first n terms of the Golomb sequence as a list. Examples golomb(1) ➞ [1] golomb(8) ➞ [1, 2, 2, 3, 3, 4, 4, 4] golomb(10) ➞ [1, 2, 2, 3, 3, 4, 4, 4, 5, 5] 1 appears once; 2 appears twice; 3 appears twice; 4 appears 3 times; 5 will appear 3 times in the full sequence, etc. Notes The tests will consist of random inputs between 1 and 1000 inclusive. If stuck, see resources the below resources https://en.wikipedia.org/wiki/Golomb_sequence Golomb sequence https://oeis.org/A001462 Technical info about Golomb sequence https://www.sololearn.com/post/155326/?ref=app */ #include #include #include #include using namespace std; // recursive valarray golomb(size_t nt, valarray&& seq) { static auto sz=seq.size(); return nt == sz ? seq : ((seq[nt + 1] = 1 + seq[nt + 1 - seq[seq[nt]]]), golomb(nt + 1, move(seq))); } int main() { size_t nt{1}, Lt{44}; cin>>Lt; valarraygls(Lt+1);gls[1]=1; cout << "\n\n" << "STL (transform)\n"; transform(begin(gls)+1, end(gls), ostream_iterator{cout, " "}, [&](int){ gls[nt + 1] = 1 + gls[nt + 1 - gls[gls[nt]]]; return gls[nt++];}); //================================= cout << "\n\n" << "cryptic one liner\n"; gls = 0, nt = 1; gls[1] = 1; for(size_t nt{1}; nt<=Lt && (cout<

[Challenge] golomb.cpp