1023 The Fun Number System

The Fun Number System

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 6859		Accepted: 2132

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 position i (0 ≤ i < k-1) is 2^i. For example, a 3 bit number 101 is -2^2 + 0 + 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 < 2^63), 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

Source

Tehran 2002, First Iran Nationwide Internet Programming Contest

 

 

/* 囧，刚开始竟然没思路。。。鄙视自己 题意是给定一列二进制，这串二进制唯一不同的是能加能减 接着给定一个N，问能否用这串二进制表示 很简单的思路 从低位向高位走 首先判断n是不是奇数，用if(n&1) //n是负数也可以这么判断 接着如果是奇数，这最后一位必然是1 如果最后一位是负的，那么转化为(n+1)>>1,向高位走一位 如果最后一位是正的，那么转化为(n-1)>>1,向高位走一位 走完所有位后，如果n不为0,则无解，反之可得解 注意n为负数 */ #include<cstdio> #include<cstring> int main() { int cas; scanf("%d",&cas); char s[100]; int d[100]; bool a[100]; while(cas--) { int k; scanf("%d",&k); scanf("%s",s); for(int i=k;i>=1;i--) if(s[k-i]=='p') a[i]=true; else a[i]=false; __int64 n; scanf("%I64d",&n); memset(d,0,sizeof(d)); for(int i=1;i<=k;i++) { if(n==0) continue; if(n&1) { d[i]=1; if(a[i]) n=(__int64)(n-1)>>1; else n=(__int64)(n+1)>>1; } else { d[i]=0; n=(__int64)n>>1; } } if(n==0) { for(int i=k;i>=1;i--) printf("%d",d[i]); printf("/n"); } else printf("Impossible/n"); } return 0; }