Напишите класс, который выводит на экран в первой строке три знака «+», во второй – четыре знака «! », в третьей – два знака «*».язык (java)

11010000101000011101000010111010110100001011111011010001100000001101000010111110001000001101000010111101110100001011000011010001100000011101000110000010110100011000001111010000101111111101000010111000110100011000001000100000110100001011110111010000101111101101000010110010110100011000101111010000101110010010000011010000101100111101000010111110110100001011010000101110001000001101000010011101110100001011000000100000110100001001110111010000101111101101000010110010110100011000101111010000101110010010000011010000101100111101000010111110110100001011010000100000110100001011101111010001100011101101000010110100110100001011100000100000110100001011010011010000101100001101000110000000110100011000111111010001100000100010000011010000101101001101000110000000110100011000001111010000101100110010000011010000101101001101000110000000110100011000001111010000101100111101000110000011001000001101000010111111110100001011111011010000101101001101000010110000110100011000000011010000101110101101000010111000001011100010000011010000100101001101000010110101110100001011010000100000110100001001110011010000101111101101000110000000110100001011111011010000101101110010000011010000101111111101000010111110110100001011010011010000101100001101000110000000110100001011100011010000101110110010000011010000101111001101000010111101110100001011010100100000110100001011110111010000101100000010000011010000100111011101000010111110110100001011001011010001100010111101000010111001001000001101000010110011110100001011111011010000101101000010000011010001100000001101000010110000110100001011010011010000101110001101000010111110110100011000001111010000101111111101000110000000110100001011000011010000101100101101000010111011110100011000111111010000101101011101000010111100110100011000001111010001100011100010000011010000101111001101000010110000110100011000100011010000101110001101000010111101110100011000001100101110001000001101000010101111001000001101000010111011110100011000111011010000101100011101000010111011110100011000111000100000110100001011101011010001100000111101000110001000110100001011000011010001100000101101000110001100001000001101000010110000110100001011111111010000101101011101000010111011110100011000110011010001100000011101000010111000110100001011110111010001100010110010000011010000101111011101000010110000001000001101000010011101110100001011111011010000101100101101000110001011110100001011100100100000110100001011001111010000101111101101000010110100001011100010000011010000100111011101000010110000001000001101000010011101110100001011111011010000101100101101000110001011110100001011100100100000110100001011001111010000101111101101000010110100001000001101000010111000110100011000000111010000101111111101000010111110110100001011101111010000101111011101000110001111110100011000111011010001100000101101000110000001110100011000111100100000110100001011110011010000101101011101000110000111110100011000001011010001100010110010111000100000110100001001110111010000101100000010000011010000100111011101000010111110110100001011001011010001100010111101000010111001001000001101000010110011110100001011111011010000101101000010000011010000101111111101000110000000110100001011111011010000101110001101000110000001110100011000010111010000101111101101000010110100110100011000111111010001100000100010000011010001100001111101000110000011110100001011010011010000101101011101000110000001110100001011000000101110

вот удачи))

Код#include <iostream>#include <utility>#include <numeric>#include <vector>class Beast {    int trigger;    double aggression;    double rage_aggression;public:    Beast() = default;    Beast(int trigger, double aggression, double range_aggression)    : trigger(trigger), aggression(aggression), rage_aggression(range_aggression)    { }    Beast(const Beast&) = default;    Beast(Beast&&) = default;    Beast& operator=(const Beast&) = default;    Beast& operator=(Beast&&) = default;    [[nodiscard]] double calculate_aggression(unsigned long amount) const {        return amount > trigger ? rage_aggression : aggression;    }    void ReadFrom (std::istream& is) {        is >> aggression >> rage_aggression >> trigger;    }    void WriteTo(std::ostream &os) const {        os << aggression << " " << rage_aggression << " " << trigger;    }};std::istream& operator >>(std::istream &is, Beast &cls) {    cls.ReadFrom(is);    return is;}std::ostream& operator <<(std::ostream &os, const Beast &cls) {    cls.WriteTo(os);    return os;}class Cage {    double durability;    std::vector<Beast> container;public:    explicit Cage(double durability, std::vector<Beast> container)    : durability(durability), container(std::move(container))    { }    Cage(const Cage&) = default;    Cage(Cage&&) = default;    Cage& operator=(const Cage&) = default;    Cage& operator=(Cage&&) = default;    [[nodiscard]] double calculate_aggressive() const {        auto amount = container.size();        if (amount == 0) return 0;        return std::accumulate(container.begin(), container.end(), 0.0,        [amount](double total_aggressive, const Beast & beast){            return total_aggressive + beast.calculate_aggression(amount);        });    }    [[nodiscard]] bool is_it_normal() const {        auto aggressive = calculate_aggressive();        return aggressive <= durability;    }    [[nodiscard]] int get_capacity() const {        return container.size();    }    [[nodiscard]] double get_durability() const {        return durability;    }};template <typename T>void subsetsUtil(std::vector<T>& A, std::vector<std::vector<T> >& res,                 std::vector<T>& subset, int index){    res.push_back(subset);    for (int i = index; i < A.size(); i++) {        // include the A[i] in subset.        subset.push_back(A[i]);        // move onto the next element.        subsetsUtil(A, res, subset, i + 1);        // exclude the A[i] from subset and triggers        // backtracking.        subset.pop_back();    }}template <typename T>std::vector<std::vector<T>> P(std::vector<T>& A){    std::vector<T> subset;    std::vector<std::vector<T>> res;    int index = 0;    subsetsUtil(A, res, subset, index);    return res;}int main () {    int n, s;    Beast noname{};    std::vector<Beast> set_of_beasts;    std::cin >> n >> s;    for (auto i = 0; i < n; ++i) {        std::cin >> noname;        set_of_beasts.push_back(noname);    }    auto selections = P(set_of_beasts);    std::vector<Cage> variants;    std::transform(selections.begin(), selections.end(), std::back_inserter(variants), [s](std::vector<Beast> &selection){        return Cage(s, selection);    });    std::vector<Cage> true_variants;    std::copy_if(variants.begin(), variants.end(), std::back_inserter(true_variants), [](Cage& x) {return x.is_it_normal();});    auto the_best_of_the_best_variant = *std::max_element(true_variants.begin(), true_variants.end(), [](Cage & s1, Cage & s2){        return s1.get_capacity() < s2.get_capacity();    });    std::cout << the_best_of_the_best_variant.get_capacity();    return 0;}