#include <stdio.h>
#include <string.h>
#define MAXSIZE 256
//#define N 78
//#define R 2
typedef int Struct;
typedef struct
{ int elem[MAXSIZE];
   int top;
}SeqStack;
void InintStack_sq(SeqStack *s)
{
  s->top=-1;
   
}
Struct Empty_sq(SeqStack *s)
{  return (s->top=-1);
}
void cobversion(int N,int R)
{ SeqStack *s;
  int x,a;
  s=(SeqStack *)malloc(sizeof(SeqStack));
   InintStack_sq(s);
   while(N)
   { s->top++;
     a=s->elem[s->top]=N%R;
     N=N/R;
     }
     printf("THE\n");
     while(!Empty_sq(s))
     {
       x=s->elem[s->top];
       s->top--;
       printf("%d",x);
     }
   
   }
 


int main(int argc, char *argv[])
{ int Num,r;
  printf("转换");
  scanf("%d%d",&Num,&r);
  if((Num>=0)&&(0<r))
  {cobversion(Num,r);}
    return 0;
}

不太懂

我 自己解决了  哈哈哈  不过 谁能找见我 错的 一样给分..

[ 本帖最后由 fenzhi4297 于 2009-11-10 20:54 编辑 ]

Struct Empty_sq(SeqStack *s)
{  return (s->top==-1);有分没人要！

给你分了  拉拉