24042015001_Stack_Balik_Nama

#include<iostream.h>
#include<conio.h>
#include<string.h>
#include<stdio.h>
#define max_stack 5
struct stack{
int top;
char data[max_stack];
}tumpuk;
void nil_a(){
tumpuk.top=-1;
}
int jk_kosong(){
if(tumpuk.top==-1)
return 1;
else
return 0;
}
int jk_penuh(){
if(tumpuk.top==max_stack-1)
return 1;
else
return 0;
}
main(){

cout<<"PROGRAM MEMBALIKKAN NAMA"<<endl;
cout<<"=========================="<<endl<<endl;
nil_a();
lagi:
cout<<"Masukkan nama = ";gets(tumpuk.data);
char jwb;
if(jk_kosong()==1)
{tumpuk.top++;}
else if(jk_penuh()==0)
{tumpuk.top++;}
int panjang=strlen(tumpuk.data);
cout<<"Setelah di balik : ";
for(int i=panjang-1;i>=0;i--)
cout<<tumpuk.data[i];
cout<<"\nCoba lagi y/t = ";cin>>jwb;cout<<endl;
if(jwb=='Y' || jwb=='y')
goto lagi;
else
exit:

getch();}