Thread: Bitset questions

Hi all,

I am very new to programming, I apologize if my questions seem too trivial. I have:

Code:

#include <bitset>
#include <iostream>

int main()
{
static const unsigned n = 5;
static float p[n] = {8.34, 10.59, 7.6, 0.8, 10.32};

unsigned int i;
for( i = 32; i--;)
{
	std::bitset < n > v = i;

return 0;
}

First, I need to efficiently compute the "scalar product" of the bitset (array of boolean?) "v" with the array of float "p"?

Second, how to make an exact copy of the bitset "v"?

Thank you very much!
SK