请按qq好友管理程序

/*H E LLO.C--Hello,wor ld*/

#inc lude "stdio.h"

#include "conio.h"struct qq

{char num[12];char name[10];char age[2];

}Qq[1];ma in()

{int kk=1;char cho ice;loop2 : init();loop:scanf("%c",&choice);switch(cho ice)

{case'n' :case'N' :newf();break;case'a' :case'A' :break;case'l' :case'L' :system("cls");listf();getch();system("cls");goto loop2;case'f' :case'F' :findf();getch();goto loop2;case'd' :case'D' :deletef();getch();goto loop2;case'q' :case'Q' :return 0;default:goto loop;

}while(kk==1)

{addf();printf("enter 1 to continue add.\n");s c an f("%d",&kk);sys te m("c ls");

}goto loop2;

}int init()

{

");

printf("*******查看记录情况请按l(lis t)********\n");printf("*****查询某个记录情况请按f(fin d)******\n");

");

}int newf()

{

FILE*fp,*Fp; int n;

Fp=fop en("Q Q","w");fclos e(Fp);fp=fop e n("nu m","w");n=0;fp r int f(fp,"%d",n);fclose(fp);

}int add f()

{

FILE*fp 1,*fp;int n;

");

fp1=fopen("QQ","a");scanf("%s%s%s",&Q q[0].num,&Q q[0].name,&Q q[0].age);fwrite(&Qq[0],sizeof(struct qq),1,fp 1);fclose(fp1);fp=fop e n("nu m","r");fscanf(fp,"%d",&n);fclo se(fp);fp=fop en("num","w");n++;fp r int f(fp,"%d",n);fclose(fp);

}int listf()

{

FILE*fp;int n,i,k=0;fp=fop e n("nu m","r");fscanf(fp,"%d",&n);fclo se(fp);fp=fop en("Q Q","r");for(i=0;i<n;i++)

{fre ad(&Qq[0],s izeo f(struct qq),1,fp);print f("Q Q:%s\nname:%s\nage:%s\n\n\n",&Q q[0].num,&Q q[0].nam e,&Q q[0].a ge);k++;if(k%4==0) {printf("\nput any key co ntinue\n");getc h();s ystem("c ls");k=0;}}fclose(fp);

}

int findf()

{char namef[10];int n,i;

FILE*fp;

scanf("%s",&namef);fp=fop e n("num","r");fscanf(fp,"%d",&n);struct qq q[n];fclose(fp);fp=fopen("QQ","r");for (i=0;i<n;i++)

{fread(&q[i],sizeof(struct qq),1,fp);if(strc mp(q[i].name,name f)==0)

{pr int f("Q Q:%s\nna m e:%s\na ge:%s\n\n\n",q[i].num,q[i].name,q[i].a ge);fclo se(fp);return 0;

}

}printf("sorry, the name can't be found.\n");printf("put any key continue.\n");fclose(fp);

}int de lete f()

{char name f[10];int n,i,kk=-1;

FILE*fp;

");scanf("%s",&namef);fp=fo p en("num","r");fscanf(fp,"%d",&n);struct qq q[n];fclose(fp);fp=fopen("QQ","r");for(i=0;i<n;i++)

{fread(&q[i],sizeo f(struct qq),1,fp);if(s trc mp(q[i].name,name f)==0) kk=i;

}fclose(fp);if(kk==-1)

{printf("sorry, the name can't be found.\n");printf("put any key continue.\n");return 0;

}elsefp=fopen("QQ","w");fo r(i=0;i<kk;i++)fwrite(&q[i],sizeof(struct qq),1,fp);fo r(i=kk+1;i<n;i++)fwrite(&q[i],sizeof(struct qq),1,fp);fclose(fp);n=n-1;fp=fo p en("num","w");fp r int f(fp,"%d",n);fclose(fp);

}