2 shunfurh shunfurh 于 2017.01.10 21:05 提问

The Moronic Cowmpouter

问题描述 :

Inexperienced in the digital arts, the cows tried to build a calculating engine (yes, it’s a cowmpouter) using binary numbers (base 2) but instead built one based on base negative 2! They were quite pleased since numbers expressed in base −2 do not have a sign bit.

You know number bases have place values that start at 1 (base to the 0 power) and proceed right-to-left to base^1, base^2, and so on. In base −2, the place values are 1, −2, 4, −8, 16, −32, … (reading from right to left). Thus, counting from 1 goes like this: 1, 110, 111, 100, 101, 11010, 11011, 11000, 11001, and so on.

Eerily, negative numbers are also represented with 1′s and 0′s but no sign. Consider counting from −1 downward: 11, 10, 1101, 1100, 1111, and so on.

Please help the cows convert ordinary decimal integers (range -2,000,000,000..2,000,000,000) to their counterpart representation in base −2.

输入:

Line 1: A single integer to be converted to base −2
输出:

Line 1: A single integer with no leading zeroes that is the input integer converted to base −2. The value 0 is expressed as 0, with exactly one 0.
样例输入:

-13
样例输出:

110111

2个回答

caozhy
caozhy   Ds   Rxr 2017.01.16 23:37
已采纳
dabocaiqq
dabocaiqq   2017.01.14 22:53
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
POJ 3191 The Moronic Cowmpouter 负二进制转换
<br />http://poj.org/problem?id=3191<br /> The Moronic CowmpouterTime Limit: 1000MS Memory Limit: 65536K<br />DescriptionInexperienced in the digital arts, the cows tried to build a calculating engine (yes, it's a cowmpouter) using binary numbers (base 2)
PKU 3191 The Moronic Cowmpouter
 -2进制,和2进制差不多,不过要注意奇数时的区别还有-2进制不能表示所有的数,所以测试的时候可能有些数字得到的结果是错的-____________-不知道这题啥意义..... #include  #include  using namespace std;vectorint> m;int main(){    int n;     while(
pku 3191 The Moronic Cowmpouter
对于正数n是奇数 2^n=(-2)^(n+1)+(-2)^nn是偶数 2^n=(-2)^n对于负数n是奇数 -2^n=(-2)^nn是偶数 -2^n=(-2)^(n+1)+(-2)^n#include using namespace std;int main(){ int num,ans[100],cnt=0,flag; scanf("%d",&num)
POJ3191-The Moronic Cowmpouter
The Moronic Cowmpouter Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4006   Accepted: 2079 Description Inexperienced in the digital arts, the cows tried to b
poj 3191 The Moronic Cowmpouter
poj 3191 The Moronic Cowmpouter 题意: 一个十进制的数,有正有负,把他化成-2进制。 #include #include #include #include using namespace std; long long n,y; int a[2100],k; void system(long long x) { k=0; while(x!=0)
POJ 3191 The Moronic Cowmpouter
题目大意:         由于对数字艺术不敏感,cows只能尝试建造一台计算引擎帮他完成一些计算工作(而不能凭自己的直觉来解决问题了)。他打算设计一个十进制向二进制转换的程序,但不过不是二进制而是负二进制 注释代码: 无注释代码: 单词解释: moronic:adj, 低能的,迟钝的 inexperienced:adj, 缺乏经验的 pleased:adj, 高兴的,欢喜的 si
POJ 3191 The Moronic Cowmpouter
Inexperienced in the digital arts, the cows tried to build a calculating engine (yes, it's a cowmpouter) using binary numbers (base 2) but instead built one based on base negative 2! They were quite p
POJ 3191 The Moronic Cowmpouter 可能会
-
POJ 3191 - The Moronic Cowmpouter(进制转换)
The Moronic Cowmpouter Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4192 Accepted: 2168 DescriptionInexperienced in the digital arts, the cows tried to build a calculating eng
POJ 3191 The Moronic Cowmpouter 笔记
将整数转换位-2进制数。