Submission #1711005

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

double power(double a, ll n) {
  if(n == 0) return 1;
  if(n % 2 == 0) return power((a * a), n / 2);
  return (a * power(a, n - 1));
}


int main(void) {
  double P;
  ll N;
  cin >> P >> N;

  printf("%.15lf\n", 0.5 * (1 - power(1 - P * 2, N)));
}

Submission Info

Judge Result