POJ1023 The Fun Number System
2009-09-13 10:01
387 查看
#include<iostream> #include <string> using namespace std; string str;; __int64 N; int k; int result[100]; int index = 0; int main() { int t,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; } else if (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; } return 0; }
本文出自 “洞庭散人” 博客,请务必保留此出处http://phinecos.blog.51cto.com/1941821/368942
相关文章推荐
- POJ1023 The Fun Number System
- poj 1023 The Fun Number System 整数的表示
- POJ1023 The Fun Number System【进制相关】
- POJ 1023 The Fun Number System (递推)
- poj 1023 The Fun Number System
- POJ 1023 The Fun Number System
- POJ 1023--The Fun Number System
- POJ 1023 The Fun Number System
- POJ1023 The Fun Number System
- poj 1023 --The Fun Number System(分析题)
- POJ1023 The Fun Number System
- poj 1023 The Fun Number System
- The Fun Number System
- pku 1023 The Fun Number Syst
- F - The Fun Number System(第二季水)
- The Fun Number System
- V - The Fun Number System
- poj1023:The Fun Number System有趣的进制系统
- V - The Fun Number System
- POJ1023_The Fun Number System_模拟二进制运算