新思维：C语言程序设计

#include<stdio.h>
 
void judge(___(19)___,int n)
{
    int f,i=0;
    while(i<n-1&&x[i]==x[i+1])
        i++;
    if(i==___(20)___) {
        printf("\n all elements are same");
        return;
    }
    if(x[i]<x[i+1])f=1;
    else f=0;
    for(; i<n-1; i++)
        if(f&&x[i]>x[i+1]||!f&&___(21)___) {
            printf("\n no order");
            return;
        }
    if(___(22)___) printf("\n ascend");
    else printf("\n descend");
}
 
void main()
{
    int a[5]= {1,2,3,4,5},b[5]= {5,4,3,2,1},
	c[5]= {1,4,2,3,5),d[5]={2,2,2,2,2}};
    judge(a,5);
    judge(b,5);
    judge(c,5);
    judge(d,5);
}

#include<stdio.h>
#define N 10
 
void exchange(int a[][N],int n)
{
    int i,j,t;
    for(j=0; j<n/2; j++)
        for(i=0; i<n; i++) {
            t=a[i][j];
            ___(23)___=a[i][n-j-1];
            a[i][n-j-1]=t;
        }
}
 
int issym(int m[][N],int n)
{
    int i,j;
    for(i=0; i<n-1; i++)
        for(j=i; j<n; j++)
            if(___(24)___)    /*对称矩阵判断*/
                return 0;
    ___(25)___ ;
}
void main()
{
    int a[N][N];
    int n=4,i,j,r1,r2;
    for(i=0; i<n; i++)
        for(j=0; j<n; j++)
            scanf("%d",&a[i][j]);
    for(i=0; i<n; i++) {
        for(j=0; j<n.j++)
            printf("%4d",a[i][j]);
        printf("\n");
    }
    r1=issym(a,n);
    exchange( ___(26)___);
    r2=issym(a,n);
    if((r1+r2==2))
        printf("matrix is double symmetric\n");
    else
        printf("matrix is not double symmetric\n");
}

typedef struct point {   /*链表结点数据结构定义*/
    int x;
    struct point*next;
} ___(27)___    ;
 
POT *deletelist(POT *head)
{
    POT *p,*p1,*p2;
    p=___(28)___;
    while(p->next!=NULL) {
        p1=p;
        p2=p->next;
        while(p2!=NULL) {
            if(p2->x==p->x) {
                p1->next=___(29)___;
                free(p2);
                p2=p1->next;
            } else {
                p1=p2;
                p2=p2->next;
            }
        }
        p=___(30)___;
    }
    return head;
}