填空题1. #include "stdio.h"void fun(int a, int *p){int n=0;while(a){n++;a=a/10;}/******************/*p=n;}main(){int x,n;printf("请输入一个整除:");scanf("%d",&x);/******************/fun(x,&n);printf("%d共有%d位数\n",x,n);}2. #inc lude "stdio.h"int fun(int n){int i;/***********found1**********/ for (i=2; i<=n-1; i++)/***********found2**********/if (n%i==0)return 0;return 1;}main(){int i,n=0;/***********found3**********/for (i=100; n<5; i--)if (fun(i)){printf("%5d",i);n++;}printf("\n");}3. #inc lude "stdio.h"void fun(int a, int *p){int n=0;while(a){n++;a=a/10;}/******************/*p=n;}main(){int x,n;printf("请输入一个整除:");scanf("%d",&x);/******************/fun(x,&n);printf("%d共有%d位数\n",x,n);}4. /*程序的功能是：删去一维数组中所有相同的数，使之只剩一个。
数组中的数已按由小到大的顺序排列，函数返回删除后数组中数据的个数。
例如，一维数组中的数据是：2 2 234 456 6 6 67 789 9 10 10 10。
删除后数组中的内容应该是：2 3 4 5 6 7 8 9 10。
注意：源程序文件为blank7.cpp。
程序中有三处要填的内容，请把对应的下划线删除，并填入正确的内容(请勿动其他内容，否则影响得分) */#include <stdio.h>#define N 80/************found1*********/int fun(int a[], int n){ int i=0,j;while(i<n-1)if(a[i]==a[i+1]){ for(j=i;j<n-1;j++)a[j]=a[j+1];/************found2*********/n=fun(a,n-1);}elsei++;return n;}main(){ int a[N]={2,2,2,3,4,4,5,6,6,6,6,7,7,8,9,9,10,10,10,10},i,n=20;printf("The original data :\n");for(i=0; i<n; i++)printf("%3d",a[i]);/************found3*********/n=fun(a,n);printf("\n\nThe data after deleted :\n");for(i=0;i<n;i++)printf("%3d",a[i]); printf("\n\n");}5. #include <stdio.h>void fun(int a[], int b[], int n){int i;/**************found1**************/for (i=0; i<6; i++) b[i] =0;for (i=0; i<n; i++)if (a[i] >= 5000) b[5]++;/**************found2**************/else b[a[i]/1000]++;}main(){ int i, a[100]={ 900, 1800, 2700, 3800, 5900, 3300, 2400, 7500, 3800}, b[6];fun(a, b, 9);printf("The result is: ");/**************found3**************/for (i=0; i<6; i++) printf("%d ", b[i]);printf("\n");}6. #inc lude <stdio.h>void fun(int *a, int *n){int i, j = 0 ;for(i = 1 ; i <= 1000 ; i++) {if(((i % 7 == 0) || (i % 11 == 0)) && i % 77 != 0)/**************found1**************/a[j++] =i ;}/**************found2**************/*n =j ;}main(){ int aa[1000], n, k ;/**************found3**************/fun (aa,&n ) ;for ( k = 0 ; k < n ; k++ )if((k + 1) % 10 == 0)printf("\n") ;elseprintf("%5d", aa[k]) ;}7. #inc lude <string.h>#include <stdio.h>#include <ctype.h>#define N 81fun ( char *s ){/**************found1**************/char *p =s;while(*p){if(*p == 'Z')/**************found2**************/*p = 'A';else if(*p == 'z')/**************found3**************/*p = 'a' ;else if(isalpha(*p)) *p = (*p) + 1 ;p++ ;}}main( ){ char a[N];printf ( "Enter a string : " );gets ( a );printf ( "The original string is : " );puts( a );fun ( a );printf ( "The string after modified : ");puts ( a );}8. #inc lude <stdio.h>#include <string.h>#include <ctype.h>#define N 9long ctod( char *s ){ long d=0;while(*s)if(isdigit( *s)){/**********found1**********/d=d*10+*s-'0';/**********found2**********/s++;}return d;}long fun( char *a, char *b ){/**********found3**********/return ctod(a)+ctod(b);}NONO();main(){ char s1[N],s2[N];do{ printf("Input string s1 : "); gets(s1); } while( strlen(s1)>N );do{ printf("Input string s2 : "); gets(s2); } while( strlen(s2)>N );printf("The result is: %ld\n", fun(s1,s2) ); NONO();}NONO(){FILE *fr,*fw;char x[100],y[100];fr=fopen("blank7.in","r");fw=fopen("blank7.out","w");fscanf(fr,"%s%s",x,y);fprintf(fw,"%ld",fun(x,y));fclose(fr);fclose(fw);}9.#include <stdio.h>#include <stdlib.h>int fun(char *source, char *target){ FILE *fs,*ft; char ch;/**********found**********/if((fs=fopen(source, "r"))==NULL)return 0;if((ft=fopen(target, "w"))==NULL)return 0;printf("\nThe data in file :\n");ch=fgetc(fs);/**********found**********/while(!feof(fs)){ putchar( ch );/**********found**********/fputc(ch,ft);ch=fgetc(fs); }fclose(fs); fclose(ft);printf("\n\n");return 1; }main(){ char sfname[20] ="myfile1",tfname[20]="myfile2";FILE *myf; int i; char c;myf=fopen(sfname,"w");printf("\nThe original data :\n");for(i=1; i<30; i++){ c='A'+rand()%25;fprintf(myf,"%c",c);printf("%c",c);}fclose(myf);printf("\n\n");if (fun(sfname, tfname))printf("Succeed!");elseprintf("Fail!"); }。
