The text file contains integers. Replace all the numbers representing the number two in the integer degree by the combination 2 ^ n (where n is the power). For example: 8 - 2 ^ 3, 32 - 2 ^ 5

Tell me the algorithm for solving such problems.

    1 answer 1

    Take a number, check, and not 2 if it is to the power of n , if yes - replace ...

    Well, it’s very easy to check whether x degree 2 - to calculate x&(x-1) - for degree 2 it will be zero ... (although you still have to check that x itself is not zero).

    The degree to calculate the special problems will not be?

    • what &? degree of the number I don’t know how to calculate - Vadim Moroz
    • & is a C. language operator. Degree ... Well, for example, count how many times you need to divide the number by 2 to get zero :) Once again, you have a question. Tell me an algorithm for solving such problems . He prompted. - Harry
    • Yes, thank you, I just need to solve a huge number of tasks in the shortest possible time, my head is already boiling, I don’t see obvious things - Vadim Moroz
    • another question, how to check whether x is a power of 3? - Vadim Moroz
    • There is no such simple option. Offhand - in a cycle, I would check the remainder of division by 3, if not zero - not a degree, if zero - divide by 3, and so on until we get 1 ... - Harry