蓝桥杯（十六进制转八进制）把大佬的代码做了注释，整理。

先看代码  再看我给的注释说明

#include<iostream>
#include<string>
using namespace std;
int main()
{
    string s1, s2;//s1存十六进制数，s2存二进制数
    int n;
    int i, j, k;
    cin >> n;
    for (i = 0; i < n; i++)
    {
        cin >> s1;
        s2 = "";
        for (j = 0; j < s1.length(); j++)
        {
            switch (s1[j])
            {
            case '0':s2 += "0000"; break;
            case '1':s2 += "0001"; break;
            case '2':s2 += "0010"; break;
            case '3':s2 += "0011"; break;
            case '4':s2 += "0100"; break;
            case '5':s2 += "0101"; break;
            case '6':s2 += "0110"; break;
            case '7':s2 += "0111"; break;
            case '8':s2 += "1000"; break;
            case '9':s2 += "1001"; break;
            case 'A':s2 += "1010"; break;
            case 'B':s2 += "1011"; break;
            case 'C':s2 += "1100"; break;
            case 'D':s2 += "1101"; break;
            case 'E':s2 += "1110"; break;
            case 'F':s2 += "1111"; break;
            default:break;
            }//单纯的将对应输入的十六进制数转化为二进制数（一一转化）
        }
        if (s2.length() % 3 == 1)
            s2 = "00" + s2;
        if (s2.length() % 3 == 2)
            s2 = "0" + s2;
            //将十六进制转化为二进制
        int flag = 0;
        for (k = 0; k < s2.length() - 2; k += 3)
        {
            int p = 4 * (s2[k] - '0') + 2 * (s2[k + 1] - '0') + s2[k + 2] - '0';
             //将二进制转化为八进制
            if (p)
                flag = 1;
            if (flag)
                cout << p;
        }//判断没有零，输出
        cout << endl;
    }
    return 0;
}

 希望能帮助到大家