Introduction to "NetEase" "homework" programming-C language Onge sixth week

#include <stdio.h>intFuhao ();intMain () {intshuzu[101],m,n,c=0, x,y,z=0, q=0, cn=0;  for(z=0; z<= -; z++) {Shuzu[z]=0; }     Do{scanf ("%d%d",&m,&N); SHUZU[M]+=N; if(m==0) {C++; }        if(m==0&&n==0) {Q++; }        if(m!=0) {cn++; }    } while(c!=2);//printf ("%d%d", shuzu[0],shuzu[9]);  for(x= -;x>1; x--)    {        if(shuzu[x]!=1&&shuzu[x]!=0&&shuzu[x]!=-1) {printf ("%dx%d", shuzu[x],x); Y=x-1;  for(y=x-1;y>0; y--)            {            if(shuzu[y]>0) {printf ("+");  Break; }                if(shuzu[y]<0)                {                     Break; }            }        }        if(shuzu[x]==0)        {            ; }        if(shuzu[x]==1|| shuzu[x]==-1) {printf ("x%d", x); Y=x-1; Y=x-1;  for(y=x-1;y>0; y--)            {            if(shuzu[y]>0) {printf ("+");  Break; }            }        }    }    if(shuzu[1]==1|| shuzu[1]==-1)    {        if(shuzu[1]<0) {printf ("-"); } printf ("x"); }    Else    {        if(shuzu[1]>1)        {            //printf ("+");        }        if(shuzu[1]!=0) printf ("%DX", shuzu[1]); }    if(cn!=0&&shuzu[0]==0) {printf (""); }    if(cn!=0&&shuzu[0]!=0)    {        if(shuzu[0]>0) {printf ("+%d", shuzu[0]); }        if(shuzu[0]<0) {printf ("%d", shuzu[0]); }    }    if(cn==0)    {        if(shuzu[0]==0) {printf ("0"); }        if(shuzu[0]>0) {printf ("+%d", shuzu[0]); }        if(shuzu[0]<0) {printf ("%d", shuzu[0]); }                    }            /*if (shuzu[0]>0) {if (cn!=0) {printf ("+");        } if (shuzu[0]!=0) {printf ("%d", shuzu[0]);    }} if (shuzu[0]<0) {printf ("%d", shuzu[0]);    } if (shuzu[0]=0&&cn==0) {printf ("0"); }*/                    }/*int Fuhao () Ah, how to use ah ah ah {int y=x-1;                for (y=x-1;y>1; y--) {if (shuzu[y]>0) {printf ("+");            Break }        }}*/

polynomial addition

#include <stdio.h>intMax ();intmin ();intMain () {intn,x,y,heng=0, shu=0, sh=0, h=0, q=0, p=0; scanf ("%d",&N); intShuzu[n][n]; //Loop input Array 0k     for(shu=0; shu<n;shu++)    {                   for(heng=0; heng<n;heng++) {scanf ("%d",&Shuzu[heng][shu]); }    }    //than the sizeheng=0, shu=0;  for(shu=0; shu<n-1; shu++) {x=shuzu[0][shu]; H=0, q=0;  for(heng=0; heng<n-1; heng++)                               {                                                         if(x<shuzu[heng+1][shu]) {h++;} if(x==shuzu[heng+1][shu]) {q++;} X=max (x,shuzu[heng+1][shu]);//use function?                                                                             if (X-shuzu[heng+1][shu] <=0) {shuzu[heng+1][shu]=x;} //printf ("%d\n", x);} y=shuzu[h][0]; P=0;  for(sh=0; sh<n-1; sh++)                              {                                                       if(y==shuzu[h][sh+1]) {p++;} Y=min (y,shuzu[h][sh+1]); //printf ("%d\n", y);                              }                              if(x==y&&q!=n-1&&p!=n-1) {printf ("%d%d", shu,h); Break;} }    if(x!=y) printf ("NO"); System ("Pause"); } intMax (A, b) {if(a<=b) {a=b;} returnA;} intmin (A, b) {if(a>=b) {a=b;} returnA;}

Saddle Point (not all of the unknown reason

Introduction to "NetEase" "homework" programming-C language Onge sixth week