problemnumber07.cpp

#include<iostream>
#include<algorithm>
#include<vector>
#include<array>
#include<cmath>
using namespace std;
// function divides a number n by 2 and insert it in vector
vector<int> climb(int n)
{
	vector<int>result;
	while (n > 1)
	{
		result.insert(result.begin(), n);
		n / 2;
	}
	return result;
}




int main() {
	climb(10);
	return 0;
}
/*For every positive integer N, there exists a unique sequence starting with 1 and ending with N and such that every number in the sequence is either the double of the preceeding number or the double plus 1.

For example, given N = 13, the sequence is [1, 3, 6, 13], because . . . :

 3 =  2*1 +1
 6 =  2*3
 13 = 2*6 +1

Write a function that returns this sequence given a number N. Try generating the elements of the resulting list in ascending order, i.e., without resorting to a list reversal or prependig the elements to a list.
*/