2351.cpp

ZOJ 动态规划算法题目入门与提高 源代码

#include<cstdio>
#include<cmath>

using namespace std;

int main()
{
    freopen("in.txt","r",stdin);
    int N;
    scanf("%d\n",&N);
    double ka,s;int m,n;
    while(N--)
    {
        while(scanf("%lf %lf %d %d",&ka,&s,&m,&n)!=EOF && !(ka==0&&s==0&&m==0&&n==0))
        {
            double f = log10((ka*(-1)+sqrt(ka*ka+4*ka*s*m*n))/(2*n))*-1;
            printf("%.3lf\n",f);
        }
        if(N) printf("\n");
        
    }

}