一种简单的英文词典排版系统的实现.docxVIP

#include stdio.h #include stdlib.h #include string.h #include ctype.h #define M 256 #define N 32 FILE *fp; char a[M][N]; charget_option(void); int b(int n); void c(char *pt[], int n); int check(char arr[], int n); void storage(char *pt[], int n); int main(void) { inti,n; int start; char *pt[M]; charch, len; char input; if((fp=fopen(words.txt,a+))==NULL) { fputs(2??ü′ò?a?ò?¨á￠???t￡?\n,stderr); exit(1); } fseek(fp,0L,2); start=(int)ftell(fp)/32; n=start; rewind(fp); if(fread(a,32*sizeof(char),start,fp)==0) { i=0; puts(??ê?è?μ￥′ê￡¨??DDò???￡?￡??úD?DDê?è?END?áê?ê?è?￡o); while(iMscanf(%s, a[i])==1) { fflush(stdin);if(strncmp(a[i],END,3)==0) { n+=i; break; } if(check(a[i], i)) continue; i++; } } puts(**********************************);puts(?úòa×?D?ê2?′￡?); puts(a. ??ê?ò?óDμ?μ￥′ê ); puts(b. ìí?óD?μ￥′ê);puts(c. ??ò?óDμ?μ￥′ê??DD??Dò ); puts(d. í?3?);puts(**********************************);while((input=get_option())!=d) { if(input==a) { puts(ò?óDμ?μ￥′ê:); for(i=0;in;i++) {puts(a[i]); } } if(input==b) { puts(??ê?è?D?μ?μ￥′ê￡¨??DDò???￡?￡??úD?DDê?è?END?áê?ê?è?: ); n=b(n); } if(input==c) { puts(??μ￥′ê??DD??Dò:); c(pt, n); for(i=0;in;i++) { puts(pt[i]); } } puts(?1òa×?D?ê2?′?); } storage(pt,n); fclose(fp); puts(?ù??!); return 0; } charget_option(void) { charch;while((ch=getchar())a||chd) { while((ch=getchar())!=\n) ; puts(??ê?è?a,b,c?ò??d.); }returnch; } void c(char *pt[], int n) { inti,j; char *temp; for(i=0;iM;i++) pt[i]=a[i]; for(i=0;in;i++) for(j=i+1;jn;j++) { if(strcmp(pt[i],pt[j])0) { temp=pt[i]; pt[i]=pt[j]; pt[j]=temp; } } } int check(char arr[], int n) { int i; int flag=0; for(i=0;istrlen(arr);i++) if(isalpha(arr[i])==0) { printf(%s2?ê?ò???μ￥′ê.\n,arr); flag=1; break; } for(i=0;in;i++) if(strncmp(a[i],a[n],strlen(a[n])+1)==0) { puts(???′μ?μ￥′ê!); flag=1; } return flag; } void storage(char *pt[], int n) { inti,j; charptr[M][N]; c(pt, n); for(i=0;in;i++) for(j=0;pt[i][j]!=\0;j++) ptr[i][j]=pt[i][j]; fp=fopen(words.txt,w+); rewind(fp); fwrite(ptr,32*sizeof(char),n,fp); }int