关于快速幂

#include<iostream>
#include<queue>
using namespace std;
queue<int> code;
int main()
{
    int a,b;
    cin>>a;
    cin>>b;
    //二进制转化，存在队列中
    while(a)
    {
        int num;
        num=a&1; 
           cout<<num<<endl;
        code.push(num);
        a=a>>1;
    }
    int flag=b;
    int lenth=code.size();
    int result=1;
    for(int i=0;i<lenth;i++)
    {
        if(code.front())
            result*=flag;
        code.pop();
        flag*=flag;
    }
    cout<<result<<endl;
}