Translation numbers in the binary system + cyclic shift

Pay with:
i agree with "Terms for Customers"
Sold: 0
Refunds: 0

Uploaded: 12.04.2016
Content: conv.rar (959,38 kB)

Description

The program converts the number into a binary code , and then makes a right hand cyclic shift of the code , the other numbers are formed . Then , the program finds the maximum number from all numbers

Additional information

Given an inherent number N (N <= 4294967295 ) . When writing N binary system in the sequence goes to 0 and 1. For example, when N = 19, we obtain 1910 = 1 * 24 + 0 * 23 + 0 * 22 + 1 * 21 + 1 * 20 , that is in binary number can be written how 100112. Circular shift to the right out of the other . Find the maximum - not among these numbers. Yes, for the number 19, the cyclic shift results as follows:
10011 = 19
11001 = 25
11100 = 28
01110 = 14
7 = 00111
10011 = 19 .
Accordingly, the maximum number is 28 .

Feedback

0
No feedback yet.
Period
1 month 3 months 12 months
0 0 0
0 0 0
In order to counter copyright infringement and property rights, we ask you to immediately inform us at support@plati.market the fact of such violations and to provide us with reliable information confirming your copyrights or rights of ownership. Email must contain your contact information (name, phone number, etc.)