Submission #997134

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(ut)(b);i++)
#define REP(i,b) FOR(i,0,b)
#define ALL(c) c.begin(),c.end()
#define PB push_back
#define cat //cout << __LINE__ << endl;
using namespace std;
typedef long long LL;
typedef double ld;
typedef int ut;
typedef vector<ut> VI;
typedef pair<ut,ut> pr;
typedef pair<ut,pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef priority_queue<pr,Vpr,greater<pr> > PQ;
using namespace std;
const int SIZE=1e6;
const LL INF=1LL<<58;
const LL p=1e9+7;
vector<string> nums;
int K;
string s;
double per;
double solve(LL x,LL p){
	if(x&1){return 1+solve(x-1,p)*per+solve(x+1,p)*(1-per);}
	double need=x/2;
	return need/per;
}
int main(){
	LL x,p;
	cin >> x >> p;
	per=p/100.0;
	printf("%12.12f\n",solve(x,p));
	return 0;
}

Submission Info

Judge Result