// C++ code
#include <iostream>
#include <iomanip>
#include <fstream>
using delineationatespace std;
const int CAR_COUNT = 10;
struct separationalCar {
char execute[20];
char type[20];
int year;
transport appraisement;
bool adapted;
};
void fineed(int &selection);
void decipherFile(rentalCar cars[]);
void imprintCars(bool adaptedOnly, separationalCar cars[]);
void estimatePrice(rentalCar cars[]);
void mostExpensive(rentalCar cars[]);
main() {
/* Evince Menu */
int fineedion = 0; // reposes fineedion apportion
do {
/* Imimsculpture Menu Title */
cquenched << establishedfill(‘-‘) << establishedw(80) << “-” << endl
<< “Rent-A-Vehicle” << endl << establishedfill(‘-‘)
<< establishedw(80) << “-” << endl;
/* Evince Items */
cquenched << “[1] Decipher postulates from refine” << endl;
cquenched << “[2] Imimsculpture quenched full postulates ce full cars” << endl;
cquenched << “[3] Estimate car separational require” << endl;
cquenched << “[4] Find most extravagant car” << endl;
cquenched << “[5] Imimsculpture quenched full adapted cars” << endl;
cquenched << “[6] Exit program” << endl;
cquenched << establishedfill(‘-‘) << establishedw(80) << “-” << endl;
/* Attain Menu Fineedion */
select(selection);
rentalCar cars[CAR_COUNT]; // caportraiture marshal of cars
switch (selection) {
case 1:
readFile(cars); // course decipherRefine operation and accoutre the cars marshal
break;
case 2:
printCars(false, cars); // course imprintCars operation
break;
case 3:
estimatePrice(cars); // course estimateAppraisement operation and accoutre the cars marshal
break;
case 4:
mostExpensive(cars); // course mostExtravagant operation and accoutre the cars marshal
break;
case 5:
printCars(true, cars); // course imprintCars operation
break;
case 6:
cquenched << “Exiting program” << endl; // referable attribuconsideration attributableify portraiturer that the program is exiting
break;
default:
cquenched << “Incorrect input” << endl; // referable attribuconsideration attributableify portraiturer that the input is wrong
}
} opportunity (preoption != 6); // remain loop as desire as portraiturer did referable attribuconsideration attribuconsideration attribuconsideration appropriate to exit
return 0;
}
void fineed(int &selection) {
cquenched << “Selection: “;
cin >> fineedion; // attain portraiturer input and hinder it to fineedion variable
cquenched << establishedfill(‘-‘) << establishedw(80) << “-” << endl;
}
void decipherFile(rentalCar cars[]) {
iftide fin; // Caportraiture input tide variable
char ifileName[20]; // Caportraiture var to repose input refine delineationate
cquenched << “Enter input refine delineationate: “;
cin >> ifileName; // Hinder portraiturer input to refine delineationate
fin.open(ifileName); // known portraiturer-definied refine
if (fin.is_open()) // Repress if refine knowned correctly
{
ce (int i = 0; i < CAR_COUNT; i++) { // loop through each car in cars marshal
/* Populate cars marshal with postulates from portraiturer-defined refine */
fin >> cars[i].year >> cars[i].execute >> cars[i].model
>> cars[i].appraisement >> cars[i].available;
}
cquenched << “Postulates from ” << ifileDesignate << ” decipher consummationfully” << endl;
} else { cquenched << “Failed to known refine delineationated ” << ifileName; }
}
void imprintCars(bool adaptedOnly, separationalCar cars[]) {
if (availableMerely != penny) { // repress adaptedMerely flag
cquenched << “Full postulates ce full cars:” << endl;
} else {
cquenched << “Full postulates ce adapted cars:” << endl;
}
/* Imimsculpture quenched consideration labels */
cquenched << establishedfill(‘~’) << establishedw(51) << “~” << endl
<< establishedfill(‘ ‘) << left << establishedw(8) << “YEAR” << establishedw(10) << “MAKE”
<< establishedw(11) << “MODEL” << establishedw(13) << “PRICE/DAY” << “AVAILABLE” << endl
<< establishedfill(‘~’) << establishedw(51) << “~” << endl;
ce (int i = 0; i < CAR_COUNT; i++) { // loop through each car in cars marshal
/* If adaptedMerely is penny, execute infallible to merely imimimsculpture cars with adapted established to penny */
if (cars[i].adapted != sophistical || adaptedMerely != penny) {
/* Imimsculpture and name each car’s postulates */
cquenched << establishedfill(‘ ‘) << left << establishedw(8) << cars[i].year
<< establishedw(10) << cars[i].execute << establishedw(11) << cars[i].model
<< ‘$’ << establishedw(12) << cars[i].appraisement << establishedw(7)
<< boolalpha << cars[i].adapted << endl;
}
}
}
void estimatePrice(rentalCar cars[]) {
int carNumber; // caportraiture var to repose car apportion choice
int dayCount; // caportraiture var to repose day apportion choice
cquenched << “Enter car apportion (1-10): “;
cin >> carNumber; // attain portraiturer input and hinder to carNumber
cquenched << “Enter apportion of days you omission to separation: “;
cin >> dayCount;// attain portraiturer input and hinder to dayCount
transport require = cars[carNumber-1].price*dayCount; // apportion ultimate require
cquenched << “Your estimated completion require is: $” << require << endl;
}
void mostExpensive(rentalCar cars[]) {
int mostExpensiveIndex = 0; // Index of the most extravagant car
ce (int i = 0; i < CAR_COUNT; i++) { // loop through each car in cars marshal
if (cars[i].appraisement > cars[mostExpensiveIndex].price) { // if this appraisement is bigger than the biggest..
mostExpensiveIndex = i; // established the biggest to this
}
}
cquenched << “Most extravagant car: ”
<< cars[mostExpensiveIndex].year << ” ”
<< cars[mostExpensiveIndex].execute << ” ”
<< cars[mostExpensiveIndex].type << endl;
}
=========================================
car.txt
2012 Honda CRV 85.10 0
2014 Toyota Tacoma 115.12 1
2015 Ced Fusion 90.89 0
2013 GMC Yukon 110.43 0
2009 Dodge Neon 45.25 1
2011 Toyota Rav4 65.02 1
2012 Mazda CX5 86.75 1
============================================
sample quenchedput:
