If you want the k-th bit of n, then do (n & ( 1 > k Here we create a mask, apply the mask to n, and then right shift the masked value to get just the bit we want. We could write it out more fully as: int mask = 1 > k; You can read more about bit-masking here: en.wikipedia.org/wiki/Mask_(computing) Here is a program: #include #include int *get_bits(int n, int bitswanted){ int *bits = malloc(sizeof(int) * bitswanted); int k; for(k=0; k k; bitsk = thebit; } return bits; } int main(){ int n=7; int bitswanted = 5; int *bits = get_bits(n, bitswanted); printf("%d = ", n); int i; for(i=bitswanted-1; i>=0;i--){ printf("%d ", bitsi); } printf("\n"); }.
Here's one way to do it—there are many others: bool b4; int v = 7; // number to dissect for (int j = 0; j.
Here's a very simple way to do it; int main() { int s=7,l=1; vector v; v.clear(); while(l=0;l--) { cout.
I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.