F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Geek Challenge [SKRZAT] (Base Minus Two)

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 605    Accepted Submission(s): 219


Problem Description
Problem F: Geek Challenge [SKRZAT] (Base Minus Two)
Geek Challenge [SKRZAT] is an old, old game from Poland that uses a game console with two buttons plus a joy stick. As is true to its name, the game communicates in binary, so that one button represents a zero and the other a one. Even more true to its name, the game chooses to communicate so that the base of the number system is minus two, not plus two, so weˇŻll call this representation ˇ°Weird Binaryˇ±. Thus the bit positions label the powers of minus two, as seen in the following five-bit tables:

Numbers are presented on the screen in Weird Binary, and then numbers are accepted in response from the console as a stream of zeroes and ones, terminated by a five-second pause.
You are writing a computer program to support the novice geek in playing the game by translating numbers between decimal and Weird Binary.
 

Input
The first line in the file gives the number of problems being posed without any white space. Following are that many lines. Each line will either be a conversion into Weird Binary or out of Weird Binary: the letter "b" indicates that the rest of the line is written in Weird Binary and needs to be converted to decimal; the letter "d" indicates that the rest of the line is written in decimal and needs to be converted to Weird Binary.
The input data are in the range to fit within a 15-bit Weird Binary number, which represents the decimal number range ¨C10922 to 21845, inclusive.
 

Output
For each conversion problem, show the type of problem, its input string, and the converted result in the format shown below, replicating even the spacing exactly as shown. Leading zeroes are not allowed.
 

Sample Input
10 b 1001101 b 0111111 b 101001000100001 b 010010001000010 b 100110100110100 d -137 d 137 d 8191 d -10000 d 21000
 

Sample Output
From binary: 1001101 is 61 From binary: 0111111 is -21 From binary: 101001000100001 is 19937 From binary: 010010001000010 is -7106 From binary: 100110100110100 is 15604 From decimal: -137 is 10001011 From decimal: 137 is 110011001 From decimal: 8191 is 110000000000011 From decimal: -10000 is 10100100110000 From decimal: 21000 is 101011000011000
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 05:19:22, Gzip enabled