C / C++ / MFC

bitset<32> bitvec3(012);

0000...1010

bitset<8> bv012(012);
bitset<8> bv021(021);
bitset<8> bv12(12);
bitset<8> bv21(21);

00001010  // for 012 (as his book shows)
00010001  // for 021
00001100  // for 12
00010101  // for 21

void main()
{
	myStruct c;
  
	int space = 0;
	int bits = 0;
	int on = 1;
	int off = 0;
	
	scanf("%d",&c.x);
	//printf("%d\n",c.x);

		for(bits=31; bits>=0; --bits)
	{
		
		if(space == 8)
		{
			printf(" ");
			space = 0;
		}
		if(c.x & (1 << bits))
		
			printf("%d",on);
		else
			printf("%d",off);
		++space;
	}
	printf("\n");

	scanf("%lf",&c.i);
	space = 0;

	for(bits=7; bits>=0; --bits)
	{
		
		if(space == 8)
		{
			printf(" ");
			space = 0;
		}
		if((c.i) & (1 << bits))
		
			printf("%d",on);
		else
			printf("%d",off);
		++space;
	}
	printf("\n");

#include <iostream>
#include <string>

#ifndef LIST_H
#define LIST_H

using namespace std;

struct node
{
	string data;
	node *next;
	node *successor;
	node *predec;
};




//Linked List class
class List
{
	node *first;
	node *successor;
	node *predec;
	
	//friend class treeNode;
	
public:

	List()
	{
		first=NULL;
		successor=NULL;
		predec=NULL;
	}
void insertNode(string newName)
	{
		node *p;
		p=new node;
		p->data=newName;
		p->next=first;
		first=p;
		
		}

	
	void outputList(ostream &out)
	{
		
		node *p;
		p=first;

		if(!empty())
		{
			cout << endl;
			while(p!=NULL)
			{
				
				cout << p->data << " ";
				p=p->next;
			}
		}
		else 
			cout << "The list is empty!" << endl;
	}
	

	bool empty()
	{
		if(first==NULL)
			return true;
		else
			return false;
	}
	




};

#endif