分析一下从第一个到最后一个有什么递进或者什么规律 可以推出之后的
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;
}