Help me in solving STACK06 problem

help
,
1

My issue

I am unable to understand this part of the code :
void decimalToBinary(int decimal){
while (decimal > 0) {
// Update the code below
int remainder=decimal%2;
push(remainder);
decimal/=2;
}

My code

#include <bits/stdc++.h>
using namespace std;

#define MAX_SIZE 101
int a[MAX_SIZE];
int top = -1;

void push(int ele){
    if(top<=MAX_SIZE-1){
        a[++top]=ele;
    }
    else{
        cout<<"Stack is full. Cannot push: "<<ele<<"\n";
    }
}

int pop(){
    if(top>=0){
        int ele = a[top];
        top--;
        return ele;
    }
    else{
        cout<<"Stack is empty. Cannot pop.\n";
        return -1;
    }
}

bool isEmpty(){
    return top==-1;
}

int size(){
    return top+1;
}

void decimalToBinary(int decimal){
    while (decimal > 0) {
        // Update the code below
        int remainder=decimal%2;
        push(remainder);
        decimal/=2;
    }

    if(isEmpty()) {

    }
    while(!isEmpty()){
        cout<<pop();
    }

    cout<<"\n";
}

int main(){
    int t;
    cin>>t;

    while(t--){
        int decimal;
        cin>>decimal;
        decimalToBinary(decimal);
    }
    return 0;
}

Learning course: Stacks and Queues
Problem Link: Stack implementation using arrays-2 Practice Problem in Stacks and Queues - CodeChef

2

@arjunkul
its the main logic for converting number to binary.
U can refer some you tube videos for intuition.