2021-06-28

class SS(object):
def init(self,max):
self.max=max
self.top = -1
self.stack = [None for i in range(self.max)]

def empty(self):
    return self.top is -1

def push(self,value):
    if self.top ==self.max-1:
        raise IndexError("SeqStack is full")
    else :
        self.top +=1
        self.stack[self.top]=value

def peak(self):
    if self.empty():
        raise IndexError("SeqStack is empty")
    else :
        return self.stack[self.top]

def pop(self):
    if self.empty():
        raise IndexError("SeqStack is empty")
    else :
        cur = self.stack[self.top]
        self.top -= 1
        return cur

if name ==“main”:
a = SS(10)
b = SS(10)
print(“input a number”)
n = int(input())
s = 1
while n>8:
n1 = n%8
a.push(n1)
n = (n - n1)/8
s +=1
a.push(n)
b1 = 0
for i in range(s):
b = a.peak()
a.pop()
b=b*(10**(s-i-1))
b1=b1 +b
print(“八进制”,b1)
while n > 2:
n1 = n % 2
a.push(n1)
n = (n - n1) / 2
s += 1
a.push(n)
b1 = 0
for i in range(s):
b = a.peak()
a.pop()
b = b * (10 ** (s - i - 1))
b1 = b1 + b
print(“2进制”, b1)