#include<stdio.h>
#include<conio.h>
#include<iostream>
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))
printf("stack penuh !\n");
else
{
s->item[s->count]=x; ++(s->count);
}
}
int pop(stack *s)
{
if(empty(s))
printf("stack kosong\n");
else
{
--(s->count);
return (s->item[s->count]);
}
}
main()
{
int i, n, m, l, z; int input;
stack tumpukan;
cout << "||**************************************||\n";
cout << "||Nama : Muhamad Husni Ramadhan ||\n";
cout << "||NIM : 191011400011 ||\n";
cout << "|| ||\n";
printf( "||Program Pengkonversi Desimal ke Biner ||\n");
cout << "||**************************************||\n";
cout << endl;
initializestack(&tumpukan);
printf("Masukkan bilangan desimal = ");
scanf("%d", &input);
for(z=1,n=input;n>0;n=n/2, z++)
{
MAXSTACK=z;
}
m=0;
for(n=input;n>0;n=n/2)
{
l=n%2;
push(l,&tumpukan);
++m;
}
printf("Masukkan bilangan biner = ");
for(i=MAXSTACK;i>0;i--)
{
printf("%d", pop(&tumpukan));
}
getch();
return 0;
}
Tidak ada komentar:
Posting Komentar