Run ID | User | Problem | Result | Memory | Time | Language | Code Length | Submit Time |
6696365 | kingpro | 1023 | Accepted | 232K | 0MS | C++ | 344B | 2010-04-06 20:42:17 |
PKU 1023 The Fun Number System
1 #include <iostream>
2 using namespace std;
3
4 int main()
5 {
6 int n=0, bnum=0, i=0;
7 char pn[65]={0};
8 long long num=0;
9 cin>>n;
10 while(n--) for(cin>>bnum>>pn>>num, i=bnum-1; (i>=0 && ((num & 1 ? ((num+=(pn[i]=='p' ? -1 : 1)), pn[i]='1') : (pn[i]='0')), num>>=1, true)) || (cout<<(num ? "Impossible" : pn)<<endl, false); i--);
11 return 0;
12 }
恩……纠结了很久的一道题...一直想用移位倒腾...最后还是放弃了 郁闷啊郁闷...
Author: CriusWuBlog: http://kingpro.cnblogs.comContact: kingpro@live.cn
This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 Unported License.
This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 Unported License.