How to solve C++ problem…?!?

OUTPUT>>
Enter keeping a positive integer 317
That integer 317 around binary will be 100111101
That binary number 100111101 inside decimal type is 317

employing functions “decimalToBinary(int, int )” “binaryToDecimal(int, int ) ” connected with type integer.

***
Range = dn-1
With regard to i=n-2, n-3,, A COUPLE OF, 1, 0
Number = di+ 2*Number

If I were given this work, I could object on the specified job prototypes.With regard to decimalToBinary, it results in a negative design where the function must trust that caller to supply a sufficiently large array of int.That’s the type of thing you might be sometimes made into executing in C.C++ provides multiple advances over that.With regard to binaryToDecimal, there needs to be no int debate, int would be the return worth.So, I might suggest you try such as this:

#include
#include
#include
#include
#include
#include

employing namespace an std;

useless int2bits(unsigned lengthy, deque&);
unsigned long bits2int(deque&);

int main(int argc, char *argv)
stringed in;
stringstream ss;
deque chuncks;
unsigned long x;

cout << "Enter keeping a positive integer:" << endl;
complete
cout < “;
getline(cin, in);
ss.clear(); ss.str(in);
even though (! (ss >> x) ss.good());

int2bits(x, bits);
cout << "The integer " << x << " around binary will be ";
copy(bits.begin(), chuncks.end(), ostream_iterator(cout, “”));

cout << endl << "The binary range ";
copy(bits.begin(), chuncks.end(), ostream_iterator(cout, “”));
cout << " within base-10 is definitely " << bits2int(bits) << endl;

returning 0;

useless int2bits(unsigned lengthy n, deque &bits)
with regard to (; n > 0; n >>= 1)
chuncks.push_front(n & 1);

unsigned long bits2int(deque &bits)
long n = 0;

with regard to (; chuncks.size() > 0; chuncks.pop_front())
n = (n << 1) (bits.front() == true);

returning n;

#if 0

Trial runs:

Enter keeping a positive integer:
> 317
That integer 317 around binary will be 100111101
That binary number 100111101 inside base-10 is definitely 317

Enter keeping a positive integer:
> 42
That integer 44 in binary is definitely 101010
That binary number 101010 inside base-10 is definitely 42

Enter keeping a positive integer:
> 4294967295
That integer 4294967295 around binary will be 11111111111111111111111111111111
That binary number 11111111111111111111111111111111 inside base-10 is definitely 4294967295

#endif.