未完待续

Posted 2020-12-01 p201821430008

 

#include "stdio.h"
#include "stdlib.h"
typedef struct complex{
 int real;
 int imagine;
 complex *next;
}complex,*node;
int main()
{
 int i,j=0;
 printf("若想输入一个复数请按1，退出请按0");
 scanf("%d",&i);
 
 while(i==1)
 {
  if(i==1)
  {
   int a,b;
   printf("请输入实部:/n");
   scanf("%d",&a);
   printf("请输入虚部/n");
   scanf("%d",&b);
   node q;
   q = head;
   q->real = a;
   q->imagine = b;
   node p;
   p = (complex*)malloc(sizeof(complex));
   q->next = p;
   q = p;
   p->next = NULL;
   j++;
  }
  printf("若想输入一个复数请按1，退出请按0");
  scanf("%d",&i);
 } 
 return 0; 
}
/*node add(complex a,complex b)
 {
  complex *c;
  c->real =a->real+b->real;
  c->imagine =a->imagine+b->imagine;
  return c;   
 }
node reduce(complex a,complex b)
{
  complex c;
  c->real =a->real+b->real;
  c->imagine =a->imagine+b->imagine;
  return c;
 } 
node multiply(complex a,complex b)
{
  complex c;
  c->real =a->real*b->real-a->imagine*b->imagine;
  c->imagine =a->real*b->imagine+a->real*b->imagine;
  return c;
 } 
 
 
 */