對16進位數處理

來源:互聯網
上載者:User
分析一下從第一個到最後一個有什麼遞進或者什麼規律  可以推出之後的

00000017000A0B010F7363656E654964040107636D640483963101
00000017000A0B010F7363656E654964040207636D640483963101
00000017000A0B010F7363656E654964040307636D640483963101
00000017000A0B010F7363656E654964040407636D640483963101
00000017000A0B010F7363656E654964040507636D640483963101

00000017000A0B010F7363656E654964040707636D640483963101
00000017000A0B010F7363656E654964040807636D640483963101
00000017000A0B010F7363656E654964040907636D640483963101
00000019000A0B010F7363656E6549640485BF1A07636D640483963101
00000019000A0B010F7363656E6549640485BF1B07636D640483963101

00000019000A0B010F7363656E6549640485BF1C07636D640483963101
00000019000A0B010F7363656E6549640485BF1D07636D640483963101
00000019000A0B010F7363656E6549640485BF1E07636D640483963101
00000018000A0B010F7363656E65496404870707636D640483963101
00000018000A0B010F7363656E65496404870807636D640483963101

#include<iostream>

#include<sstream>
#include<string>
#include<iterator>
#include<cmath>
#include<fstream>
using namespace std;
int main()
{
ifstream infile("input.txt");
ofstream outfile("output.txt");
string temp;
while(infile>>temp)
{
    for(int i=0;i<temp.size();i+=8)
    {
       string temptemp(temp,i,8);
       cout<<temptemp<<endl;
       long num=0;long total=0;
       for(int j=temptemp.size()-1;j>=0;j--)
       {
           num=pow(16,(temptemp.size()-j-1));int char_num=0;
          char point_char=temptemp[j];
          switch(point_char)
          {
           case '0':char_num=0;break;
           case '1':char_num=1;break;
           case '2':char_num=2;break;
           case '3':char_num=3;break;
           case '4':char_num=4;break;
           case '5':char_num=5;break;
           case '6':char_num=6;break;
           case '7':char_num=7;break;
           case '8':char_num=8;break;
           case '9':char_num=9;break;
           case 'A':char_num=10;break;
           case 'B':char_num=11;break;
           case 'C':char_num=12;break;
           case 'D':char_num=13;break;
           case 'E':char_num=14;break;
           case 'F':char_num=15;break;
           default :cout<<"error"<<" "<<char_num<<endl;
          }
          total+=num*char_num;
       }
       outfile<<total<<" ";
    }
    outfile<<endl;
}
return 0;
}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.