#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define endl '\n' #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end()) typedef long long ll; typedef long double ld; typedef pair P; typedef complex comp; typedef vector< vector > matrix; struct pairhash { public: template size_t operator()(const pair &x) const { size_t seed = hash()(x.first); return hash()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2); } }; const int inf = 1e9 + 9; const ll mod = 1e9 + 7; const double eps = 1e-8; const double pi = acos(-1); ll n, m; map prime_factor(ll n) { map res; for (ll i = 2; i * i <= n; i++) { while (n % i == 0) { res[i]++; n /= i; } } if (n != 1) res[n] = 1; return res; } ll calc(ll s) { ll k = 0; ll t = s; while (t <= n) { k += n / t; if (t * s < t) break; t *= s; } return k; } void solve() { map pf = prime_factor(m); ll k = inf; for (auto& t : pf) { k = min(k, calc(t.first)/ t.second); } if (n < 30) { double res = 1.0; for (ll i = n; i > 0; i--) res *= i; for (int i = 0; i < k; i++) res /= m; int b = 0; while (res >= 10.0) { b++; res /= 10; } cout << res << "e" << b << endl; } else { double exp = n * log(n) - n + 0.5 * log(2*pi*n) + 1.0 / (12*n); exp -= k * log(m); exp /= log(10); ll b = (ll)exp; cout << pow(10.0, exp - b) << "e" << b << endl; } } void input() { cin >> n >> m; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); input(); solve(); }