VehicleClassificationProlog.cpp

#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

struct Vehicle {
    string name;
    set<string> attrs;
};

string classifyVehicle(const Vehicle& v) {
    const set<string> carAttrs = {"4 wheels", "engine", "passenger"};
    const set<string> bikeAttrs = {"2 wheels", "engine"};
    const set<string> truckAttrs = {"6 wheels", "cargo"};
    const set<string> busAttrs = {"4 wheels", "engine", "public transport"};

    if (includes(v.attrs.begin(), v.attrs.end(), carAttrs.begin(), carAttrs.end())) {
        return "car";
    }
    if (includes(v.attrs.begin(), v.attrs.end(), bikeAttrs.begin(), bikeAttrs.end())) {
        return "bike";
    }
    if (includes(v.attrs.begin(), v.attrs.end(), truckAttrs.begin(), truckAttrs.end())) {
        return "truck";
    }
    if (includes(v.attrs.begin(), v.attrs.end(), busAttrs.begin(), busAttrs.end())) {
        return "bus";
    }
    return "unknown vehicle";
}

int main() {
    Vehicle v1{"V1", {"4 wheels", "engine", "passenger"}};
    Vehicle v2{"V2", {"2 wheels", "engine"}};

    cout << v1.name << " is " << classifyVehicle(v1) << '\n';
    cout << v2.name << " is " << classifyVehicle(v2) << '\n';
    return 0;
}