[repo] remove tail spaces

Author: inkydragon

016/16.c

@@ -70,7 +70,7 @@ for(i=0;i<6;i++)
         printf(" |\n|");
     }
     /*scanf("%*c");/*键入回车输出下一个月的日历*/
- 
+
 }
 puts("=================================================================|");
 puts("\n Press any key to quit...");

019/19.c

@@ -25,4 +25,3 @@ main()
     printf("\n Press any key to quit...\n");
     getch();
 }
-    

028/28.c

@@ -1,7 +1,7 @@
 #define ERR 5
 #define OK 6
 #include <stdio.h>
-  
+
 int status;
 double result,sig,scale;
 int sign(int c)/*处理数的符号函数*/
@@ -29,7 +29,7 @@ int statbl[ ][4]={{   1,2,3,ERR},/*0*/
 /*转换函数表*/
 int(*funtbl[ ][4])( )={{sign,integer,NULL,NULL},
                     {NULL,integer,NULL,NULL},
-                    {NULL,integer,NULL,NULL},        
+                    {NULL,integer,NULL,NULL},
                     {NULL,decimal,NULL,NULL},
                                     {NULL,decimal,NULL,NULL}};
 
@@ -71,6 +71,6 @@ main()
     printf("\nPlease input real numbers (use nonreal char to end input):\n");
     while(readreal(&x)==1)
         printf("The real number you input is: %f\n",x);
-    printf("\nYou have inputted nonreal char.\n Press any key to quit...\n");    
+    printf("\nYou have inputted nonreal char.\n Press any key to quit...\n");
     getch();
 }

036/36.c

@@ -138,7 +138,7 @@ main()
     print_relate(pSon);
     print_relate(pDaughter);
     print_relate(pCousin);
-    
+
 
     if(!brothersinlaw(pDaughter,pCousin))
         printf("%s and %s are not brothers (sisters) in law.\n",pDaughter->name,pCousin->name);

039/39.C

@@ -158,6 +158,5 @@ void edit()    /* 编辑命令 */
     fclose(fp);
     last=i;
 }
-        
-    
-        
+
+

040/40.c

@@ -34,7 +34,7 @@ main(int argc, char **argv )
         {
             switch(*s)
             {
-                case 'l': 
+                case 'l':
                     lflg=1;
                     break;
                 case 'w':

041/41.c

@@ -300,13 +300,13 @@ main()
                 break;
             case 'n': /* 按学生的姓名寻找记录 */
             case 'N':
-                printf("Please input the student's name you want to search: ");    
+                printf("Please input the student's name you want to search: ");
                 scanf("%s",buf);
                 retrievebyn(stuf,buf);
                 break;
             case 'c': /* 按学生的学号寻找记录 */
             case 'C':
-                printf("Please input the student's code you want to search: ");    
+                printf("Please input the student's code you want to search: ");
                 scanf("%s",buf);
                 retrievebyc(stuf,buf);
                 break;

044/44.c

@@ -53,5 +53,5 @@ void main()
         printf("%4d",R[i]);
     puts("\n Press any key to quit...");
     getch();
-    
+
 }

045/45.c

@@ -49,5 +49,5 @@ void main()
         printf("%4d",R[i]);
     puts("\n Press any key to quit...");
     getch();
-    
+
 }

046/46.c

@@ -40,5 +40,5 @@ void main()
         printf("%4d",R[i]);
     puts("\n Press any key to quit...");
     getch();
-    
+
 }

047/47.c

@@ -59,5 +59,5 @@ void main()
         printf("%4d",R[i]);
     puts("\n Press any key to quit...");
     getch();
-    
+
 }

048/48.c

@@ -60,5 +60,5 @@ void main()
         printf("%4d",R[i]);
     puts("\n Press any key to quit...");
     getch();
-    
+
 }

052/52.C

@@ -16,7 +16,7 @@ for(i=m;i>=k;i--)
 if(k>1)
 comb(i-1,k-1);
 else
-{ wei=0;                    /* 预值0 */ 
+{ wei=0;                    /* 预值0 */
 val=0;
 for(j=a[0];j>0;j--)              /* 每一种组合求它们的重量和价值 */
 { wei=wei+Bag[a[j]].weight;

053/53.c

@@ -50,7 +50,7 @@ void main()
      Initlist(SEQA);
 
      for (i=0;i<ListSize;i++)
-     {    
+     {
          InsertList (SEQA,i,i);
          printf("%d\n",SEQA->data[i]);
      }

055/55.c

@@ -128,6 +128,6 @@ int main(){
     for(i =0; i<list.length; i++){
         printf("%d\n",list.elem[i]);
     }    printf("%d\n", list.length);
-    
+
     return 1;
 }

056/56.c

@@ -27,7 +27,7 @@ main()
         q=p; /*q自己移到当前最后一个元素，以备继续链接所用*/
         scanf("%c",&ch);
         getchar();
-    }    
+    }
     /*以上完成了单链表的创建*/
     q=l->next;
     p=q->next;
@@ -45,7 +45,7 @@ main()
     }
     r->next=q;
     l->next=r; //头结点指向最后一个结点
-    
+
     q=l; /*输入整个链表前，先将q移到链表头，l一般不动*/
     while(q->next!=NULL) /*若q所指向的元素后面还有其它元素，则将该元素的数据输出*/
     {

057/57.c

@@ -16,7 +16,7 @@ struct pro     //表示项目的结构体
 struct achievement ach[5];
 int number;};
 
-struct Node         
+struct Node
 {struct pro date;
 struct Node *next;};
 
@@ -75,9 +75,9 @@ void main()
         {
             t=1;
             while(t<=p->date.tag)
-            { 
+            {
                 if(p->date.ach[t-1].schoolnumber==j)
-                {            
+                {
                     printf("获奖项目:%d   ",p->date.number);
                     printf("名次:%d   \n",p->date.ach[t-1].result);
                     printf("获奖人姓名:%s   ",p->date.ach[t-1].name);
@@ -86,7 +86,7 @@ void main()
                         x[i]=x[i]+p->date.ach[t-1].mark;
                     else
                         y[i]=y[i]+p->date.ach[t-1].mark;
-                }    
+                }
                 t++;
             }
             p=p->next;

059/59.c

@@ -12,7 +12,7 @@ typedef struct LNode{                              //定义链表结构
 int  PassW[N]={3,1,7,2,4,8,4};
 void  Joseph(LinkList p,int m,int x);          //声明函数
 int main()
-{    
+{
     int  i,m;
     LinkList  Lhead,p,q;     //定义三个指向链表结构的指针
     Lhead=(LinkList)malloc(sizeof(LNode));  //初始化头节点
@@ -41,14 +41,14 @@ void  Joseph(LinkList p,int m,int x){
     q=p;
     m%=x;                                  //m对x求余,从而求出链表中的第几个单元是所求节点
     if(m==0)m=x;               //若m刚好可以整除x,则令m=x,因为如果m=0,则不进行下一个
-    //for循环,那样就无法使q指向要删除节点,p指向他的的前一节点,那样则无法进行删除操作  
+    //for循环,那样就无法使q指向要删除节点,p指向他的的前一节点,那样则无法进行删除操作
     for(i=1;i<=m;i++){
         p=q;
         q=p->next;                    //使q指向要删除的节点,p指向q的前一个节点
     }
     p->next=q->next;                              //从循环链表中删除q指向的节点
     i=q->password;
-    printf("%d  ",q->order);                     
+    printf("%d  ",q->order);
     free(q);                                        //释放q指向的空间
     Joseph(p,i,x-1);
 }

060/60.c

@@ -7,7 +7,7 @@ struct Family *get_person(void);    /* Prototype for input function */
 char related(struct Family *pmember1, struct Family *pmember2);
 char set_ancestry(struct Family *pmember1, struct Family *pmember2);
 
-struct Date   
+struct Date
 {
     int day;
     int month;
@@ -31,55 +31,55 @@ void main()
     struct Family *first = NULL;    /* Pointer to first person        */
     struct Family *current = NULL;  /* Pointer to current person      */
     struct Family *last = NULL;     /* Pointer to previous person     */
-    
+
     char more = '\0';               /* Test value for ending input    */
-    
+
     for( ; ; )
     {
-        printf("\nDo you want to enter details of a%s person (Y or N)? ", 
+        printf("\nDo you want to enter details of a%s person (Y or N)? ",
             first != NULL?"nother " : "" );
         scanf(" %c", &more);
-        if(tolower(more) == 'n') 
+        if(tolower(more) == 'n')
             break;
-        
+
         current = get_person();
-        
+
         if(first == NULL)
         {
             first = current;            /* Set pointer to first Family    */
             last = current;             /* Remember for next iteration    */
         }
         else
         {
-            last->next = current;  /* Set next address for previous Family */  
+            last->next = current;  /* Set next address for previous Family */
             current->previous = last; /* Set previous address for current */
-            last = current;           /* Remember for next iteration */             
+            last = current;           /* Remember for next iteration */
         }
     }
-    
+
     current = first;
-    
+
     while(current->next != NULL)  /* Check for relation for each person in    */
     {                       /* the list up to second to last            */
         int parents = 0;      /* Declare parent count local to this block */
         last = current->next; /* Get the pointer to the next              */
-        
+
         while(last != NULL)   /* This loop tests current person           */
         {                     /* against all the remainder in the list    */
             if(related(current, last))         /* Found a parent ?          */
                 if(++parents == 2)   /* Yes, update count and check it        */
                     break;             /* Exit inner loop if both parents found */
-                
+
                 last = last->next;     /* Get the address of the next           */
-        } 
+        }
         current = current->next;   /* Next in the list to check             */
     }
-    
+
     /* Now tell them what we know */
-    
+
     /* Output Family data in correct order */
     current = first;
-    
+
     while (current != NULL)  /* Output Family data in correct order  */
     {
         printf("\n%s was born %d/%d/%d, and has %s and %s as parents.",
@@ -88,18 +88,18 @@ void main()
         if(current->p_to_pa != NULL )
             printf("\n\t%s's birth date is %d/%d/%d  ",
             current->father, current->p_to_pa->dob.day,
-            current->p_to_pa->dob.month, 
+            current->p_to_pa->dob.month,
             current->p_to_pa->dob.year);
         if(current->p_to_ma != NULL)
             printf("and %s's birth date is %d/%d/%d.\n  ",
             current->mother, current->p_to_ma->dob.day,
-            current->p_to_ma->dob.month, 
+            current->p_to_ma->dob.month,
             current->p_to_ma->dob.year);
-        
+
         current = current->next;  /* current points to next in list       */
     }
-    
-    /* Now free the memory */  
+
+    /* Now free the memory */
     current = first;
     while(current->next != NULL)
     {
@@ -113,7 +113,7 @@ void main()
 struct Family *get_person(void)
 {
     struct Family *temp;         /* Define temporary structure pointer */
-    
+
     /* Allocate memory for a structure */
     temp = (struct Family*) malloc(sizeof(struct Family));
     printf("\nEnter the name of the person: ");

064/64.c

@@ -60,7 +60,7 @@ main()
                 x2=j;
             }
         }
- 
+
         huff_node[x1].parent=n+i;    /*将找出的两棵子树合并为一棵子树*/
         huff_node[x2].parent=n+i;
         huff_node[x1].flag=1;
@@ -79,7 +79,7 @@ main()
         while(p!=0)
         {
             if(huff_node[p].lchild==c)
-            
+
                 cd.bits[cd.start]=0;
             else
                 cd.bits[cd.start]=1;
@@ -93,13 +93,13 @@ main()
         huff_code[i].start=cd.start;
     }
         /*输出字符的哈夫曼编码*/
-    puts("The Hafman code are:");    
+    puts("The Hafman code are:");
     for(i=0;i<n;i++)
     {
         for(j=huff_code[i].start;j<=n;j++)
             printf("%10d",huff_code[i].bits[j]);
-        printf("\n");                                                                                                                                                                                                                                                                                                                                                                                                                                      
-        
+        printf("\n");
+
     }
     puts("Press any key to quit...");
     getch();

065/65.C

@@ -28,7 +28,7 @@ void creategraph(int node[20][2],int num)/*num指的是图的边数*/
    {
       from = node[i][0];         /*    边线的起点            */
       to = node[i][1];           /*   边线的终点             */
-      
+
       /* 建立新顶点 */
       newnode = ( graph ) malloc(sizeof(struct node));
       newnode->vertex = to;        /* 建立顶点内容       */