bbb.cpp

不知道不知道不知道不知道不知道不知道不知道不知道不知道不知道不知道不知道不知道

#include<stdio.h> 
 
#include<malloc.h> 
typedef struct linknode 
{int data; 
struct linknode *left,*right; 
}dnode; 
 
 
dnode *r1,*r2,*r3,*head1,*head2,*head3; 
dnode *head_temp,*rear_temp; 
int flag1,flag2,time1=1,time2=1,time3=1; 
 
dnode* creat() 
{dnode *head,*p,*s; 
int x,cycle=1; 
head=(dnode*)malloc(sizeof(dnode)); 
p=head; 
while(cycle) 
{scanf("%d",&x); 
if(x>=0) 
{s=(dnode*)malloc(sizeof(dnode)); 
s->data=x; 
p->right=s; 
s->left=p; 
p=s; 
} 
else cycle=0; 
} 
head=head->right; 
head->left=NULL; 
p->right=NULL; 
return head; 
} 
 
 
dnode *rear(dnode *head,int *time) 
{dnode *p; 
p=head; 
while(p->right) 
{p=p->right;(*time)++;} 
return p; 
} 
 
 
 
int from_char_to_int(char a) 
{switch(a) 
{case '+':return 1;break; 
case '-':return 0;break; 
} 
} 
 
void input_and_init() 
{char a; 
printf("input (+,-)\n"); 
scanf("%c",&a); 
scanf("%c",&a); 
flag1=from_char_to_int(a); 
 
 
printf("input the first data,input negative data exit\n"); 
head1=creat(); 
r1=rear(head1,&time1); 
printf("input (+,-)\n"); 
scanf("%c",&a); 
scanf("%c",&a); 
flag2=from_char_to_int(a); 
 
printf("input the second data,input negative data exit\n"); 
head2=creat(); 
r2=rear(head2,&time2); 
} 
 
void print(int data) 
{if(data>=1000) 
printf("%d",data); 
else if(data>=100) 
printf("0%d",data); 
else if(data>=10) 
printf("00%d",data); 
else 
printf("000%d",data); 
} 
void display(dnode *rear) 
{dnode *p; 
p=rear; 
 
while(p) 
{print(p->data); 
printf(" "); 
p=p->left; 
} 
printf("\n"); 
} 
 
 
 
 
dnode *find_sum() 
{dnode *head,*p,*s,*p1,*p2; 
int inc=0,sum=0,f1=0,f2=0; 
head=(dnode*)malloc(sizeof(dnode)); 
p=head; 
p1=r1; 
p2=r2; 
 
while(p1!=NULL&&p2!=NULL) 
{sum=p1->data+p2->data+inc; 
inc=0; 
if(sum>=10000) 
{sum=sum-10000; 
inc=1; 
} 
s=(dnode*)malloc(sizeof(dnode)); 
s->data=sum; 
p->right=s; 
s->left=p; 
p=s; 
p1=p1->left;p2=p2->left; 
} 
if(p1==NULL&&p2==NULL) 
if(inc==1) 
{s=(dnode*)malloc(sizeof(dnode)); 
s->data=1; 
p->right=s; 
s->left=p; 
p=s; 
} 
 
while(p1!=NULL) 
{f1=1; 
s=(dnode*)malloc(sizeof(dnode)); 
sum=p1->data+inc; 
inc=0; 
if(sum>=10000) 
{sum=sum-10000; 
inc=1; 
} 
s->data=sum; 
p->right=s; 
s->left=p; 
p=s; 
p1=p1->left; 
} 
 
if(f1==1&&inc==1&&!p1) 
{ 
s=(dnode*)malloc(sizeof(dnode)); 
s->data=1; 
p->right=s; 
s->left=p; 
p=s; 
} 
 
 
 
 
while(p2!=NULL) 
{f2=1; 
s=(dnode*)malloc(sizeof(dnode)); 
sum=p2->data+inc; 
inc=0; 
if(sum>=10000) 
{sum=sum-10000; 
inc=1; 
} 
s->data=sum; 
p->right=s; 
s->left=p; 
p=s; 
p2=p2->left; 
} 
 
 
 
 
if(f2==1&&inc==1) 
{s=(dnode*)malloc(sizeof(dnode)); 
s->data=1; 
p->right=s; 
s->left=p; 
p=s; 
} 
 
 
head=head->right; 
head->left=NULL; 
p->right=NULL; 
return head; 
} 
 
 
 
dnode *find_sub(dnode * s1,dnode *t1) 
{dnode *head,*p,*s,*p1,*p2; 
int dec=0,sub=0; 
head=(dnode*)malloc(sizeof(dnode)); 
p=head; 
p1=s1; 
p2=t1; 
while(p1!=NULL&&p2!=NULL) 
{sub=p1->data-p2->data-dec; 
dec=0; 
if(sub<0) 
{sub=sub+10000; 
dec=1; 
} 
 
s=(dnode*)malloc(sizeof(dnode)); 
s->data=sub; 
p->right=s; 
s->left=p; 
p=s; 
p1=p1->left; 
p2=p2->left; 
} 
 
while(p1!=NULL) 
{s=(dnode*)malloc(sizeof(dnode)); 
sub=p1->data-dec; 
dec=0; 
if(sub<0) 
{sub=sub+10000; 
dec=1; 
} 
s->data=sub; 
p->right=s; 
s->left=p; 
p=s; 
p1=p1->left; 
} 
 
 
 
 
 
while(p2!=NULL) 
{s=(dnode*)malloc(sizeof(dnode)); 
sub=p2->data-dec; 
dec=0; 
if(sub<0) 
{sub=sub+10000; 
dec=1; 
} 
s->data=sub; 
p->right=s; 
s->left=p; 
p=s; 
p2=p2->left; 
} 
 
 
 
head=head->right; 
head->left=NULL; 
p->right=NULL; 
return head; 
} 
 
 
 
void sub() 
{dnode *p1,*p2; 
if(flag2==1)flag2=0; 
else if(flag2==0)flag2=1; 
if(flag1==1&&flag2==1) 
{head3=find_sum(); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
 
if(flag1==0&&flag2==0) 
{head3=find_sum(); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
}  
 
if(flag1==1&&flag2==0) 
{if(time1>time2||(time1==time2&&head1->data>head2->data)) 
{ 
head3=find_sub(r1,r2); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
if(time1<time2||(time1==time2&&head1->data<head2->data)) 
{ 
head3=find_sub(r2,r1); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
} 
if(time1==time2&&head1->data==head2->data) 
{ 
p1=head1; 
p2=head2; 
while(p1->right&&p2->right&&p1->data==p2->data) 
{p1=p1->right; 
p2=p2->right; 
} 
if(p1->data>p2->data) 
{ 
head3=find_sub(r1,r2); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
else if(p1->data<p2->data) 
{ 
head3=find_sub(r2,r1); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
} 
else 
printf("\n0\n"); 
} 
} 
 
 
if(flag2==1&&flag1==0) 
{if(time2>time1||(time1==time2&&head2->data>head1->data)) 
{ 
head3=find_sub(r2,r1); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
if(time2<time1||(time1==time2&&head2->data<head1->data)) 
 
{ 
head3=find_sub(r1,r2); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
} 
 
if(time1==time2&&head1->data==head2->data) 
{ 
p1=head1; 
p2=head2; 
while(p1->right&&p2->right&&p1->data==p2->data) 
{p1=p1->right; 
p2=p2->right; 
} 
if(p1->data>p2->data) 
{ 
head3=find_sub(r1,r2); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
} 
else if(p1->data<p2->data) 
{ 
head3=find_sub(r2,r1); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
else 
printf("\n0\n"); 
} 
 
 
} 
 
if(flag2==1)flag2=0; 
else if(flag2==0)flag2=1; 
} 
 
 
void sum() 
{dnode *p1,*p2; 
if(flag1==1&&flag2==1) 
{head3=find_sum(); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
 
if(flag1==0&&flag2==0) 
{head3=find_sum(); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
}  
 
if(flag1==1&&flag2==0) 
{if(time1>time2||(time1==time2&&head1->data>head2->data)) 
{ 
head3=find_sub(r1,r2); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
if(time1<time2||(time1==time2&&head1->data<head2->data)) 
{ 
head3=find_sub(r2,r1); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
} 
if(time1==time2&&head1->data==head2->data) 
{ 
p1=head1; 
p2=head2; 
while(p1->right&&p2->right&&p1->data==p2->data) 
{p1=p1->right; 
p2=p2->right; 
} 
if(p1->data>p2->data) 
{ 
head3=find_sub(r1,r2); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
else if(p1->data<p2->data) 
{ 
head3=find_sub(r2,r1); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
} 
else 
printf("\n0\n"); 
} 
} 
 
 
if(flag2==1&&flag1==0) 
{if(time2>time1||(time1==time2&&head2->data>head1->data)) 
{ 
head3=find_sub(r2,r1); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
if(time2<time1||(time1==time2&&head2->data<head1->data)) 
 
{ 
head3=find_sub(r1,r2); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
} 
 
if(time1==time2&&head1->data==head2->data) 
{ 
p1=head1; 
p2=head2; 
while(p1->right&&p2->right&&p1->data==p2->data) 
{p1=p1->right; 
p2=p2->right; 
} 
if(p1->data>p2->data) 
{ 
head3=find_sub(r1,r2); 
r3=rear(head3,&time3); 
printf("\n- "); 
display(r3); 
} 
else if(p1->data<p2->data) 
{ 
head3=find_sub(r2,r1); 
r3=rear(head3,&time3); 
printf("\n+ "); 
display(r3); 
} 
else 
printf("\n0\n"); 
} 
 
 
} 
} 
 
 
/*dnode * mult(dnode * r1,dnode *r2) 
{dnode * p;int i=0,flag=0; 
for(p=r2;p->left!=NULL;p=p->left) 
{ 
 
 
 
} 
} 
*/ 
dnode * find_sub_mult(dnode * r1,int data ,int i) 
{dnode *head,*p,*s,*rr;int k,inc=0;long sum=0; rr=r1; 
head=(dnode*)malloc(sizeof(dnode));p=head; 
if(i!=0) 
{for(k=1;k<=i;k++) 
{ 
s=(dnode*)malloc(sizeof(dnode)); 
s->data=0; 
p->right=s; 
s->left=p; 
p=s; 
} 
} 
while(rr!=NULL) 
{s=(dnode*)malloc(sizeof(dnode)); 
sum=rr->data*data+inc; 
if(sum>10000) 
{inc=sum/10000; 
s->data=sum-inc*10000; 
}  
else 
{s->data=sum; 
inc=0; 
} 
p->right=s; 
s->left=p; 
p=s; 
rr=rr->left; 
} 
if(inc!=0) 
{ 
s=(dnode*)malloc(sizeof(dnode)); 
s->data=inc; 
p->right=s; 
s->left=p; 
p=s; 
} 
head=head->right; 
head->left=NULL; 
p->right=NULL; 
return head; 
} 
 
 
 
dnode * return_head(dnode *rear) 
{ 
dnode *p; 
p=rear; 
while(p->left) 
p=p->left; 
return p; 
} 
 
dnode * return_rear(dnode *head) 
{ 
dnode *p; 
p=head; 
while(p->right) 
p=p->right; 
return p; 
} 
 
dnode * tansfer_rear2(dnode *rear_temp) 
{dnode *head,*p,*s,*rear; 
rear=rear_temp; 
head=(dnode*)malloc(sizeof(dnode)); 
p=head; 
while(rear!=NULL) 
{ 
 
s=(dnode*)malloc(sizeof(dnode)); 
s->data=rear->data; 
p->right=s; 
s->left=p; 
p=s; 
rear=rear->left; 
} 
 
 
head=head->right; 
head->left=NULL; 
p->right=NULL; 
return p; 
} 
 
 
dnode *find_sum2(dnode *r1,dnode *r2) 
{dnode *head,*p,*s,*p1,*p2; 
int inc=0,sum=0,f1=0,f2=0; 
head=(dnode*)malloc(sizeof(dnode)); 
p=head; 
p1=r1; 
p2=r2; 
while(p1!=NULL&&p2!=NULL) 
{sum=p1->data+p2->data+inc; 
inc=0; 
if(sum>=10000) 
{sum=sum-10000; 
inc=1; 
} 
s=(dnode*)malloc(sizeof(dnode)); 
s->data=sum; 
p->right=s; 
s->left=p; 
p=s; 
p1=p1->left;p2=p2->left; 
} 
if(p1==NULL&&p2==NULL) 
if(inc==1) 
{s=(dnode*)malloc(sizeof(dnode)); 
s->data=1; 
p->right=s; 
s->left=p; 
p=s; 
} 
 
while(p1!=NULL) 
{f1=1; 
s=(dnode*)malloc(sizeof(dnode)); 
sum=p1->data+inc; 
inc=0; 
if(sum>=10000) 
{sum=sum-10000; 
inc=1; 
} 
s->data=sum; 
p->right=s; 
s->left=p; 
p=s; 
p1=p1->left; 
} 
 
if(f1==1&&inc==1&&!p1) 
{ 
s=(dnode*)malloc(sizeof(dnode)); 
s->data=1; 
p->right=s; 
s->left=p; 
p=s; 
} 
 
 
 
 
while(p2!=NULL) 
{f2=1; 
s=(dnode*)malloc(sizeof(dnode)); 
sum=p2->data+inc; 
 
inc=0; 
if(sum>=10000) 
{sum=sum-10000; 
inc=1; 
} 
s->data=sum; 
p->right=s; 
s->left=p; 
p=s; 
p2=p2->left; 
} 
if(f2==1&&inc==1) 
{s=(dnode*)malloc(sizeof(dnode)); 
s->data=1; 
p->right=s; 
s->left=p; 
p=s; 
} 
head=head->right; 
head->left=NULL; 
p->right=NULL; 
return head; 
} 
 
 
 
 
 
 
void multy(dnode *r1,dnode *r2) 
{dnode * p;int i=0,flag=0; 
//cout<<p->data<<endl; 
p=r2; 
while(p!=NULL) 
{head_temp=find_sub_mult(r1,p->data,i); 
rear_temp=return_rear(head_temp); 
rear_temp=tansfer_rear2(rear_temp); 
 
if(flag==0){r3=rear_temp; 
 
flag=1; 
} 
else  
{ 
 
head3=find_sum2(r3,rear_temp); 
r3=return_rear(head3); 
r3=tansfer_rear2(r3); 
 
} 
i++; 
p=p->left; 
} 
r3=tansfer_rear2(r3); 
display(r3); 
} 
 
void mut(dnode *r1,dnode *r2) 
{if((flag1==1&&flag2==1)||(flag1==0&&flag2==0)) 
printf("+ "); 
else  
printf("- "); 
multy(r1,r2); 
 
} 
 
void main_messsage() 
{ 
printf("\t**************************************\n"); 
printf("\t\t1:init\t2:add\n\t\t3:sub\t4:mul\n\t\t5:exit\n"); 
 
printf("\t**************************************\n"); 
} 
 
void main() 
{int a; int flag; 
main_messsage(); 
scanf("%d",&flag); 
while(flag!=5) 
{switch(flag) 
{case 1:input_and_init();break; 
case 2:sum();break; 
case 3:sub();break; 
case 4:mut(r1,r2);break; 
} 
main_messsage(); 
scanf("%d",&flag); 
 
} 
getchar(); 
 
}