HDU 3809

题意:

x1 = x - sqrt(y);

y1 = y - sqrt(x);

已知x1, y1, 求x, y, 其中x >= 0, y >= 0.

 

这个方程正常方法是难以解决的, 将方程转化为

x = x1 + sqrt(y);

y = y1 + sqrt(x);

可以发现x >= x1, y >= y1.

所以可以用迭代法无限逼近x, y

x = x + sqrt(y);

y = y + sqrt(x);

x, y初始化为x1, y1.

 

#include <iostream> #include <cmath> using namespace std; const double eps = 1e-8; int main() { int test, cas; double x1, y1, tx, ty, x, y; cin >> test; for (cas = 1; cas <= test; cas++) { cin >> x1 >> y1; x = x1; y = y1; do { tx = x; ty = y; x = x1 + sqrt(ty); y = y1 + sqrt(tx); } while (fabs(x - tx) > eps || fabs(y - ty) > eps); printf("Case %d: %.6f %.6f/n", cas, x, y); } return 0; }