Your task is pretty simple, calculate the n-th element of A190810. Elements of A190810 are calculated in this way: a(1)=1, and if x is in a then 2x+1 and 3x-1 are in a. You can use 1-based or 0-based indexing, but if you use 0-based indexing, please say it in the answer. Test cases a(1) = 1...

Here is a theoretical question - one that doesn't afford an easy answer in any case, not even the trivial one. In Conway's Game of Life, there exist constructs such as the metapixel which allow the Game of Life to simulate any other Game-of-Life rule system as well. In addition, it is known that...

Your task is pretty simple, calculate the n-th element of A190810. Elements of A190810 are calculated according to these rules: The first element is 1 The sequence is increasing If x occurs in the sequence, then 2x+1 and 3x-1 also do You can use 1-based or 0-based indexing, but if you use 0-...

Python 2, 88 83 72 bytes You may want to read the programs in this answer in reverse order... Slower and shorter still, thanks to Dennis: L=1,;exec'L+=2*L[0]+1,3*L[0]-1;L=sorted(set(L))[1:];'*input() print L[0] Try it online This doesn't run as fast, but is shorter (83 bytes.) By sortin...

I want to define a 2D array of structures in a class in C++, how should I do it, here is an example approach for a struct tt class{ private: int a,b; tt yum[a][b]; }; Can this be done in some way? This AoS will be used by all the member functions of the class/ultimatey defined object so it ca...

Language succession answer-chaining string Given two words (two strings of lowercase-only letters separated by a space) as input to a program PX written in language X, output two programs in languages Y and Z such that program PY outputs the first word and program PZ outputs the second word. Yo...