#include<stdio.h>
#include<conio.h>
#include<iostream>
#include<stdlib.h>

using namespace std;
int MAXSTACK;
typedef int itemtype;

typedef struct
{
itemtype item[300];
int count;
}stack;

void initializestack(stack *s)
{
s->count = 0;
}

int empty(stack *s)
{
return (s->count == 0);
}

int full(stack *s)
{
return (s->count == MAXSTACK);
}

void push(itemtype x, stack *s)
{
if(full(s))
cout<<"stack penuh";
else
{
s->item[s->count]=x;
++(s->count);
}
}

int pop(stack *s)
{
if(empty(s))
cout<<"stack kosong";
else
{
--(s->count);
return (s->item[s->count]);
}
return 0;
}
int i, n, m, o,p;
int input;
stack tumpukan;
void biner();

int main (){

initializestack(&tumpukan);
cout<<"Konversi Bilangan desimal ke biner";
cout<<"\n\nMasukkan Bilangan desimal(tulis -1 untuk mengakhiri): ";
cin>>input;
cout<<"bilangan binernya : ";
do
{biner();
}while (n>0);
cout<<endl;
return 0;
}

void biner(){
for(o=1,n=input;n>0;n=n/2,o++)
{
MAXSTACK=o;
m=n%2;
push(m,&tumpukan);
}
for(i=MAXSTACK;i>0;i--)
{
cout<<pop(&tumpukan);
}
}