/****************************************** 🏆🏆#Challenge:help bob to solve bit-byte cracking number puzzle. 🏆🏆🤔🤔🏆🏆 in office bob is bored & he play with the binary number but he do not get the answer he want your help. problem: bob has 16-bit binary number and he want to know how many 4-bit binary number pair is possible to do: T1:num pair is even T2:num pair is odd T3:num pair is prime T4:num pair is div by 2 ✅Test case✅ num:1010101010101010 if pair:1010 1010=10(Decimal) 10 is even so even pair +1 like that all pair check output: evenpair:? oddpair:? prime pair:? div by 2 pair:? All language accepted ******************************************/ #include #include #include using namespace std; // this function to check for prime number int is_prime(int x){ int k; for(k = 2; k<= x/2; k++){ if(x % k == 0){ return 0; } } return 1; } /*this function to calculate the binary pairs each with 4-bits @ s : string contains 16 bits @ t[]: array contains the counters for even, odd, prime and div by 2 pairs t[0] = for even counter t[1] = for odd counter t[2] = for prime counter t[3] = for div by 2 counter */ void pair_counter(string s, int t[]){ int dv= 0;// decimal value int i,j; /*read the 16-bit each 4-bits make a pair. start reading from the most left bit to the most right bit taking 4-bits each time. */ for(i=0; i<16;){ /* read 4-bits and get the decimal value of the pair */ for(j = 3; j >= 0; j--){ /*check if the bit is 0 then no value will be added else if it is 1 then will add its equivelant value: 1 0 0 1 2^3 2^2 2^1 2^0 */ switch(s[i]){ case '0':break; case '1':dv += pow(2,j); break; } //increment i to get next bit i++; } /*check if dv(decimal value) is even, then increment t[0] and t[3] */ if(dv % 2 == 0){ t[0] ++; t[3] ++; }else{ //dv is odd, then increment t[1] t[1] ++; } //check if dv is prime if(is_prime(dv)){ // then increment t[2] t[2] ++; } // clear dv inorder to calculate // the new pair dv = 0; } return; } int main() { string text; // to declare value of T1,T2,T3,T4 // in the array T_1234[] int T_1234[]= {0,0,0,0}; // read the the 16-bits getline(cin, text); cout << "Origin text you entered:\n"; cout << " >> " << text; cout << "\n\n"; //call the function to calculate pairs pair_counter(text,T_1234); //print the final result cout << "The final result is:"; cout << "\n num pair is even = "; cout << T_1234[0]; cout << "\n num pair is odd = "; cout << T_1234[1]; cout << "\n num pair is prime = "; cout << T_1234[2]; cout <<"\n num pair is div by 2 = "; cout << T_1234 [3]; cout << "\n\n"; cout << "Thanks for your "; cout << "caring...\n\n "; cout << "======================"; cout << "\n\nRegards,\nMohammad"; return 0; }

4-bit binary pairs