图书馆管理系统 数据结构与算法 C语言 无错误(2)

2020-02-21 01:36

ifstream icin;

icin.open(\ icin>>nbooks;

char s1[10], s2[10], s3[10], s4[10], s5[10], s6[10], s7[10], s8[10];

icin>>s1>>s2>>s3>>s4>>s5>>s6>>s7>>s8; for (int i=1; i<=nbooks; ++i) {

icin>>books[i].id>>books[i].type>>books[i].name>>books[i].author>>books[i].press>>books[i].year>>books[i].quantity>>books[i].price;

} //读入图书数据函数 icin.close();

// //ifstream icin;

icin.open(\ icin>>nad;

char str1[100], str2[100]; for (int i=1; i<=nad; ++i) { icin>>str1>>str2;

amp[string(str1)] = string(str2); amp1[string(str1)] = 1;

//cout<

icin.close(); ifstream icin1;

icin.open(\ icin>>nreaders;

for (int i=1; i<=nreaders; ++i) {

icin>>str1>>str2>>readers[i].price>>readers[i].quantity; fuzhi(readers[i].id, str1);

rmp[string(str1)] = string(str2); rmp1[string(str1)] = 1;

for (int j=1; j<=readers[i].quantity; ++j) { icin>>readers[i].borrow[j]; } }

5

icin.close(); }

void writeln() { ofstream ocout;

ocout.open(\ ocout<

ocout<<\ for (int i=1; i<=nbooks; ++i) {

//printf(\%s %s %s %s %d %d %d\\n\books[i].id, books[i].type, book[i].name, books[i].author, books[i].press, books[i].year, books[i].price, books[i].quantity); ocout<

ocout.close(); //ofstream ocout;

ocout.open(\ ocout<

for (int i=1; i<=nreaders; ++i) { ocout<

} //写入图书数据函数 }

ocout.close(); //ofstream ocout;

ocout.open(\ ocout<

map::const_iterator it;

for (it = amp.begin(); it != amp.end(); ++it)

ocout << it->first << \ ocout.close(); }

6

bool cmp_books(BOOKS a, BOOKS b) {

return string(a.id) < string(b.id); }

bool cmp_readers(READERS a, READERS b) { return string(a.id) < string(b.id); }

int Find_Reader(char *name) {

for (int i=1; i<=nreaders; ++i) {

if (string(readers[i].id) == string(name)) return i; } //查找读者函数 return 0; }

void print_reader(int x) {

printf(\

printf(\ printf(\ You have borrowed books: %d\\n\readers[x].quantity);

printf(\ for (int i=1; i<=readers[x].quantity; ++i) { printf(\ }

} //输出读者信息函数 void print_reader_borrow(int x) { printf(\ You have borrowed books: %d\\n\readers[x].quantity);

printf(\ for (int i=1; i<=readers[x].quantity; ++i) { printf(\ }

} //输出读者借阅信息函数 void delete_reader(int x) {

for (int i=x; i

7

fuzhi(readers[i].id, readers[i+1].id);

readers[i].quantity = readers[i+1].quantity; readers[i].price = readers[i+1].price;

for (int j=1; j<=readers[i].quantity; ++j) {

fuzhi(readers[i].borrow[j], readers[i+1].borrow[j]); }

} //删除读者函数 nreaders--;

//sort(readers+1, readers+1+nreaders, cmp_readers); }

int Find_book(char *st) {

for (int i=1; i<=nbooks; ++i) {

if (string(books[i].id) == string(st)) return i; }

return 0;

} //查找图书函数 void Delete_book(int x) {

for (int i=x; i

fuzhi(books[i].id, books[i+1].id); fuzhi(books[i].type, books[i+1].type); fuzhi(books[i].name, books[i+1].name); fuzhi(books[i].author, books[i+1].author); fuzhi(books[i].press, books[i+1].press); books[i].year = books[i+1].year;

books[i].quantity = books[i+1].quantity; books[i].price = books[i+1].price;

} //删除图书函数 nbooks--;

//sort(books+1, books+1+nbooks, cmp_books); }

void print_Book(int x) {

printf(\ printf(\

printf(\

8

printf(\

printf(\ printf(\

printf(\ printf(\

printf(\ printf(\ printf(\ printf(\

printf(\ printf(\

printf(\ printf(\ printf(\} //输出图书信息函数

int main() { //主程序 readln();

printf(\to the library management system------------\\n\

printf(\

printf(\ printf(\ int q;

scanf(\ while (q == 1) {

printf(\ scanf(\ if (st[0] == 'Y') { printf(\ scanf(\ printf(\ scanf(\

while (amp1[string(Aid)] != 1) {

9


图书馆管理系统 数据结构与算法 C语言 无错误(2).doc 将本文的Word文档下载到电脑 下载失败或者文档不完整,请联系客服人员解决!

下一篇:如何利用微信公众平台赚钱

相关阅读
本类排行
× 注册会员免费下载(下载后可以自由复制和排版)

马上注册会员

注:下载文档有可能“只有目录或者内容不全”等情况,请下载之前注意辨别,如果您已付费且无法下载或内容有问题,请联系我们协助你处理。
微信: QQ: