HDU2675 数学 二分

Equation Again

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1455    Accepted Submission(s): 451

Problem Description

This problem’s author is too lazy to write the problem description, so he only give you a equation like X ^(eY) == (eY) ^x, and the value of Y, your task is calculate the value of X. 
Note : here e is the Natural logarithm.

 

Input

Each line will contain one number Y(Y >= 1). Process to end of file.

 

Output

For each case, output X on one line, accurate to five decimal places, if there are many answers, output them in increasing order, if there is no answer, just output “Happy to Women’s day!”.

 

Sample Input

  
  

   
   1
  
  

 

Sample Output

  
  

   
   2.71828
  
  

 

题目大意：求x。

思路：

将方程化简，x放一边，y放一边，然后求导以后发现x的函数是先递减，再增，然后y这里最小值是1，然后肯定有解。

感觉这道题目精度卡的好紧，然后y是浮点数，如果用整数就WA了，还有判断只有一个解的时候要看tmp1和tmp2的之间的差值。

精度问题和y的问题害我了2个小时TAT，惭愧啊

#include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; const double e = 2.718281828459; const int inf = 2000000000; double x, y; bool C(double mid){ if (mid / log(mid) >= e * y / log(e * y)) return true; return false; } void solve(){ double tmp1, tmp2; double lb = 1, ub = e; for (int i = 0; i < 100; i++){ double mid = lb + (ub - lb) / 2; if (C(mid)) lb = mid; else ub = mid; } tmp1 = lb; lb = e, ub = (double)inf; for (int i = 0; i < 100; i++){ double mid = lb + (ub - lb) / 2; if (C(mid)) ub = mid; else lb = mid; } tmp2 = lb; if (tmp2 - tmp1 < 0.000001) printf("%.5f\n", tmp1); else printf("%.5f %.5f\n", tmp1, tmp2); } int main(){ while(scanf("%lf", &y) != EOF){ // if (y == 1) {printf("%.5f\n", e); continue;} solve(); } return 0; } </cmath></algorithm></cstring></cstdio>