用C语言和C++编写一个图书管理系统 急急！！用数据结构和C语言（别使用C++） 编写图书信息管理...

\u7528C\u8bed\u8a00\u548cC++\u7f16\u5199\u4e00\u4e2a\u56fe\u4e66\u7ba1\u7406\u7cfb\u7edf\u3002

#include#include#include#includeusing namespace std;const int N = 25;//\u5b9a\u4e4920\u672c\u56fe\u4e66struct Book { char name[25]; char author[15]; char price[7]; char publisher[20]; char isbn[20];};int ii = 19;Book book[N] = { { "\u7ea2\u4e0e\u9ed1","\u53f8\u6c64\u8fbe","26.00","\u957f\u6c5f\u6587\u827a\u51fa\u7248\u793e","978-7-5354-5003-6" },{ "\u5f20\u4f2f\u82d3\u753b\u4f20","\u6881\u5409\u751f","35.00","\u56db\u5ddd\u6559\u80b2\u51fa\u7248\u793e","978-7-5408-5623-6" },{ "\u56db\u4e16\u751f\u82b1","\u6c88\u715c\u4f26","49.80","\u6e56\u5357\u6587\u827a\u51fa\u7248\u793e","978-7-5404-7718-9" },{ "\u5317\u5927\u4eba\u7684\u793c\u4eea\u8bfe","\u6bb5\u5efa\u6797","39.80","\u5916\u6587\u51fa\u7248\u793e","978-7-119-08439-8" },{ "\u60b2\u60e8\u4e16\u754c","\u96e8\u679c","44.00","\u5317\u65b9\u6587\u827a\u51fa\u7248\u793e","978-7-5317-3049-1" },{ "\u597d\u5417\u597d\u7684","\u5927\u51b0","39.00","\u6e56\u5357\u6587\u827a\u51fa\u7248\u793e","978-7-5404-7689-2" },{ "\u5343\u79cb","\u843d\u843d","28.80","\u957f\u6c5f\u6587\u827a\u51fa\u7248\u793e","978-7-5354-5060-9" },{ "\u966a\u5b89\u4e1c\u5c3c\u5ea6\u8fc7\u6f2b\u957f\u5c81\u6708","\u5b89\u4e1c\u5c3c","28.80","\u957f\u6c5f\u6587\u827a\u51fa\u7248\u793e","978-7-5354-6205-3" },{ "\u5218\u90a6\u6b63\u4f20","\u5468\u542f\u5143","52.80","\u4e2d\u56fd\u6587\u53f2\u51fa\u7248\u793e","978-7-5034-5145-4" },{ "\u5c0f\u738b\u5b50","\u5723\u57c3\u514b\u82cf\u4f69\u91cc","24.00","\u6e56\u5357\u5c11\u513f\u51fa\u7248\u793e","978-7-5562-0233-1" },{ "\u56f4\u57ce","\u94b1\u949f\u4e66","19.00","\u4eba\u6c11\u6587\u5b66\u51fa\u7248\u793e","978-7-02-009000-6" },{ "\u89e3\u5fe7\u6742\u8d27\u94fa","\u4e1c\u91ce\u572d\u543e","39.50","\u5357\u6d77\u51fa\u7248\u793e","978-7-5442-7087-3" },{ "\u8ffd\u98ce\u7b5d\u7684\u4eba","\u80e1\u8d5b\u5c3c","29.00","\u4e0a\u6d77\u4eba\u6c11\u51fa\u7248\u793e","978-7-208-06164-4" },{ "\u6446\u6e21\u4eba","\u9ea6\u514b\u798f\u5c14","36.00","\u767e\u82b1\u6d32\u6587\u827a\u51fa\u7248\u793e","978-7-550-01324-7" },{ "\u795e\u8bdd","\u6731\u5927\u53ef","35.00","\u4e1c\u65b9\u51fa\u7248\u793e","978-7-5060-5278-8" },{ "\u4eba\u6c11\u7684\u540d\u4e49","\u5468\u6885\u68ee","46.90","\u5317\u4eac\u5341\u6708\u6587\u827a\u51fa\u7248\u793e","978-7-5302-1619-4" },{ "\u591c\u8c2d\u5341\u8bb0","\u9a6c\u8bc6\u9014","29.80","\u4eac\u534e\u51fa\u7248\u793e","978-7-5502-2550-3" },{ "\u609f\u7a7a\u4f20","\u4eca\u4f55\u5728","32.00","\u5317\u4eac\u8054\u5408\u51fa\u7248\u793e","978-7-5502-7767-0" },{ "\u82f1\u96c4\u4f20","\u5bab\u90e8\u7f8e\u96ea","29.90","\u9752\u5c9b\u51fa\u7248\u793e","978-7-5436-6784-6" },{ "\u767d\u591c\u884c","\u4e1c\u91ce\u572d\u543e","39.50","\u5357\u6d77\u51fa\u7248\u793e","978-7-5442-5860-9" } };void inquiremenu() { system("cls"); int y = 0; printf("************\n"); printf("1.\u4e66\u53f7\u67e5\u8be2\n"); printf("2.\u4e66\u540d\u67e5\u8be2\n"); printf("3.\u4f5c\u8005\u67e5\u8be2\n"); printf("4.\u51fa\u7248\u793e\u67e5\u8be2\n"); printf("\u8bf7\u9009\u62e9(1~4): \u56de\u8f66\u786e\u5b9a\n"); scanf("%d", &y); int i; switch (y) { case 1: { char x[20]; system("cls"); printf("\u8bf7\u8f93\u5165\u67e5\u627e\u4e66\u53f7\n"); scanf("%s", &x); bool fg = 0; for (i = 0; i 4); switch (accept) { case 0: case 1:inquiremenu(); break; case 2:addbook(); break; case 3:information(); break; case 4:printf("\u9000\u51fa\n"); break; default:system("cls"); } return 0;}

\u672c\u4eba\u90ae\u7bb1\u957f\u671f\u5728\u7ebf\uff0c\u6709\u4ec0\u4e48\u4e0d\u61c2\u5f97\u53ef\u76f4\u63a5\u8be2\u95ee\u3002\u90ae\u7bb1\[email protected]
\u8fd9\u662f\u6211\u4ee5\u524d\u505a\u7684\u8bfe\u7a0b\u8bbe\u8ba1\uff0c\u6ca1\u6709\u4fee\u6539\u529f\u80fd\u3002\u4fee\u6539\u5f88\u597d\u505a\uff0c\u6211\u8fd9\u8fd8\u6709\u4e00\u4efd\u5b66\u751f\u7ba1\u7406\u4fe1\u606f\u7684\u6e90\u4ee3\u7801\uff0c\u80fd\u5b9e\u73b0\u4e0a\u8ff0\u5168\u90e8\u529f\u80fd\u3002\u7531\u4e8e\u6211\u73b0\u5728\u6b63\u5728\u5e2e\u5ba2\u6237\u505a\u4e2a\u7cfb\u7edf\uff0c\u6ca1\u65f6\u95f4\u6765\u5b8c\u5584\u8fd9\u4e2a\u7a0b\u5e8f\uff0c\u5e0c\u671b\u4f60\u81ea\u5df1\u80fd\u591f\u5b8c\u5584\u4e00\u4e0b\u3002
/*\u8bbe\u8ba1\u5b9e\u73b0\u4e00\u4e2a\u7b80\u5355\u7684\u56fe\u4e66\u7ba1\u7406\u7cfb\u7edf\uff0c\u5bf9\u56fe\u4e66\u9986\u7684\u4e1a\u52a1\u8fdb\u884c\u7ba1\u7406*/

////////////////////////////////////////////////
//\u5185\u5bb9\uff1a\u8bbe\u8ba1\u5b9e\u73b0\u4e00\u4e2a\u7b80\u5355\u7684\u56fe\u4e66\u7ba1\u7406\u7cfb\u7edf\uff0c\u5bf9\u56fe\u4e66\u9986\u7684\u4e1a\u52a1\u8fdb\u884c\u7ba1\u7406
//\u8981\u6c42\uff1a\u7528C\u8bed\u8a00\u53ca\u987a\u5e8f\u7ed3\u6784\u6765\u5b9e\u73b0\uff0c\u7cfb\u7edf\u5177\u6709\u5982\u4e0b\u529f\u80fd
//1\uff0e \u56fe\u4e66\u5165\u5e93\uff1a\u56fe\u4e66\u6570\u636e\u5305\u62ec\u56fe\u4e66\u4e66\u53f7\uff0c\u4e66\u540d\uff0c\u4f5c\u8005\uff0c\u6570\u91cf\uff0c\u5355\u4ef7\u7b49\uff0c\u4e00\u672c\u4e66\u4f5c\u4e3a\u4e00\u4e2a\u7ed3\u70b9\uff0c
//\u4ee5\u4e66\u53f7\u4e3a\u5173\u952e\u5b57\uff0c\u6309\u8f93\u5165\u7684\u987a\u5e8f\u5efa\u7acb\u987a\u5e8f\u8868
//2\uff0e\u6392\u5e8f\uff1a\u4ee5\u4e66\u53f7\u6309\u5347\u5e8f\u8fdb\u884c\u6392\u5e8f\uff08\u53ef\u4ee5\u4efb\u9009\u4e00\u79cd\u6392\u5e8f\u65b9\u6cd5\uff09
//3\uff0e\u67e5\u627e\uff1a\u80fd\u6309\u4e66\u540d\u3001\u4e66\u53f7\u8fdb\u884c\u67e5\u627e\uff08\u5206\u522b\u7528\u987a\u5e8f\u67e5\u627e\u548c\u6298\u534a\u67e5\u627e\u65b9\u6cd5\uff09
//4\uff0e\u5220\u9664\uff1a\u4ece\u8868\u4e2d\u5220\u9664\u6307\u5b9a\u7684\u56fe\u4e66
#include
#include
#include
#include
#define LIST_INIT_SIZE 50
#define LISTINCREMENT 10
typedef struct Book
{
int BookNum;/*\u56fe\u4e66\u4e66\u53f7*/
char BookName[50];/*\u56fe\u4e66\u4e66\u540d*/
char BookWrite[50];/*\u56fe\u4e66\u4f5c\u8005*/
float BookPrice; /*\u56fe\u4e66\u4ef7\u683c*/
int numbers ; /*\u56fe\u4e66\u6570\u91cf*/
}Book;
typedef struct Library_Data
{
Book *book;
int length;
int listsize;
int Num;
}Library_Data,*Lib_Data;
//\u663e\u793a\u6307\u5b9a\u7684\u4e00\u6761\u8bb0\u5f55
void print(Book p)
{
printf("\n********************************************************************\n");
printf("\u56fe\u4e66\u4e66\u53f7 \u56fe\u4e66\u4e66\u540d \u56fe\u4e66\u4f5c\u8005 \u56fe\u4e66\u6570\u91cf \u56fe\u4e66\u5355\u4ef7(\u5143)\n");
printf("--------------------------------------------------------------------\n");
printf("%-14d%-14s%-14s%-14d%-14f\n",p.BookNum,p.BookName,p.BookWrite,p.numbers,p.BookPrice);
printf("********************************************************************\n");
}
//\u67e5\u627e\u51fd\u6570
int find(Library_Data p,int Num,char s[20])
{
int i,low,mid,high;
if(Num==-1)
for(i=0;i<p.length;i++) /*\u987a\u5e8f\u67e5\u627e*/
{
if(strcmp(s,p.book[i].BookName)==0)
return i;
}
else if(strcmp(s,"")==0)
{
low=0;high=p.length;
while(low<=high) /*\u6298\u534a\u67e5\u627e*/
{
mid=(low+high)/2;
if(Num==p.book[mid].BookNum) return mid;
else if(Num>p.book[mid].BookNum) low=mid+1;
else high=mid-1;
}
}
return -1;
}
//\u5347\u5e8f\u6392\u5e8f
Library_Data Sort_Book(Library_Data &p)
{
Book p0;
int i,j;
if(p.Num==0) return p;
for(i=0;i<p.length;i++)
{
for(j=i+1;j<p.length;j++)
{
if(p.book[i].BookNum>p.book[j].BookNum)
{
p0=p.book[i];
p.book[i]=p.book[j];
p.book[j]=p0;
}
}
}
return p;
}
//\u56fe\u4e66\u521d\u59cb\u5316
void Create_Data(Library_Data &p1)
{
int i=0;
Book *newbase;
system("cls");
printf("\u73b0\u5728\u5bf9\u56fe\u4e66\u8fdb\u884c\u521d\u59cb\u5316\n");
puts("***********************************");
p1.Num=0;p1.length=0;
p1.listsize=LIST_INIT_SIZE;
p1.book=(Book *)malloc(LIST_INIT_SIZE*sizeof(Book));
do
{

if(p1.length>p1.listsize)
{

newbase=(Book *)realloc(p1.book,(p1.listsize+LISTINCREMENT)*sizeof(Book));
if(!newbase) exit(0);
p1.book=newbase;
p1.listsize+=LISTINCREMENT;
}
printf("\u8bf7\u8f93\u5165\u56fe\u4e66\u4e66\u53f7\uff1a");
scanf("%d",&p1.book[i].BookNum);
printf("\u8bf7\u8f93\u5165\u56fe\u4e66\u4e66\u540d\uff1a");
scanf("%s",&p1.book[i].BookName);
printf("\u8f93\u5165\u56fe\u4e66\u4f5c\u8005: ");
scanf("%s",&p1.book[i].BookWrite);
printf("\u8bf7\u8f93\u5165\u56fe\u4e66\u6570\u91cf\uff1a");
scanf("%d",&p1.book[i].numbers);
printf("\u8bf7\u8f93\u5165\u56fe\u4e66\u4ef7\u683c\uff1a");
scanf("%f",&p1.book[i].BookPrice);
p1.Num+=p1.book[i].numbers;i++;p1.length++;

printf("***********************************\n");
printf(" \u6309 n \u9000\u51fa\uff0c\u6309\u522b\u7684\u7ee7\u7eed\u3002\n"); /*\u63d0\u793a\u5982\u4f55\u7ee7\u7eed\u3001\u9000\u51fa*/
printf("***********************************\n");
}while(getch()!='n');
Sort_Book(p1);
}
//\u67e5\u627e\u56fe\u4e66
int Find_Book(Library_Data p,int n)
{
char name[20]="";
int k,Num=-1;
if(p.Num==0)
{
system("cls");
printf("\u73b0\u65e0\u56fe\u4e66\u8bb0\u5f55! ");
return 0;
}
else if(n==1)
{
system("cls"); /*\u6e05\u5c4f*/
printf("\u73b0\u5728\u662f\u5bf9\u56fe\u4e66\u4fe1\u606f\u8fdb\u884c\u67e5\u627e");
printf("\n*********************************************\n");
printf("\u8bf7\u8f93\u5165\u4f60\u8981\u67e5\u627e\u7684\u56fe\u4e66\u4e66\u540d:");
scanf("%s",name);
k=find(p,Num,name); /*\u8c03\u7528find()\u67e5\u627e\u51fd\u6570*/
if(k!=-1) /*\u6761\u4ef6\u6ee1\u8db3\u6267\u884c\u4e0b\u9762\u51fd\u6570*/
print(p.book[k]);
else
printf("\n \u6ca1\u6709\u627e\u5230\u4f60\u8981\u627e\u7684\u56fe\u4e66\u4fe1\u606f.\u6309\u4efb\u610f\u952e\u7ee7\u7eed\u3002");
}
else if(n==2)
{
system("cls"); /*\u6e05\u5c4f*/
printf("\u73b0\u5728\u662f\u5bf9\u56fe\u4e66\u4fe1\u606f\u8fdb\u884c\u67e5\u627e");
printf("\n*********************************************\n");
printf("\u8bf7\u8f93\u5165\u4f60\u8981\u67e5\u627e\u7684\u56fe\u4e66\u4e66\u53f7:");
scanf("%d",&Num);
k=find(p,Num,name); /*\u8c03\u7528find()\u67e5\u627e\u51fd\u6570*/
if(k!=-1) /*\u6761\u4ef6\u6ee1\u8db3\u6267\u884c\u4e0b\u9762\u51fd\u6570*/
print(p.book[k]);
else
printf("\n \u6ca1\u6709\u627e\u5230\u4f60\u8981\u627e\u7684\u56fe\u4e66\u4fe1\u606f.\u6309\u4efb\u610f\u952e\u7ee7\u7eed\u3002");
}
else
printf("\u4f60\u7684\u9009\u62e9\u6709\u8bef\uff01");
return 1;
}
//\u63d2\u5165\u56fe\u4e66
void add(Library_Data &p0)
{
int i,k,low,mid,high;
Book p1,*p2,*p3,*newbase;
system("cls");
if(p0.Num==0)
printf("\u56fe\u4e66\u4fe1\u606f\u8868\u8fd8\u6ca1\u6709\u521d\u59cb\u5316,\u9700\u8981\u5bf9\u56fe\u4e66\u4fe1\u606f\u8868\u8fdb\u884c\u521d\u59cb\u5316\u540e\u624d\u80fd\u8fdb\u884c\u63d2\u5165\u3002\n");
else
{
if(p0.length>=p0.listsize-1)
{
newbase=(Book *)realloc(p0.book,(p0.listsize+LISTINCREMENT)*sizeof(Book));
if(!newbase) exit(0);
p0.book=newbase;
p0.listsize+=LISTINCREMENT;
}
printf("\u8bf7\u8f93\u5165\u5f85\u63d2\u5165\u56fe\u4e66\u4fe1\u606f:\n");
printf("*********************************************\n");
printf("\u8bf7\u8f93\u5165\u56fe\u4e66\u4e66\u53f7\uff1a");
scanf("%d",&p1.BookNum);
printf("*********************************************\n");
printf("\u8bf7\u8f93\u5165\u56fe\u4e66\u4e66\u540d\uff1a");
scanf("%s",&p1.BookName);
printf("*********************************************\n");
printf("\u8bf7\u8f93\u5165\u56fe\u4e66\u4f5c\u8005\uff1a");
scanf("%s",&p1.BookWrite);
printf("*********************************************\n");
printf("\u8bf7\u8f93\u5165\u56fe\u4e66\u6570\u91cf\uff1a");
scanf("%d",&p1.numbers);
printf("*********************************************\n");
printf("\u8bf7\u8f93\u5165\u56fe\u4e66\u4ef7\u683c\uff1a");
scanf("%f",&p1.BookPrice);
printf("*********************************************\n");
low=0;high=p0.length;
if(p1.BookNum<p0.book[0].BookNum)
{
for(p2=&p0.book[p0.length];p2>=&p0.book[0];p2--)
*(p2+1)=*p2;
p0.book[0]=p1;
p0.Num+=p1.numbers;p0.length++;
}
else if(p1.BookNum>p0.book[p0.length-1].BookNum)
{
p0.book[p0.length]=p1;
p0.Num+=p1.numbers;p0.length++;
}
else
{
for(i=0;i<p0.length;i++)
if(p1.BookNum>=p0.book[i].BookNum && p1.BookNum<p0.book[i+1].BookNum) break;
for(p2=&p0.book[p0.length];p2>&p0.book[i];p2--)
*(p2+1)=*p2;
p0.book[i+1]=p1;
p0.Num+=p1.numbers;p0.length++;
}

}
}
//\u5220\u9664\u56fe\u4e66
void Delete_Book(Library_Data &LD,int n)
{
system("cls");
char name[20]="";
char a;
int i=0,k=0,Num=-1;
Book *p1,*p2;
if(LD.Num==0)
printf("\u73b0\u65e0\u56fe\u4e66\u8bb0\u5f55! ");
else
{
printf("\u8fdb\u884c\u56fe\u4e66\u4fe1\u606f\u5220\u9664");
printf("\n*********************************************\n");
if(n==1)
{
printf("\u8bf7\u8f93\u5165\u5f85\u5220\u9664\u56fe\u4e66\u4e66\u540d:"); /*\u63d0\u793a\u8f93\u5165\u8981\u5220\u9664\u7684\u56fe\u4e66\u4e66\u540d*/
scanf("%s",name);
printf("\u662f\u5426\u5220\u9664\u6240\u6709\u540c\u540d\u7684\u56fe\u4e66\uff1f\u201cy\u201d\u662f\uff0c\u5176\u4ed6\u952e\u53ea\u5220\u9664\u7b2c\u4e00\u4e2a\uff1a");
if(getch()=='y') /*\u5220\u9664\u6240\u6709\u540c\u540d\u56fe\u4e66\u4fe1\u606f*/
{
for(i=0;i<LD.length;i++)
{
if(strcmp(name,LD.book[i].BookName)==0)
{
p2=&LD.book[LD.length-1];
LD.Num-=LD.book[i].numbers;
for(p1=&LD.book[i];p1<=p2;p1++)
*p1=*(p1+1);
LD.length--;k=1;i=-1;
}
}
if(k==0) printf("\n\u6ca1\u6709\u4f60\u8981\u5220\u9664\u7684\u8bb0\u5f55\n");
else printf("\n\u6240\u6709\u56fe\u4e66\u540d\u4e3a%s\u7684\u4fe1\u606f\u5df2\u88ab\u5220\u9664!\n",name); /*\u663e\u793a\u5df1\u88ab\u5220\u9664\u7684\u4fe1\u606f*/
}
else
{

i=find(LD,Num,name);
if(i==-1) printf("\n\u6ca1\u6709\u4f60\u8981\u5220\u9664\u7684\u8bb0\u5f55\n");
else /*\u5220\u9664\u7b2c\u4e00\u672c\u76f8\u540c\u7684\u56fe\u4e66\u4fe1\u606f*/
{
p2=&LD.book[LD.length-1];
LD.Num-=LD.book[i].numbers;
for(p1=&LD.book[i];p1<=p2;p1++)
*p1=*(p1+1);
printf("\n\u56fe\u4e66\u53f7\u4e3a%s\u7684\u4fe1\u606f\u5df2\u88ab\u5220\u9664!\n",name); /*\u663e\u793a\u5df1\u88ab\u5220\u9664\u7684\u4fe1\u606f*/
LD.length--;

}
}
}
else if(n==2)
{
printf("\u8bf7\u8f93\u5165\u5f85\u5220\u9664\u56fe\u4e66\u4e66\u53f7:"); /*\u63d0\u793a\u8f93\u5165\u8981\u5220\u9664\u7684\u56fe\u4e66\u4e66\u53f7*/
scanf("%d",&Num);
i=find(LD,Num,name);
if(i==-1) printf("\u6ca1\u6709\u4f60\u8981\u5220\u9664\u7684\u8bb0\u5f55\n");
else
{
p2=&LD.book[LD.length-1];
LD.Num-=LD.book[i].numbers;
for(p1=&LD.book[i];p1<=p2;p1++)
*p1=*(p1+1);
printf("\u56fe\u4e66\u53f7\u4e3a%d\u7684\u4fe1\u606f\u5df2\u88ab\u5220\u9664!\n",Num); /*\u663e\u793a\u5df1\u88ab\u5220\u9664\u7684\u4fe1\u606f*/
LD.length--;
}
}
else
printf("\u4f60\u7684\u9009\u62e9\u6709\u8bef\uff01");
}
}
//\u663e\u793a\u6240\u6709\u56fe\u4e66\u4fe1\u606f
void ShowBookTable(Library_Data p,int n)
{
int i;
system("cls");
if(n==0)
printf("\u73b0\u65e0\u56fe\u4e66\u8bb0\u5f55! ");
else
{
printf("\u73b0\u5728\u6709%d\u672c\u56fe\u4e66\u7684\u4fe1\u606f\u3002",n);
printf("\n**********************************************************************\n");
printf("\u56fe\u4e66\u4e66\u53f7 \u56fe\u4e66\u4e66\u540d \u56fe\u4e66\u4f5c\u8005 \u56fe\u4e66\u6570\u91cf \u56fe\u4e66\u5355\u4ef7\uff08\u5143\uff09\n");
for(i=0;i<p.length;i++)
{
printf("----------------------------------------------------------------------\n");
printf("%-14d%-14s%-14s%-14d%-14f\n",p.book[i].BookNum,p.book[i].BookName,p.book[i].BookWrite,p.book[i].numbers,p.book[i].BookPrice);
}
printf("**********************************************************************\n");
}
}
//\u83dc\u5355\u51fd\u6570
int menu_select() /*\u5b9a\u4e49\u83dc\u5355\u51fd\u6570*/
{
int c;
printf("\u6309\u4efb\u610f\u952e\u8fdb\u5165\u9009\u62e9\u83dc\u5355\u2026\u2026\n"); /*\u63d0\u793a\u538b\u4efb\u610f\u952e\u7ee7\u7eed*/
getch(); /*\u8bfb\u5165\u4efb\u610f\u5b57\u7b26*/
system("cls"); /*\u6e05\u5c4f*/
printf("********************\u83dc\u5355\u9009\u9879\u5982\u4e0b****************\n\n"); /*\u4ee5\u4e0b\u4e3a\u4e3b\u83dc\u5355*/
printf(" 1. \u521d\u59cb\u5316\u56fe\u4e66\u4fe1\u606f\u8868\n");
printf(" 2. \u663e\u793a\u5168\u90e8\u56fe\u4e66\u8bb0\u5f55\n");
printf(" 3. \u67e5\u627e\u56fe\u4e66\u8bb0\u5f55\n");
printf(" 4. \u5220\u9664\u56fe\u4e66\u8bb0\u5f55\n");
printf(" 5. \u63d2\u5165\u65b0\u8bb0\u5f55\n");
printf(" 6. \u9000\u51fa\u7cfb\u7edf\n");
printf("***********************************************\n");
do{
printf("\n \u8f93\u5165\u60a8\u7684\u9009\u62e9(1~6):"); /*\u63d0\u793a\u8f93\u5165\u9009\u9879*/
scanf("%d",&c); /*\u8f93\u5165\u9009\u62e9\u9879*/
if(!(c>=1&&c<=6))
{printf(" \u4f60\u7684\u8f93\u5165\u6709\u8bef\uff0c\u8bf7\u91cd\u65b0\u8f93\u5165\u2026\u2026");}
}while(c6); /*\u9009\u62e9\u9879\u4e0d\u57280~6\u4e4b\u95f4\u91cd\u8f93*/
return c; /*\u8fd4\u56de\u9009\u62e9\u9879\uff0c\u4e3b\u7a0b\u5e8f\u6839\u636e\u8be5\u6570\u8c03\u7528\u76f8\u5e94\u7684\u51fd\u6570*/
}

void main()
{
Library_Data LD;
LD.Num=0;
int n,m;
for(;;) /*\u65e0\u9650\u5faa\u73af*/
{
switch(menu_select())
{
case 1:Create_Data(LD);break; /*\u521d\u59cb\u56fe\u4e66\u751f\u4fe1\u606f*/
case 2:ShowBookTable(LD,LD.Num);break; /*\u663e\u793a\u5168\u90e8\u56fe\u4e66\u4fe1\u606f*/
case 3:
printf("\u8bf7\u4f60\u9009\u62e9\u67e5\u627e\u65b9\u5f0f\uff08\u201c1\u201d\u4e3a\u6309\u4e66\u540d\u67e5\u627e\uff0c\u201c2\u201d\u4e3a\u6309\u4e66\u53f7\u67e5\u627e\uff09\uff1a");
scanf("%d",&n);
Find_Book(LD,n);break; /*\u67e5\u627e\u56fe\u4e66\u4fe1\u606f*/
case 4:
printf("\u8bf7\u4f60\u9009\u62e9\u5220\u9664\u65b9\u5f0f\uff08\u201c1\u201d\u4e3a\u6309\u4e66\u540d\u5220\u9664\uff0c\u201c2\u201d\u4e3a\u6309\u4e66\u53f7\u5220\u9664\uff09\uff1a");
scanf("%d",&m);
Delete_Book(LD,m);break; /*\u5220\u9664\u56fe\u4e66\u4fe1\u606f*/
case 5:add(LD);break; /*\u63d2\u5165\u56fe\u4e66\u4fe1\u606f*/
case 6:exit(0); /*\u7ed3\u675f\u7a0b\u5e8f*/
}
}
}

这个由于你给的分太少，估计每人会给你做的。
我给你一个做参照吧，基本功能都已经实现了，并且在VC6上已经编译运行确认：

#include <iostream>
#include <iomanip>
#include <string>
#include <fstream>//输入/输出文件流类
using namespace std;
const int Maxr=100;//最多的读者
const int Maxb=100;//最多的图书
const int Maxbor=5;//每位读者最多借五本书
//读者类,实现对读者的信息的描述

class Reader
{
private:
int tag; //删除标记 1:已删 0:未删
int no; //读者编号
char name[10]; //读者姓名
int borbook[Maxbor];//所借图书
public:
Reader() {}
char *getname() {return name;} //获取姓名
int gettag() {return tag;} //获取删除标记
int getno() {return no;} //获取读者编号
void setname(char na[]) //设置姓名
{
strcpy(name,na);

}
void delbook(){ tag=1; }//设置删除标记 1:已删 0:未删
void addreader(int n,char *na)//增加读者
{
tag=0;
no=n;
strcpy(name,na);
for(int i=0;i<Maxbor;i++)
borbook[i]=0;
}
void borrowbook(int bookid)//借书操作
{
for(int i=0;i<Maxbor;i++)
{
if (borbook[i]==0)
{
borbook[i]=bookid;
return;

}
}

}
int retbook(int bookid)//还书操作
{
for(int i=0;i<Maxbor;i++)
{
if(borbook[i]==bookid)
{
borbook[i]=0;
return 1;

}
}
return 0;
}
void disp()//读出读者信息
{
cout << setw(5) << no <<setw(10) << name<<"借书编号：[";
for(int i=0;i<Maxbor;i++)
if(borbook[i]!=0)
cout << borbook[i] << "|";
cout << "]"<<endl;

}
};

//读者类库，实现建立读者的个人资料
class RDatabase
{
private:
int top; //读者记录指针
Reader read[Maxr];//读者记录
public:
RDatabase() //构造函数，将reader.txt读到read[]中
{
Reader s;
top=-1;
fstream file("reader.txt",ios::in);//打开一个输入文件
while (1)
{
file.read((char *)&s,sizeof(s));
if (!file)break;
top++;
read[top]=s;
}
file.close(); //关闭 reader.txt
}
void clear()//删除所有读者信息
{
top=-1;
}
int addreader(int n,char *na)//添加读者时先查找是否存在
{
Reader *p=query(n);
if (p==NULL)
{
top++;
read[top].addreader(n,na);
return 1;
}
return 0;

}
Reader *query(int readerid)//按编号查找
{
for (int i=0;i<=top;i++)
if (read[i].getno()==readerid &&
read[i].gettag()==0)
{
return &read[i];
}
return NULL;
}
void disp() //输出所有读者信息
{
for (int i=0;i<=top;i++)
read[i].disp();
}
void readerdata();//读者库维护
~RDatabase() //析构函数，将read[]写到reader.txt文件中
{
fstream file("reader.txt",ios::out);
for (int i=0;i<=top;i++)
if (read[i].gettag()==0)
file.write((char *)&read[i],sizeof(read[i]));
file.close();

}
};
void RDatabase::readerdata()
{

char choice;
char rname[20];
int readerid;
Reader *r;
while (choice!='0')
{
cout <<"\n\n\t\t\t读 者 维 护\n\n\n\t\t 1 新 增\n\n\t\t 2 更 改\n\n\t\t 3 删 除\n\n\t\t 4 查 找\n\n\t\t 5 显 示\n\n\t\t 6 全 删\n\n\t\t 0 退 出"<<endl;
cin >> choice;
switch (choice)
{
case '1':
cout << "输入读者编号:";
cin >> readerid;
cout << "输入读者姓名:";
cin >> rname;
addreader (readerid,rname);
break;
case '2':
cout << "输入读者编号:";
cin >> readerid;
r=query(readerid);
if (r==NULL)
{
cout << " 该读者不存在 "<<endl;
break;
}
cout << "输入新的姓名:";
cin >> rname;
r->setname(rname);
break;
case '3':
cout << " 输入读者编号:";
cin >> readerid;
r=query(readerid);
if (r==NULL)
{
cout <<" 该读者不存在" << endl;
break;
}
r->delbook();
break;
case '4':
cout << "读入读者编号:";
cin >> readerid;
r=query(readerid);
if (r==NULL)
{
cout <<"该读者不存在"<< endl;
break;
}
r->disp();
break;
case '5':
disp();
break;
case '6':
clear();
break;
default:cout<<"输入错误，请从新输入：";break;
}
}
}

//图书类，实现对图书的描述，图书的编号，书名，借出，还入等
class Book
{
private:
int tag;//删除标记 1:已删 0:未删
int no;//图书编号
char name[20];//书名
int onshelf;//是否再架 1:再架 2:已借
public:
Book(){}
char *getname() { return name; }//获取姓名
int getno(){ return no; }//获取图书编号
int gettag(){ return tag; }//获取删除标记
void setname(char na[])//设置书名
{
strcpy(name,na);
}
void delbook(){ tag=1;}//删除图书
void addbook(int n,char *na)//增加图书
{
tag=0;
no=n;
strcpy(name,na);
onshelf=1;
}
int borrowbook()//借书操作
{
if (onshelf==1)
{
onshelf=0;
return 1;
}
return 0;
}
void retbook()//还书操作
{
onshelf=1;
}
void disp()//输出图书
{
cout << setw(6) << no << setw(18) << name << setw(10)
<<(onshelf==1? "在架":"已借") <<endl;
}
};

//图书库类，实现对图书的维护，查找，删除等
class BDatabase
{
private:
int top; //图书记录指针
Book book[Maxb]; //图书记录
public:
BDatabase()//构造函数，将book.txt读到book[]中
{
Book b;
top=-1;
fstream file("book.txt",ios::in);
while (1)
{
file.read((char *)&b,sizeof(b));
if (!file) break;
top++;
book[top]=b;
}
file.close();
}
void clear()//全删
{
top=-1;
}
int addbook(int n,char *na)//增加图书
{
Book *p=query(n);
if (NULL==p)
{
top++;
book[top].addbook(n,na);
return 1;
}
return 0;
}
Book *query(int bookid)//查找图书
{
for (int i=0;i<=top;i++)
if (book[i].getno()==bookid &&book[i].gettag()==0)
{
return &book[i];
}
return NULL;
}
void bookdata();//图书库维护
void disp()
{
for (int i=0;i<=top;i++)
if (book[i].gettag()==0)
book[i].disp();
}
~BDatabase()//析构函数，将book[]写到book.txt文件中
{
fstream file("book.txt",ios::out);
for (int i=0;i<=top;i++)
if (book[i].gettag()==0)
file.write((char *)&book[i],sizeof(book[i]));
file.close();
}
};
void BDatabase::bookdata()
{
char choice;
char bname[40];
int bookid;
Book *b;
while (choice!='0')
{
cout <<"\n\n\n\t\t\t图 书 维 护 "<<endl<<endl;
cout<<"\t\t1 新 增\n \t\t2 更 改\n\t\t3 删 除\n\t\t4 查 找\n\t\t5 显 示\n\t\t6 全 删\n\t\t0 退 出"<<endl;
cin >> choice;
switch (choice)
{
case '1':
cout << "输入图书编号:"<<endl;
cin >> bookid;
cout << "输入图书书名:"<<endl;
cin >> bname;
addbook(bookid,bname);
break;
case '2':
cout << "输入图书编号:"<<endl;
cin >> bookid;
b=query(bookid);
if (b==NULL)
{
cout << " 该图书不存在 "<<endl;
break;
}
cout << "输入新的书名:"<<endl;
cin >> bname;
b->setname(bname);
break;
case '3':
cout <<" 读入图书编号:"<<endl;
cin >> bookid;
b=query(bookid);
if (b==NULL)
{
cout <<" 该图书不存在" << endl;
break;
}
b->delbook();
break;
case '4':
cout << " 读入图书编号:"<<endl;
cin >> bookid;
b=query(bookid);
if (b==NULL)
{
cout <<" 该图书不存在"<< endl;
break;
}
b->disp();
break;
case '5':
disp();
break;
case '6':
clear();
break;
default:cout<<"输入错误，请从新输入:";
}
}
}

//main() 函数的实现，程序的主界面的引导

void main()
{
char choice;
int bookid,readerid;
RDatabase ReaderDB;
Reader *r;
BDatabase BookDB;
Book *b;
while(choice!='0')
{
cout <<endl<<endl<<"\t\t\t 图 书 管 理 系 统\n\n\n";

cout <<"\t\t\t1 借 书\n\n\t\t\t2 还 书 \n\n\t\t\t3 图 书 维 护\n\n\t\t\t4 读 者 维 护\n\n\t\t\t0 离 开"<<endl;
cin >> choice;
switch (choice)
{
case '1':
cout <<" 借书 读者编号:";
cin >>readerid;
cout <<" 图书编号： ";
cin >>bookid;
r=ReaderDB.query(readerid);//按编号查找
if (NULL==r)
{
cout <<" 不存在该读者，不能借书"<< endl;
break;
}
b=BookDB.query(bookid);
if (b==NULL)
{
cout <<" 不存在该图书，不能借书"<< endl;
break;
}
if (b->borrowbook()==0)
{
cout << " 该图书已借出，不能借书"<< endl;
break;
}
r->borrowbook(b->getno());
break;
case '2':
cout<<"还书\n 读者编号:";
cin >>readerid;
cout << " 图书编号:";
cin >>bookid;
r=ReaderDB.query(readerid);
if (r==NULL)
{
cout <<" 不存在该读者，不能还书" << endl;
break;
}
b=BookDB.query(bookid);
if (b==NULL)
{
cout <<" 不存在该图书，不能还书" <<endl;
break;
}
b->retbook();
r->retbook(b->getno());
break;
case '3':
BookDB.bookdata();
break;
case '4':
ReaderDB.readerdata();
break;
default:cout<<"输入错误，请从新输入：";

}
}
}

你这题目100RMB都不一定有人写，何况5积分

用结构体试一下，10分钟我也编不出一个给你

C璇█ 鍥句功绠￠鐞嗙郴缁
绛旓細璇勮 鏀惰捣 2鏉℃姌鍙犲洖绛 鎺ㄨ崘寰嬪笀鏈嶅姟: 鑻ユ湭瑙ｅ喅鎮ㄧ殑闂,璇锋偍璇︾粏鎻忚堪鎮ㄧ殑闂,閫氳繃鐧惧害寰嬩复杩涜鍏嶈垂涓撲笟鍜ㄨ 鍏朵粬绫讳技闂 2014-12-10 C璇█鍥句功绠＄悊绯荤粺绋嬪簭 66 2015-09-20 c璇█绋嬪簭璁捐鍥句功棣绠＄悊绯荤粺 3 2014-06-10 姹傚浘涔﹂绠＄悊绯荤粺绋嬪簭(c璇█) 4 2014-07-19 鐢–璇█缂栧啓涓涓浘涔绠＄悊绯荤粺 ...

c璇█璇剧▼璁捐 鍥句功绠＄悊绯荤粺
绛旓細楂樼骇璇█绋嬪簭璁捐锛2锛夎绋嬭璁    涓 绋嬪簭璁捐璇存槑涔 銆愯璁￠鐩 鍥句功棣鍊熼槄绠＄悊 銆愰棶棰樻弿杩般戝浘涔﹂锛岄傚悎鐢–++闈㈠悜瀵硅薄鐨勫姛鑳芥潵鎻忚堪銆傚浘涔﹂绠＄悊绯荤粺鍒嗕负鍊熶功銆佽繕涔︺佸浘涔︾鐞嗗拰璇昏呮湇鍔＄瓑鍥涗釜閮ㄥ垎銆傝璁涓涓璇昏呯被Reader,璁板綍姣忎釜璇昏呭熀鏈俊鎭紱璇昏呭簱绫籖database,璁板綍鎵鏈夎鑰...

姹傜紪绋嬮珮鎵嬪府蹇欑紪鍒C璇█棰樺叧浜鍥句功棣绯荤粺鐨,璋㈣阿浜,鎬ュ晩!浠婃櫄涓婅鍟...
绛旓細include <string> include <fstream>//杈撳叆/杈撳嚭鏂囦欢娴佺被 using namespace std;const int Maxr=100;//鏈澶氱殑璇昏 const int Maxb=100;//鏈澶氱殑鍥句功 const int Maxbor=5;//姣忎綅璇昏呮渶澶氬熶簲鏈功 //璇昏呯被,瀹炵幇瀵硅鑰呯殑淇℃伅鐨勬弿杩 class Reader { private:int tag; //鍒犻櫎鏍囪 1:宸插垹 0:...

鎬ユ眰C璇█鍥句功绠＄悊绯荤粺浠ｇ爜
绛旓細include#includeclassBook{//涔︾睄鍩虹被protected:charTitle[40];//涔﹀悕longCode;//鏉＄爜intType;//0琛ㄧず涔︼紝1琛ㄧず鏉傚織public:Book();Book(char*title,longcode);voidSetCode(longcode){Code=code;}voidSetTitle(char*tl){strcpy(Title,tl);}voidSetType(booltype){Type=type;}intGetType(){return...

鐢–璇█鍐欏浘涔绠＄悊绯荤粺璁捐 姹傚悇浣嶅ぇ鍝ュぇ濮愬府甯繖鍟!璺眰!!!
绛旓細璇ョ郴缁熻兘瀹炵幇鍥句功棣绠＄悊鐨勪竴鑸姛鑳,鍖呮嫭璇讳功淇℃伅褰曞叆銆佷慨鏀广佸垹闄ゃ佹煡璇㈠姛鑳姐傝鏈夊浘涔﹀熼槄淇℃伅(鍊熷嚭銆佸綊杩)鐨勪慨鏀,绯荤粺鑳藉鎻愪緵鏃堕棿娈点佹椂闂寸殑鏌ヨ,骞舵彁渚涚粺璁″姛鑳借嚦灏戝寘鎷寜鏃堕棿娈电粺璁,灏嗘煡璇佺粺璁＄殑缁撴灉鎵撳嵃杈撳嚭銆傘愭彁绀恒(1)鐢ㄤ竴涓鏂囦欢瀛樻斁鍥句功淇℃伅銆(2)鍥句功淇℃伅鍖呮嫭鍥句功缂栧彿銆佷功鍚嶃佸嚭鐗堢ぞ銆佷綔鑰呫両SBN鍙枫佸崟浠...

鎬庢牱璁捐鍥句功棣淇℃伅绠＄悊绯荤粺
绛旓細鍥句功棣嗙殑绠＄悊绯荤粺銆 鏈洖绛旇鎻愰棶鑰呴噰绾 宸茶禐杩 宸茶俯杩< 浣犲杩欎釜鍥炵瓟鐨勮瘎浠锋槸? 璇勮 鏀惰捣 鍏朵粬绫讳技闂 2016-07-17 C璇█绋嬪簭璁捐 鍥句功棣嗕俊鎭鐞嗙郴缁熻璁 9 2010-10-21 鍥句功棣嗙鐞嗙郴缁熻璁?? 66 2014-06-11 鍥句功淇℃伅绠＄悊绯荤粺璁捐 5 2008-07-03 鏁版嵁缁撴瀯璇剧▼璁捐閲屾湁涓浘涔﹂淇℃伅绠＄悊绯荤粺鐨勬暟鎹簱...

鍊熷悓瀛︾櫨搴︾煡閬撻棶鐨,姹涓涓狢璇█璇剧▼璁捐,鍏充簬鍥句功棣鍊熼槄鐨勭▼搴忋
绛旓細鍊熷悓瀛︾櫨搴︾煡閬撻棶鐨,姹涓涓狢璇█璇剧▼璁捐,鍏充簬鍥句功棣鍊熼槄鐨勭▼搴忋 鍥句功鍊熼槄绠＄悊璁捐瑕佹眰鍩烘湰鍔熻兘:鍥句功绠＄悊璇昏呯鐞嗗熶功绠＄悊杩樹功绠＄悊鏌ヨ涓庣粺璁℃嫇灞曞姛鑳:鍥句功绠＄悊銆佽鑰呯鐞嗐佸熶功绠＄悊鍙婅繕涔︾鐞嗕腑鐨勫垹闄ゃ佷慨鏀瑰姛鑳姐傚垱鏂(鑷嫙)鍔熻兘:绋嬪簭瀹炵幇鐨勫叾瀹... 鍥句功鍊熼槄绠＄悊璁捐瑕佹眰 鍩烘湰鍔熻兘: 鍥句功绠＄悊 璇昏呯鐞 鍊熶功绠＄悊 杩樹功...

鎬庢牱鍋鍥句功棣璇昏呯殑鍩烘湰璧勮杈撳叆 淇敼,鍌ㄥ瓨,鏌ヨ
绛旓細鍥句功棣绠＄悊璧勮绯荤粺 1.寮曡█1.1 缂栧啓鐩殑缂栧啓鏈枃浠剁殑鐩殑鏄牴鎹祫鏂欏簱绯荤粺鍒嗘瀽鍒嗘瀽涓庤璁′汉鍛樺拰瀹㈡埛(鍥句功璇昏)娌熼氱殑缁撴灉,瀵逛娇鐢ㄨ呴渶姹傝繘琛屼簡鍏ㄩ潰缁嗚嚧鐨勫垎鏋,娣卞叆鎻忚堪銆婂浘涔︾鐞嗙郴缁熴嬬殑鍔熻兘鍜屾晥鑳戒笌浠嬮潰,纭畾璇ョ郴缁熻璁＄殑闄愬埗鍜屽畾涔夋椂鐨勫叾浠栨湁鏁堟ч渶姹傘傝璧勬枡搴撶患鍚堣璁′綔涓氳鏍艰鏄庝功鐨勮鑰呯墿浠舵槸45042LWM璧勬枡搴撶郴缁熻...

c璇█,鍥句功棣閲岀郴缁熷浣曞疄鐜板熼槄浜哄湪鍊熶功鍚,鍒犻櫎鍊熼槄浜虹殑鍗″彿銆俖鐧惧害鐭...
绛旓細include <iomanip> include <string> //杈撳叆/杈撳嚭鏂囦欢娴佺被 include <fstream> using namespace std;//鏈澶氱殑璇昏 const int Maxr=100;//鏈澶氱殑鍥句功 const int Maxb=100;//姣忎綅璇昏呮渶澶氬熶簲鏈功 const int Maxbor=5;//璇昏呯被,瀹炵幇瀵硅鑰呯殑淇℃伅鐨勬弿杩 class Reader { private://鍒犻櫎鏍囪 1:...

c璇█缂栧啓鍥句功棣绠＄悊绯荤粺杩欎釜绗6鏉℃庝箞鍋氬晩
绛旓細浣犳潯褰㈢爜鎵嚭鏉ョ殑鏄暟瀛椾覆锛岃繕鏄瓧绗﹀晩銆鍥句功淇℃伅鐨勪綘鏄斁鍦ㄧ粨鏋勯摼琛ㄩ噷锛岃繕鏄粨鏋勬暟缁勯噷鍟娿

扩展阅读：少儿编程学c++值得吗 ... 学习c++的视频 ... c++免费视频教程 ... 手机c++编程软件 ... c++语言入门自学 ... c++推荐书籍 ... 少儿编程一共有几级 ... c++入门程序代码 ... c++面试题 ...