How do I rearrange bits in bitset?

[zaahm18]

I need help with a code that rearranges the bits in bitset.

Suppose I write input binary: 11010010011011:

the output is: 0000000000000000000000000000000000000000000000000011010010011011

but I wanted the output: 1101001001101100000000000000000000000000000000000000000000000000

note that I used bitset.

this is a part of my code

using bitmask = bitset<64>

int main()
{
	bitmask input;
	dtmf num;
	std::vector<unsigned short int> vec;
	std::cin >> input;
	std::cout << input << std::endl;
	input = num.rotate(input, 10);// this function only shift 10 bits to left
    std::cout << input << std::endl;

bitmask dtmf::rotate(bitmask& bitin,unsigned int n) {
	return (bitin << n);
}

[lastchance]

Your question isn't clear. Is this what you wanted?

#include <iostream>
#include <string>
#include <bitset>
#include <algorithm>
using namespace std;

using BitType = bitset<64>;

BitType bitRotate( BitType B )
{
   string str = B.to_string();
   int first1 = str.find( '1' );
   if ( first1 != string::npos ) rotate( str.begin(), str.begin() + first1, str.end() );
   return BitType( str );
}

int main()
{
   BitType B( "11010010011011" );
   cout << B << '\n';
   cout << bitRotate( B ) << '\n';
}

0000000000000000000000000000000000000000000000000011010010011011
1101001001101100000000000000000000000000000000000000000000000000

[zaahm18]

Exactly!!!