作业：用临时的栈将source栈的元素放到dest栈内并恢复source栈

Error_code copy_stack(Stack&d,Stack&s)
{
    Stack i;
    Stack_entry j;
    while(!s.empty()&&s.top(j)==success&&s.pop()==success)
    {
         while(i.push(j)==success&&!i.empty()&&t.top(j)==success&&i.pop()==success)
    {
         if(s.push(j)==success&&d.push(j)==success)
            return success;
         else 
            return overflow;
    }
}

This part didn't quite understand you，and refer to some students.