Funny Encryption Method |
Steps : Example
1) Read the number N to encrypt M = 265
2) Interpret N as a decimal number X1= 265 (decimal)
3) Convert the decimal interpretation of N to its binary representation
X1= 100001001 (binary)
4) Let b1 be equal to the number of 1’s in this binary representation
B1= 3
5) Interpret N as a Hexadecimal number X2 = 265 (hexadecimal)
6) Convert the hexadecimal interpretation of N to its binary representation
X2 = 1001100101
7) Let b2 be equal to the number of 1’s in the last binary representation
B2 = 5
8) The encryption is the result of M xor (b1*b2) M xor (3*5)
= 262
This student failed Computational Organization, that’s why this student asked the judges of ITESM Campus Monterrey internal ACM programming Contest to ask for the numbers of 1’s bits of this two representations so that he can continue playing.
Task :
You have to write a program that read a Number and give as output the
number b1 and b2