Description: An Easy Problem Description As we kno wn. data stored in the computers i n binary form. T he problem we discuss now is about the positive i ntegers and its binary form. Given a positive in teger I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1's in whose binary form is the sa me as that in the binary form of I. For example, if "78" is given. we can write out its binary form. "1001110." This binary form has 4 1 s. The minimu m integer, which is greater than "1001110" and also contai ns 4 1's, is "1010011", i.e., "83", so you should output "83."
- [sid] - Converting SIDs Between Strings and Bina
- [xuxuming1JBUILDER] - JBUILDER prepared by the procedure. Used
- [tonic] - modular your applications, you can do so
- [chap7_2] - This program reads binary number from a
File list (Check if you may need any files):
Download