栈的问题！

[preetyboy200]

请用C语言来编写一个你逆序输出（用栈来实现）
请写出源程序

[senda]

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

typedef int DataType;
const int MaxSize = 20;

class Stack
{
private:

//array list
DataType list[MaxSize];
int rear, front, count;

public:

//constructure
Stack(void);

//change stack methods
void Push(const DataType &item);
DataType Pop(void);
void ClearStack(void);

//access stack methods
DataType Front(void) const;
int Empty(void) const;
int Full(void) const;
};

Stack::Stack(void)
{
front = rear = count = 0;
}

void Stack::Push(const DataType &item)
{
if(count == MaxSize - 1)
{
cerr<<"stack already full"<<endl;
exit(1);
}

list[count] = item;
count++;
rear = (rear + 1) % MaxSize;
}

DataType Stack::Delete(void)
{
DataType temp;

if(count == 0)
{
cerr<<"stack is empty!"<<endl;
exit(1);
}

temp = list[count];
count--;
front = (front + 1) % MaxSize;
return temp;
}

void Stack::ClearStack(void)
{
count = 0;
}

DataType Stack::Front(void) const
{
return list[count];
}

int Stack::Empty(void) const
{
return count == 0;
}

int Stack::Full(void) const
{
return count == MaxSize - 1;
}

void main()
{
Stack S;
char string[12];

cout<<"Enter a string: ";
cin.getline(string, 12, '\n');

while(string[i] != NULL)
S.Push(string[i++]);

while(!S.Empty())
cout<<S.Pop();

cout<<endl;
}

[senda]

程序没有编译，不知通不通。
哈哈，IBM小子，他可是大师啊，要加油啊

[preetyboy200]

你是用C++做的
我不懂啊

[xiaomimiya]

#include<stdio.h>
main()
{
char a[20];
int i;
gets(a);
for(i=strlen(a)-1;i>=0;i--)
printf("%c",a[i]);
printf("\n");
getch();
}

[willian2003]

我也想知道啊用c怎么做呢？