lointsz.c

长整数计算 用于计算长整数的加减乘除 如:100,000 ,000+200,000 ,000=300,000 ,

#include "stdio.h"
#include "stdlib.h"
#include "conio.h"
#include "math.h"
typedef int elemtype;
typedef struct Dunode{ elemtype data;
		       struct Dunode *prior;
		       struct Dunode *next;
		     }DuLnode;

DuLnode *creatDu(char *x)
{ int i;
  DuLnode *p,*q,*h=(DuLnode*)malloc(sizeof(DuLnode));
  p=h->next;p->prior=h;
  i=atoi(x);
  if(i<0) h->data=0;
  if(i>0) h->data=1;
  while(*x!=',') x++;

  p=(DuLnode*)malloc(sizeof(DuLnode));
  p->data=i;
  q=p->next;q->prior=p;
  x=x+1;
  while(*x!='\0')
   { i=atoi(x);
     x=x+5;
     p=(DuLnode*)malloc(sizeof(DuLnode));
     p->data=i;q=p->next;q->prior=p;
   }
  p->next=h;h->prior=p;
  return h;
}//creatDu

/*void  Dusum(DuLnode *la,DuLnode *lb)
{ DuLnode *p,*q,*r,*lc=(DuLnode*)malloc(sizeof(DuLnode));
  int f=0;
  lc->data=la->data*lb->data;r=lc->prior;r->next=lc;
  p=la->prior;q=lb->prior;
  while(p->next!=la&&q->next!=lb)
   { r->data=p->data+q->data+f;
     if(r->data>10000) {f=1;r->data=r->data-10000;}
     else f=0;

   }

} */

void main()
{DuLnode *la,*lb,*p,*q;
 char *x,*y;
 clrscr();
 printf("please input la:\n");
 scanf("%s",x);
// la=creatDu(x);
// p=la->next;
// while(p->next!=la)
// {printf("%d",p->data);p=p->next;
// }
}