why  my program  can  not be  passed?my  program 
is  not missing  the "()",but  when  I debug it ,it  
says  my program missing the  (),please help me;
my   program  is  in  accessories.....
I  can  not  find  the  error....and  why 
does  not  passed  by  visual  stuio 2008...
thank  you !!!

-------------------------------------------------------------------
ÐÂÀ˿ռ䡪¡ªÓëÅóÓÑ¿ªÐÄ·ÖÏíÍøÂçÐÂÉú»î£¡(http://space.sina.com.cn/ )
  ----------

 /* main2-1.c ¼ìÑébo2-1.cµÄÖ÷³ÌÐò */
 #include"c1.h"
 typedef int ElemType;
 #include"c2-1.h"
 #include"bo2-1.c"
 #include"func2-3.c" /* °üÀ¨equal()¡¢comp()¡¢print()¡¢print2()ºÍprint1()º¯Êý */

 Status sq(ElemType c1,ElemType c2)
 { /* Êý¾ÝÔªËØÅж¨º¯Êý(ƽ·½¹ØÏµ)£¬LocateElem()µ÷Óõĺ¯Êý */
   if(c1==c2*c2)
     return TRUE;
   else
     return FALSE;
 }

 void dbl(ElemType *c)
 { /* ListTraverse()µ÷ÓõÄÁíÒ»º¯Êý(ÔªËØÖµ¼Ó±¶) */
   *c*=2;
 }

 void main()
 {
   SqList L;
   ElemType e,e0;
   Status i;
   int j,k;
   InitList(&L);
   printf("³õʼ»¯Lºó£ºL.elem=%u L.length=%d 
L.listsize=%d\n",L.elem,L.length,L.listsize);
   for(j=1;j<=5;j++)
     i=ListInsert(&L,1,j);
   printf("ÔÚLµÄ±íÍ·ÒÀ´Î²åÈë1¡«5ºó£º*L.elem=");
   for(j=1;j<=5;j++)
     printf("%d ",*(L.elem+j-1));
   printf("\n");
   printf("L.elem=%u L.length=%d L.listsize=%d ",L.elem,L.length,L.listsize);
   i=ListEmpty(L);
   printf("LÊÇ·ñ¿Õ£ºi=%d(1:ÊÇ 0:·ñ)\n",i);
   ClearList(&L);
   printf("Çå¿ÕLºó£ºL.elem=%u L.length=%d L.listsize=%d 
",L.elem,L.length,L.listsize);
   i=ListEmpty(L);
   printf("LÊÇ·ñ¿Õ£ºi=%d(1:ÊÇ 0:·ñ)\n",i);
   for(j=1;j<=10;j++)
     ListInsert(&L,j,j);
   printf("ÔÚLµÄ±íβÒÀ´Î²åÈë1¡«10ºó£º*L.elem=");
   for(j=1;j<=10;j++)
     printf("%d ",*(L.elem+j-1));
   printf("\n");
   printf("L.elem=%u L.length=%d L.listsize=%d\n",L.elem,L.length,L.listsize);
   ListInsert(&L,1,0);
   printf("ÔÚLµÄ±íÍ·²åÈë0ºó£º*L.elem=");
   for(j=1;j<=ListLength(L);j++) /* ListLength(L)ÎªÔªËØ¸öÊý */
     printf("%d ",*(L.elem+j-1));
   printf("\n");
   printf("L.elem=%u(ÓпÉÄܸıä) L.length=%d(¸Ä±ä) 
L.listsize=%d(¸Ä±ä)\n",L.elem,L.length,L.listsize);
   GetElem(L,5,&e);
   printf("µÚ5¸öÔªËØµÄֵΪ£º%d\n",e);
   for(j=10;j<=11;j++)
   {
     k=LocateElem(L,j,equal);
     if(k) /* k²»Îª0£¬±íÃ÷ÓзûºÏÌõ¼þµÄÔªËØ£¬ÇÒÆäλÐòΪk */
       printf("µÚ%d¸öÔªËØµÄֵΪ%d\n",k,j);
     else
       printf("ûÓÐֵΪ%dµÄÔªËØ\n",j);
   }
   for(j=3;j<=4;j++)
   {
     k=LocateElem(L,j,sq);
     if(k) /* k²»Îª0£¬±íÃ÷ÓзûºÏÌõ¼þµÄÔªËØ£¬ÇÒÆäλÐòΪk */
       printf("µÚ%d¸öÔªËØµÄֵΪ%dµÄƽ·½\n",k,j);
     else
       printf("ûÓÐֵΪ%dµÄƽ·½µÄÔªËØ\n",j);
   }
   for(j=1;j<=2;j++) /* ²âÊÔÍ·Á½¸öÊý¾Ý */
   {
     GetElem(L,j,&e0); /* °ÑµÚj¸öÊý¾Ý¸³¸øe0 */
     i=PriorElem(L,e0,&e); /* Çóe0µÄǰÇý */
     if(i==INFEASIBLE)
       printf("ÔªËØ%dÎÞǰÇý\n",e0);
     else
       printf("ÔªËØ%dµÄǰÇýΪ£º%d\n",e0,e);
   }
   for(j=ListLength(L)-1;j<=ListLength(L);j++) /* ×îºóÁ½¸öÊý¾Ý */
   {
     GetElem(L,j,&e0); /* °ÑµÚj¸öÊý¾Ý¸³¸øe0 */
     i=NextElem(L,e0,&e); /* Çóe0µÄºó¼Ì */
     if(i==INFEASIBLE)
       printf("ÔªËØ%dÎÞºó¼Ì\n",e0);
     else
       printf("ÔªËØ%dµÄºó¼ÌΪ£º%d\n",e0,e);
   }
   k=ListLength(L); /* kΪ±í³¤ */
   for(j=k+1;j>=k;j--)
   {
     i=ListDelete(&L,j,&e); /* ɾ³ýµÚj¸öÊý¾Ý */
     if(i==ERROR)
       printf("ɾ³ýµÚ%d¸öÔªËØÊ§°Ü\n",j);
     else
       printf("ɾ³ýµÚ%d¸öÔªËØ³É¹¦£¬ÆäֵΪ£º%d\n",j,e);
   }
   printf("ÒÀ´ÎÊä³öLµÄÔªËØ£º");
   ListTraverse(L,print1); /* ÒÀ´Î¶ÔÔªËØµ÷ÓÃprint1()£¬Êä³öÔªËØµÄÖµ */
   printf("LµÄÔªËØÖµ¼Ó±¶ºó£º");
   ListTraverse(L,dbl); /* ÒÀ´Î¶ÔÔªËØµ÷ÓÃdbl()£¬ÔªËØÖµ³Ë2 */
   ListTraverse(L,print1);
   DestroyList(&L);
   printf("Ïú»ÙLºó£ºL.elem=%u L.length=%d 
L.listsize=%d\n",L.elem,L.length,L.listsize);
 }
  ----------

 /* func2-3.c ¼¸¸ö³£Óõĺ¯Êý */
 Status equal(ElemType c1,ElemType c2)
 { /* ÅжÏÊÇ·ñÏàµÈµÄº¯Êý */
   if(c1==c2)
     return TRUE;
   else
     return FALSE;
 }

 int comp(ElemType a,ElemType b)
 { /* ¸ù¾Ýa<¡¢=»ò>b£¬·Ö±ð·µ»Ø-1¡¢0»ò1 */
   if(a==b)
     return 0;
   else
     return (a-b)/abs(a-b);
 }

 void print(ElemType c)
 {
   printf("%d ",c);
 }

 void print2(ElemType c)
 {
   printf("%c ",c);
 }

 void print1(ElemType *c)
 {
   printf("%d ",*c);
 }

  ----------

 /* func2-1.c ²»´øÍ·½áµãµÄµ¥Á´±í(´æ´¢½á¹¹ÓÉc2-2.h¶¨Òå)µÄÀ©Õ¹²Ù×÷(3¸ö) */
 /* algo2-6.cºÍbo7-2.cÓõ½ */
 void InsertAscend(LinkList *L,ElemType e,int(*compare)(ElemType,ElemType))
 { /* 
°´¹Ø¼ü×ַǽµÐò½«e²åÈë±íL¡£º¯Êýcompare()·µ»ØÖµÎª£ºÐβÎ1µÄ¹Ø¼ü×Ö-ÐβÎ2µÄ¹Ø¼ü×Ö */
   LinkList q=*L;
   if(!*L||compare(e,(*L)->data)<=0) /* Á´±í¿Õ»òeµÄ¹Ø¼ü×ÖСÓÚµÈÓÚÊ×½áµãµÄ¹Ø¼ü×Ö 
*/
     ListInsert(L,1,e); /* ½«e²åÔÚ±íÍ·£¬ÔÚbo2-8.cÖÐ */
   else
   {
     while(q->next&&compare(q->next->data,e)<0) /* 
q²»ÊÇβ½áµãÇÒqµÄÏÂÒ»½áµã¹Ø¼ü×Ö<eµÄ¹Ø¼ü×Ö */
       q=q->next;
     ListInsert(&q,2,e); /* ²åÔÚqËùÖ¸½áµãºó(½«q×÷ΪͷָÕë) */
   }
 }

 LinkList Point(LinkList L,ElemType 
e,Status(*equal)(ElemType,ElemType),LinkList *p)
 { /* 
²éÕÒ±íLÖÐÂú×ãÌõ¼þµÄ½áµã¡£ÈçÕÒµ½£¬·µ»ØÖ¸Ïò¸Ã½áµãµÄÖ¸Õ룬pÖ¸Ïò¸Ã½áµãµÄǰÇý(Èô¸Ã½áµãÊÇ
 */
   /* Ê×Ôª½áµã£¬Ôòp=NULL)¡£Èç±íLÖÐÎÞÂú×ãÌõ¼þµÄ½áµã£¬Ôò·µ»ØNULL£¬pÎÞ¶¨Òå¡£*/
   /* º¯Êýequal()µÄÁ½ÐβεĹؼü×ÖÏàµÈ£¬·µ»ØOK£»·ñÔò·µ»ØERROR */
   int i,j;
   i=LocateElem(L,e,equal);
   if(i) /* ÕÒµ½ */
   {
     if(i==1) /* ÊÇÊ×Ôª½áµã */
     {
       *p=NULL;
       return L;
     }
     *p=L;
     for(j=2;j<i;j++)
       *p=(*p)->next;
     return (*p)->next;
   }
   return NULL; /* ûÕÒµ½ */
 }

 Status DeleteElem(LinkList *L,ElemType *e,Status(*equal)(ElemType,ElemType))
 { /* ɾ³ý±íLÖÐÂú×ãÌõ¼þµÄ½áµã£¬²¢·µ»ØTRUE£»ÈçÎ޴˽áµã£¬Ôò·µ»ØFALSE¡£ */
   /* º¯Êýequal()µÄÁ½ÐβεĹؼü×ÖÏàµÈ£¬·µ»ØOK£»·ñÔò·µ»ØERROR */
   LinkList p,q;
   q=Point(*L,*e,equal,&p);
   if(q) /* ÕÒµ½´Ë½áµã£¬ÇÒqÖ¸Ïò¸Ã½áµã */
   {
     if(p) /* ¸Ã½áµã²»ÊÇÊ×Ôª½áµã£¬pÖ¸ÏòÆäǰÇý */
       ListDelete(&p,2,e); /* ½«p×÷ΪͷָÕ룬ɾ³ýµÚ2¸ö½áµã */
     else /* ¸Ã½áµãÊÇÊ×Ôª½áµã */
       ListDelete(L,1,e);
     return TRUE;
   }
   return FALSE;
 }
  ----------

 /* c2-1.h ÏßÐÔ±íµÄ¶¯Ì¬·ÖÅä˳Ðò´æ´¢½á¹¹ */
 #define LIST_INIT_SIZE 10 /* ÏßÐÔ±í´æ´¢¿Õ¼äµÄ³õʼ·ÖÅäÁ¿ */
 #define LIST_INCREMENT 2 /* ÏßÐÔ±í´æ´¢¿Õ¼äµÄ·ÖÅäÔöÁ¿ */
 typedef struct
 {
   ElemType *elem; /* ´æ´¢¿Õ¼ä»ùÖ· */
   int length; /* µ±Ç°³¤¶È */
   int listsize; /* µ±Ç°·ÖÅäµÄ´æ´¢ÈÝÁ¿(ÒÔsizeof(ElemType)Ϊµ¥Î») */
 }SqList;

  ----------

 /* c1.h (³ÌÐòÃû) */
 #include<string.h>
 #include<ctype.h>
 #include<malloc.h> /* malloc()µÈ */
 #include<limits.h> /* INT_MAXµÈ */
 #include<stdio.h> /* EOF(=^Z»òF6),NULL */
 #include<stdlib.h> /* atoi() */
 #include<io.h> /* eof() */
 #include<math.h> /* floor(),ceil(),abs() */
 #include<process.h> /* exit() */
 /* º¯Êý½á¹û״̬´úÂë */
 #define TRUE 1
 #define FALSE 0
 #define OK 1
 #define ERROR 0
 #define INFEASIBLE -1
 /* #define OVERFLOW -2 ÒòΪÔÚmath.hÖÐÒѶ¨ÒåOVERFLOWµÄֵΪ3,¹ÊÈ¥µô´ËÐÐ */
 typedef int Status; /* StatusÊǺ¯ÊýµÄÀàÐÍ,ÆäÖµÊǺ¯Êý½á¹û״̬´úÂ룬ÈçOKµÈ */
 typedef int Boolean; /* BooleanÊDz¼¶ûÀàÐÍ,ÆäÖµÊÇTRUE»òFALSE */



[Non-text portions of this message have been removed]


------------------------------------

To unsubscribe, send a blank message to <mailto:[EMAIL PROTECTED]>.Yahoo! 
Groups Links

<*> To visit your group on the web, go to:
    http://groups.yahoo.com/group/c-prog/

<*> Your email settings:
    Individual Email | Traditional

<*> To change settings online go to:
    http://groups.yahoo.com/group/c-prog/join
    (Yahoo! ID required)

<*> To change settings via email:
    mailto:[EMAIL PROTECTED] 
    mailto:[EMAIL PROTECTED]

<*> To unsubscribe from this group, send an email to:
    [EMAIL PROTECTED]

<*> Your use of Yahoo! Groups is subject to:
    http://docs.yahoo.com/info/terms/

Reply via email to