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

2020-02-21 01:36

printf(\ printf(\ scanf(\ printf(\ scanf(\ }

while (amp[string(Aid)] != string(Apw)) {

printf(\password is not correct, please re-enter!!!\\n\

printf(\ scanf(\ }

while (1) {

printf(\

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

printf(\ printf(\ int qq;

scanf(\ while (qq == 1) {

printf(\ printf(\ printf(\ int qqq;

scanf(\

printf(\ scanf(\

int xxx = Find_Reader(TheReader); if (xxx == 0) {

printf(\ continue; }

if (qqq == 1) print_reader(xxx);

10

if (qqq == 2) delete_reader(xxx); printf(\ scanf(\ if (qqq == 1) break; }

while (qq == 2) {

printf(\ printf(\

scanf(\ printf(\

scanf(\ printf(\

scanf(\ printf(\

scanf(\ printf(\ scanf(\ printf(\

scanf(\ printf(\

scanf(\ printf(\ scanf(\

//sort(books+1, books+nbooks+1, cmp_books); printf(\ int qqq;

scanf(\ if (qqq == 1) break; }

while (qq == 3) {

printf(\ scanf(\

int xxx = Find_book(book_ID); Delete_book(xxx);

printf(\ int qqq;

11

scanf(\ if (qqq == 1) break; }

if (qq == 4) {

printf(\ scanf(\

int xxx = Find_book(book_ID); while (xxx == 0) {

printf(\ printf(\ scanf(\ xxx = Find_book(book_ID); }

//printf(\

printf(\ scanf(\

int yyy = Find_Reader(reader_ID); while (yyy == 0) {

printf(\ printf(\ scanf(\

yyy = Find_Reader(reader_ID); }

//printf(\ //print_reader(yyy);

readers[yyy].price += books[xxx].price; readers[yyy].quantity--; if (books[xxx].quantity == Delete_book(xxx);

else books[xxx].quantity--;

printf(\ int qqq;

scanf(\

if (qqq == 1) break; }

if (qq == 5) {

0)

12

printf(\ printf(\ printf(\ int qqq;

scanf(\

printf(\ scanf(\

int xxx = Find_book(book_ID); printf(\ scanf(\

int yyy = Find_Reader(reader_ID);

if (qqq == 1) {int Upbooks = 10; //上限借书量为10本

if (readers[yyy].quantity == Upbooks) { printf(\the borrowing limit, can't borrow the book.\\n\ }

else if (books[xxx].quantity == 0) {

printf(\can't borrow.\\n\

}

else {

books[xxx].quantity--; readers[yyy].quantity++;

fuzhi(readers[yyy].borrow[readers[yyy].quantity], book_ID); } }

if (qqq == 2) {

books[xxx].quantity++; readers[yyy].quantity--;

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

if (string(readers[yyy].borrow[i]) == string(book_ID)) {

for (int j=i;

13

j<=readers[yyy].quantity; ++j) {

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

}

break; } } }

printf(\ scanf(\

if (qqq == 1) break; }

if (qq == 6) { break; } }

printf(\ scanf(\

if (stt[0] == 'Y') break; else continue; } else { nad++;

printf(\ scanf(\ printf(\ scanf(\

while (amp1[string(aid)] == 1) {

printf(\id has been registered, please change.\\n\

printf(\ scanf(\ printf(\ scanf(\ }

amp1[string(aid)] = 1;

amp[string(aid)] = string(apw);

14


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

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

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

马上注册会员

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