2 shunfurh shunfurh 于 2017.09.03 16:28 提问

The Fun Number System

In a k bit 2's complement number, where the bits are indexed from 0 to k-1, the weight of the most significant bit (i.e., in position k-1), is -2^(k-1), and the weight of a bit in any position i (0 <= i < k-1) is 2^i. For example, a 3 bit number 101 is evaluated as -2^2 + 0 + 2^0 = -3, and 011 as -0 + 2^1 + 2^0 = 3. A negatively weighted bit is called a negabit (such as the most significant bit in a 2's complement number), and a positively weighted bit is called a posibit.

A Fun number system is a positional binary number system, where each bit can be either a negabit, or a posibit. For example consider a 3-bit fun number system Fun3, where bits in positions 0, and 2 are posibits, and the bit in position 1 is a negabit. (110)Fun3 is evaluated as 2^2 - 2^1 + 0 = 3. Now you are going to have fun with the Fun number systems! You are given the description of a k-bit Fun number system Funk, and an integer N (possibly negative. You should determine the k bits of a representation of N in Funk, or report that it is not possible to represent the given N in the given Funk. For example, a representation of -1 in the Fun3 number system (defined above), is 011 (evaluated as 0 - 2^1 + 2^0), and representing 6 in Fun3 is impossible.

Input

The first line of the input file contains a single integer t (1 <= t <= 10), the number of test cases, followed by the input data for each test case. Each test case is given in three consecutive lines. In the first line there is a positive integer k (1 <= k <= 64). In the second line of a test data there is a string of length k, composed only of letters n, and p, describing the Fun number system for that test data, where each n(p) indicates that the bit in that position is a negabit (posibit). The third line of each test data contains an integer N (-2^63 <= N < 263), the number to be represented in the Funk number system by your program.

Output

For each test data, you should print one line containing either a k-bit string representing the given number N in the Funk number system, or the word Impossible, when it is impossible to represent the given number.

Sample Input

2
3
pnp
6
4
ppnn
10

Sample Output

Impossible
1110

1个回答

devmiao
devmiao   Ds   Rxr 2017.09.03 22:50
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
poj 1023 --The Fun Number System(分析题)
The Fun Number SystemTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 6988 Accepted: 2176 Description In a k bit 2's complement number, where the bits are indexed from 0 to k-1, the w
PAT_自测4_Have Fun with Numbers
题目: https://pta.patest.cn/pta/test/17/exam/4/question/263 自测-4 Have Fun with Numbers   (20分) Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, wi
V - The Fun Number System
In a k bit 2's complement number, where the bits are indexed from 0 to k-1, the weight of the most significant bit (i.e., in position k-1), is -2^(k-1), and the weight of a bit in any position i (0 ≤
1023 The Fun Number System
Description In a k bit 2’s complement number, where the bits are indexed from 0 to k-1, the weight of the most significant bit (i.e., in position k-1), is -2^(k-1), and the weight of a bit in any pos...
The Fun Number System
Description In a k bit 2's complement number, where the bits are indexed from 0 to k-1, the weight of the most significant bit (i.e., in position k-1), is -2^(k-1), and the weight of a bit in any
1023 The Fun Number System
<br />The Fun Number SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6859 Accepted: 2132<br />DescriptionIn a k bit 2's complement number, where the bits are indexed from 0 to k-1, the weight of the most significant bit (i.e., in position
POJ1023 The Fun Number System
Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->#includeiostream>#include string>using namespace std;string str;;__int64 N;int k;int result[100];i
7-49 Have Fun with Numbers(20 分)
7-49 Have Fun with Numbers(20 分) Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which ha
自测4. Have Fun with Numbers (20)
Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number cons
总结:Distributed systems for fun and profit
在分布式系统的学习过程中,无论是读论文还是做项目,总能看到好多名词:Consistency, failure detector, order, timer;好多问题:Consensus, broadcast; 好多结论:FLP, CAP。了解单一名词的意义比较容易,但这些名词背后和分布式系统的联系,和商业分布式系统是如何利用这些理论的,一直不是很直观。啃了好多论文,却是只见树木,不见森林。偶然