POJ 的一道题,算法很简单:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 | #include <string> #include <iostream> using namespace std; int main() { int n; char b2h[17] = "0123456789ABCDEF"; int flag[4] = {1,2,4,8}; cin>>n; while (n--) { string s;cin>>s; int len = s.length(); int mod = len%4; int num = 0; for (int i=mod;i>0;i--) { if (s[mod-i]=='1') { num += flag[i-1]; } } if (mod) cout<<b2h[num]; for (int i=mod;i<len;i+=4) { num = 0; for (int j=0;j<4;j++) { if (s[i+j]=='1') { num += flag[3-j]; } } cout<<b2h[num]; } cout<<endl; } return 0; } |