#include <stdio.h> #include <stdint.h> uint16_t spread_bits(uint8_t val) { // Your logic here // uint16_t ret = 0; // for (uint8_t i = 0; i < 8; i++) { // ret <<= 2; // if ((val >> (7 - i)) & 1) { // ret |= 1; // } // } // Solution uint16_t ret = 0; for (int i = 0; i < 8; i++) { uint8_t bit = (val >> i) & 1; // Extract i-th bit ret |= (bit << (2 * i)); // Place in 2*i position } return ret; } int main() { uint8_t val; scanf("%hhu", &val); uint16_t result = spread_bits(val); printf("%u", result); return 0; }
Bit Spreading
Solution is better than my code
Test Cases
Test Results
Input
202
Expected Output
20548