#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <stack>
using namespace std;
struct Book {
string bookno;
string name;
double price;
};
int main() {
Book book[1000];
int n; //书的数量
cin >> n;
int j=0;
while(j<n) {
cin>>book[j].bookno ;
cin>>book[j].name ;
cin>>book[j].price ;
++j;
}
//逆序输出
for (int i = n - 1; i >= 0; i--) {
cout << book[i].bookno<<" ";
cout << book[i].name << " ";
printf("%.2lf\n", book[i].price);
}
}
BJFU 207基于顺序存储结构的图书信息表的逆序存储
最新推荐文章于 2024-03-07 22:40:49 发布