文件名称:AnEasyProblem
- 所属分类：
- 数值算法/人工智能
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2008-10-13
- 文件大小：
- 9.22kb
- 下载次数：
- 0次
- 提 供 者：
- L*
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
ACM试题An Easy Problem
Descr iption
As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer 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 same 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 minimum integer, which is greater than \"1001110\" and also contains 4 1 s, is \"1010011\", i.e. \"83\", so you should output \"83\".
-An Easy Problem Descr iption 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."
Descr iption
As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer 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 same 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 minimum integer, which is greater than \"1001110\" and also contains 4 1 s, is \"1010011\", i.e. \"83\", so you should output \"83\".
-An Easy Problem Descr iption 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."
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 101259339aneasyproblem.rar 列表 An Easy Problem\Desktop_.ini An Easy Problem\An Easy Problem\An Easy Problem.ncb An Easy Problem\An Easy Problem\An Easy Problem.plg An Easy Problem\An Easy Problem\An Easy Problem.cpp An Easy Problem\An Easy Problem\An Easy Problem.dsp An Easy Problem\An Easy Problem\An Easy Problem.opt An Easy Problem\An Easy Problem\An Easy Problem.dsw An Easy Problem\An Easy Problem\Desktop_.ini An Easy Problem\An Easy Problem\Debug An Easy Problem\An Easy Problem An Easy Problem