Re: C++ Primer ex 3.24 (bitset class)

i have solved the problem. any comments on it:

/* C++ Primer 4/e
 * chapter 3
 *
 * exercise 3.24
 * STATEMENT:
 * consider the sequence 1,2,3,5,13,21. Initialize a "bitset<32>"
 object that has a one bit in each position corresponding to a number in
 this sequence. */

#include <iostream>
#include <string>
#include <bitset>

int main()
{
  std::string bstr("100000001000010010111"); std::bitset<32>
  str_bit(bstr);

  /* i could have created an empty bitset first and then assign
the values using subscripting but the problem statement requires that
initialisation must set the bits at positions 1,2,3,4,13,21 as ON. so i
used the string as initialisation */

  std::cout << "printing bits" << std::endl; for(size_t ix=0; ix !=
  str_bit.size(); ++ix)
    {
      std::cout << "position "
        << ix + 1
        << " : "
        << str_bit[ix]
        << std::endl;
    }

  return 0;
}