8_11_Two_integer_Queue

#include <iostream>
#include <vector>
#include <stdexcept>
#include <cmath>

using namespace std;

class queue
{
    private:
    unsigned long int num, zeroes;
    
    public:
    queue()
    {
        num = 0;
        zeroes = 0;
    }
    
    void enqueue(int a){
        num = a*(pow(10,zeroes)) + num;
        zeroes++;
    }
    
    int dequeue(){
        if(zeroes > 0){
            int ret = num%10;
            num /= 10;
            zeroes--;
            return ret;
        }
        throw length_error("empty queue");
    }
};

int main(){
    vector<int> v = {0, 0, 0, 0, 0, 0, 7 ,6, 0 , 0, 0 , 0 , 2, 1};
    queue q;
    for(int i=0; i<v.size(); i++){
        q.enqueue(v[i]);
    }
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    cout << q.dequeue() << endl;
    return 0;
}