#include"iostream"
#include"stdio.h"
#include"algorithm"
using namespace std;
int main(){
	int m;
	cin>>m;
	while(m--){
		int n;
		cin>>n;
		int i;
		char c[65];
		cin>>c;
		int p[64];
		for(i=0;i<n;i++)
			if(c[i]=='p')
				p[i]=1;
			else p[i]=-1;
		long long a;
        　　　　scanf("%I64d",&a);
		reverse(c,c+n);
		reverse(p,p+n);
		int b[64];
		for(i=0;i<n;i++){
			if(abs(a)%2==1)
				b[i]=1;
			else b[i]=0;
			a=a-b[i]*p[i];
			a/=2;
		}
		if(a==0){
			for(i=n-1;i>=0;i--)
			   cout<<b[i];
		    cout<<endl;
		}
		else cout<<"Impossible\n";
	}
	system("pause");
	return 0;
}

• DP了我一整天,才发现开不了这2^64这么大的数组,给个更短的. (530) donkeyinacm 2009-11-22 19:53:07