#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>

//#pragma GCC optimize("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")

#define ll long long
#define ld  long double
using namespace std;

const int N = 2e5 + 5, lg = 19, mod = 998244353;
const int OO = 1e9 + 5;

ld x, T;

ld work(ld t) {
    ld P_t;
    if (t > T / 3) {
        P_t = 100;
    } else if (t > T / 6) {
        P_t = x + ((t - T / 6) / (T / 3 - T / 6)) * (100 - x);
    } else {
        P_t = (t / T) * 6 * x;
    }
    return (T - t) * P_t;
}

ld bs(ld st, ld en) {
    for (int i = 0; i < 100; ++i) {
        ld m1 = st + (en - st) / 3;
        ld m2 = en - (en - st) / 3;
        if (work(m1) > work(m2)) {
            en = m2;
        } else {
            st = m1;
        }
    }
    return en;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> x >> T;
    ld ans1 = bs(0, T / 3);
    ld ans2 = bs(T / 6, T / 6);
    ld ans = ans1;
    if (work(ans2) > work(ans)) {
        ans = ans2;
    }
    cout << fixed << setprecision(10);
    cout << work(ans) << '\n';
    return 0;
}