#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

const ld eps = 1e-18;

ll x, t;
ld m, tover6, tover3;

int dcmp(ld a, ld b)
{
    // a == b : 0
    // a != b : != 0
    // a > b : 1
    // a < b : -1
    // a >= b : != -1
    // a <= b : != 1
    return fabs(a - b) <= eps ? 0 : a < b ? -1 : 1;
}

ld solve(ld sleep)
{
    ld work = t - sleep;
    if(dcmp(sleep, tover3) != -1)
        return work * (ld) 100.0;
    else if(dcmp(sleep, tover6) != -1) // [t/6, t/3]
    {
        ld ada2 = (ld) x + m * (sleep - tover6);
        return work * ada2;
    }
    else // [0, t/6 - eps]
        return work * (sleep / tover6 * x);
}

void doWork()
{
    cin >> x >> t;
    tover6 = (ld) t / (ld) 6.0, tover3 = (ld) t / (ld) 3.0;
    m = (100.0 - x) / tover6;

    int itr = 0;
    ld s = 0, e = t, m1, m2, d, x1, x2;
    while(itr < 300)
    {
        itr++;
        d = (e - s) / (ld) 3.0;
        m1 = s + d, m2 = e - d;
        x1 = solve(m1), x2 = solve(m2);
        if(dcmp(x1, x2) == 1)
            e = m2;
        else
            s = m1;
    }
    cout << fixed << setprecision(8) << max(solve(s), solve(e));
}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}