描述
定义一个包含图书信息(书号、书名、价格)的顺序表,读入相应的图书数据来完成图书信息表的创建,然后根据指定的待入库的新图书的位置和信息,将新图书插入到图书表中指定的位置上,最后输出新图书入库后所有图书的信息。
输入
总计n+3行。首先输入n+1行,其中,第一行是图书数目n,后n行是n本图书的信息(书号、书名、价格),每本图书信息占一行,书号、书名、价格用空格分隔,价格之后没有空格。其中书号和书名为字符串类型,价格为浮点数类型。之后输入第n+2行,内容仅为一个整数,代表待入库的新图书的位置序号。最后输入第n+3行,内容为新图书的信息,书号、书名、价格用空格分隔。
输出
若插入成功: 输出新图书入库后所有图书的信息(书号、书名、价格),总计n+1行,每行是一本图书的信息,书号、书名、价格用空格分隔。其中价格输出保留两位小数。 若插入失败: 只输出以下提示:抱歉,入库位置非法!
输入样例 1
7 9787302257646 Data-Structure 35.00 9787302164340 Operating-System 50.00 9787302219972 Software-Engineer 32.00 9787302203513 Database-Principles 36.00 9787810827430 Discrete-Mathematics 36.00 9787302257800 Data-Structure 62.00 9787811234923 Compiler-Principles 62.00 2 9787822234110 The-C-Programming-Language 38.00
输出样例 1
9787302257646 Data-Structure 35.00 9787822234110 The-C-Programming-Language 38.00 9787302164340 Operating-System 50.00 9787302219972 Software-Engineer 32.00 9787302203513 Database-Principles 36.00 9787810827430 Discrete-Mathematics 36.00 9787302257800 Data-Structure 62.00 9787811234923 Compiler-Principles 62.00
输入样例 2
7 9787302257646 Data-Structure 35.00 9787302164340 Operating-System 50.00 9787302219972 Software-Engineer 32.00 9787302203513 Database-Principles 36.00 9787810827430 Discrete-Mathematics 36.00 9787302257800 Data-Structure 62.00 9787811234923 Compiler-Principles 62.00 9 9787822234110 The-C-Programming-Language 38.00
输出样例 2
Sorry,the position to be inserted is invalid!
#include<iostream>
#include<string>
#include<stdio.h>
#include<iomanip>
#define MAXSIZE 1000
#define OK 1
#define OVERFLOW -2
using namespace std;
typedef struct
{
string isbn;
string name;
double price;
}Book;
typedef struct
{
Book *elem;
int length;
}SqList;
int InitList(SqList &L)
{
L.elem=new Book[MAXSIZE];
if(!L.elem)exit(OVERFLOW);
L.length=0;
return OK;
}
int Input(SqList &L)
{
int i,number,count;
cin>>number;
for( i = 0 ; i<number; i++)
{
cin>>L.elem[i].isbn>>L.elem[i].name>>L.elem[i].price;
L.length++;
}
return OK;
}
int Insert(SqList &L){
string isbn,name;
float price;
int loc,i;
cin>>loc;
cin>>isbn>>name>>price;
if(loc<1||loc>L.length)
cout<<"Sorry,the position to be inserted is invalid!"<<endl;
else
{
for(i = L.length ; i>loc-2 ;i--)
L.elem[i+1] = L.elem[i];
L.length++;
L.elem[loc-1].isbn = isbn;
L.elem[loc-1].name = name;
L.elem[loc-1].price = price;
for(i = 0;i<L.length;i++){
cout<<L.elem[i].isbn <<" "<< L.elem[i].name <<" "<<fixed<<setprecision(2)<<L.elem[i].price<<endl;
}
}
return OK;
}
int main()
{
SqList L;
InitList(L);
Input(L);
Insert(L);
return 0;
}