POJ1023 The Fun Number System

<!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />-->#include<iostream>
#include<string>
usingnamespacestd;

stringstr;;
__int64N;
intk;
intresult[100];
intindex=0;

intmain()
{
intt,i;
cin>>t;
while(t--)
{
cin>>k;
cin>>str;
cin>>N;
for(i=k-1;i>=0;--i)
{
if((N%2==1)||(N%2==-1))
{//奇数

if(str[i]=='p')
{//减1
N-=1;
N/=2;
}
elseif(str[i]=='n')
{//加1
N+=1;
N/=2;
}
result[index++]=1;
}
else
{//偶数
N/=2;
result[index++]=0;
}
}
if(N!=0)
{
cout<<"Impossible";
}
else
{
for(i=k-1;i>=0;--i)
{
cout<<result[i];
}
}
cout<<endl;
index=0;
}
return0;
}