程序填空题：进制转换
将一个十进制数转换成八进制数。
```c++
#include
using namespace std;
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status;
typedef struct SNode {
int data;
struct SNode *next;
} SNode, *LinkStack;
Status InitStack(LinkStack &S) {
S = NULL;
return OK;
}
bool StackEmpty(LinkStack S) {
if (!S)
return true;
return false;
}
Status Push(LinkStack &S, int e) {
LinkStack p;
p = new SNode;
if (!p) {
return OVERFLOW;
}
p->data = e;
p->next = S;
S = p;
return OK;
}
Status Pop(LinkStack &S, int &e) {
LinkStack p;
if (!S)
return ERROR;
e = S->data;
p = S;
S = S->next;
delete p;
return OK;
}
void conversion(int N) {
int e;
LinkStack S;
InitStack(S);
while (N)
{
@@[Push(S, N % 8)](2);
N = N / 8;
}
while (!StackEmpty(S))
{
@@[Pop(S, e)](2);
cout << e;
}
}
int main() {
int n, e;
cin >> n;
conversion(n);
return 0;
}
```
答案：
第1空：Push(S, N % 8)
第2空：Pop(S, e)
```c++
#include
using namespace std;
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status;
typedef struct SNode {
int data;
struct SNode *next;
} SNode, *LinkStack;
Status InitStack(LinkStack &S) {
S = NULL;
return OK;
}
bool StackEmpty(LinkStack S) {
if (!S)
return true;
return false;
}
Status Push(LinkStack &S, int e) {
LinkStack p;
p = new SNode;
if (!p) {
return OVERFLOW;
}
p->data = e;
p->next = S;
S = p;
return OK;
}
Status Pop(LinkStack &S, int &e) {
LinkStack p;
if (!S)
return ERROR;
e = S->data;
p = S;
S = S->next;
delete p;
return OK;
}
void conversion(int N) {
int e;
LinkStack S;
InitStack(S);
while (N)
{
@@[Push(S, N % 8)](2);
N = N / 8;
}
while (!StackEmpty(S))
{
@@[Pop(S, e)](2);
cout << e;
}
}
int main() {
int n, e;
cin >> n;
conversion(n);
return 0;
}
```
答案：
第1空：Push(S, N % 8)
第2空：Pop(S, e)
