/*
    红色树哥增伤理论最大化
*/

#include <iostream>

using namespace std;

int main() {
    double  v = 0.20,  v_t = 15;
    double ct = 0.96, d_ct = 0.20;
    double qj = 0.90, d_qj = 0.10;
    double rz = 1.00, d_rz = 1.00;

    printf("强化属性：%.2lf %.2lf %.2lf\n", 60 / (ct + 6 * d_ct), qj + 2 * d_qj, 15 + rz + 1 * d_rz);

    int d_max = 9;

    double ans_m_max = 0;
    int ans_i = 0, ans_j = 0, ans_k = 0;
    for (int i = 2; i <= 2; ++ i)
    {
        for (int j = 0; j <= d_max - i; ++ j)
        {
            for (int k = 0; k <= d_max - i - j; ++ k)
            {
                double res = (3 + (qj - j * d_qj)) * (1 + v) * (v_t + (rz + k * d_rz));
                //  (60 / (ct + i * d_ct))
                if (res > ans_m_max)
                {
                    ans_m_max = res;
                    ans_i = i, ans_j = j, ans_k = k;
                }
            }
        }
    }

    printf("强化属性：%.2lf %.2lf %.2lf\n", ct + ans_i * d_ct, qj + ans_j * d_qj, rz + ans_k * d_rz);
    printf("伤害：%.2lf\n", ans_m_max);

    return 0;
}

// 60 20 45 15