/*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);
}
炭云怎么样?炭云(之前的碳云),国人商家,正规公司(哈尔滨桓林信息技术有限公司),主机之家测评介绍过多次。现在上海CN2共享IP的VPS有一款特价,上海cn2 vps,2核/384MB内存/8GB空间/800GB流量/77Mbps端口/共享IP/Hyper-v,188元/年,特别适合电信网络。有需要的可以关注一下。点击进入:炭云官方网站地址炭云vps套餐:套餐cpu内存硬盘流量/带宽ip价格购买上...
buyvm正式对外开卖第四个数据中心“迈阿密”的块存储服务,和前面拉斯维加斯、纽约、卢森堡一样,依旧是每256G硬盘仅需1.25美元/月,最大支持10T硬盘。配合buyvm自己的VPS,1Gbps带宽、不限流量,在vps上挂载块存储之后就可以用来做数据备份、文件下载、刷BT等一系列工作。官方网站:https://buyvm.net支持信用卡、PayPal、支付宝付款,支付宝付款用的是加元汇率,貌似...
tmhhost为2021年暑假开启了全场大促销,全部都是高端线路的VPS,速度快有保障。美国洛杉矶CN2 GIA+200G高防、洛杉矶三网CN2 GIA、洛杉矶CERA机房CN2 GIA,日本软银(100M带宽)、香港BGP直连200M带宽、香港三网CN2 GIA、韩国双向CN2。本次活动结束于8月31日。官方网站:https://www.tmhhost.com8折优惠码:TMH-SUMMER日本...