栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

zoj 1121 Reserve Bookshelf

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

zoj 1121 Reserve Bookshelf

#include<iostream>#include<map>#include<string.h>#include<stdio.h>using namespace std;bool shelf[50];char title[50][40];int serial[50];map<string,int> books;int number;int placed;int space;char str[40];void remove() {int k = 0;while(placed>space){    if(shelf[k]){shelf[k] = false;placed -= serial[k];}k++;}}void PRINT(){int i;for(i=number-1; i>=0; i--)if(shelf[i]) printf("%s%4dn", title[i], serial[i]);printf("AVAILABLE SHELF SPACE:        %4dnn", space-placed);gets(str);}void ADD(){int k;char ch;for(k=0; k<6; k++) scanf("%c",&ch);gets(title[number]);int thick;sscanf(title[number]+30, "%d", &thick);title[number][30] = 0;placed += thick;serial[number] = thick;books[title[number]] = number;shelf[number] = true;number++;remove();}void CHECKOUT(){int k,i;char ch;scanf("%c",&ch);gets(str);for(i=strlen(str); i<30; i++) str[i]=' ';str[30] = 0;k = books[string(str)];shelf[k] = false;placed -= serial[k];}void RETURN(){int k,i;char ch;for(i=0; i<3; i++) scanf("%c",&ch);gets(str);for(i=strlen(str); i<30; i++) str[i]=' ';str[30] = 0;k = books[string(str)];for(i=0; i<31; i++) title[number][i] = title[k][i];shelf[number] = true;serial[number] = serial[k];placed += serial[number];number++;remove();}int main(){cout<<"Program 2 by team X"<<endl;scanf("%d",&space);placed = 0;number = 0;books.clear();memset(shelf, 0, sizeof(shelf));string command;while(cin>>command){if (command=="PRINT") PRINT();else if(command=="ADD") ADD();else if(command=="CHECKOUT") CHECKOUT();else if(command=="RETURN") RETURN();}cout<<"End of program 2 by team X"<<endl;return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/381059.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号