ACM——Chasing problem

Introduction

The origin problem called BiliBili, ACFun… And More!is put on the website http://acm.uestc.edu.cn.It says that a man want to play and watch video but he has to replay from the beginning if the buffered part is already played when the video is not finished.You should calculate the total time.

Input

The first line of input contains a number TT, indicating the number of test cases. (T≤1000T≤1000).For each case, there will be four integers XX, YY, TT and SS, which is the playing speed, downloading speed, the time kennethsnow will wait before playing, and the total size of video, given in KB. (1≤X,Y,T≤201≤X,Y,T≤20, 1≤S≤1001≤S≤100).

Output

For each case, output Case #i: first. (ii is the number of the test case, from 11 to TT). Then output the time kennethsnow needs to finish watching, in decimals, round to 33 decimal places.

Theory

This problem is totally a math problem.So let’s just calculate it first.

We assume the play speed is faster than buffer speed.So we can calculate the time $T_1$ as follow:

We calculate for the first time:

$$XT_1=TY+YT_1$$

And we can know from above:

$$T_1=\frac{1}{X-Y}TY$$

After the first time is finished,he has to restart from the beginning and then we calculate for the second time:

$$XT_2=TY+YT_1+YT_2$$

And we can still know from above:

$$T_2=\frac{X}{X-Y}TY$$

In fact we can see the law inside it:

$$T_n=\frac{X^{n-1}}{(X-Y)^n}$$

It’s a equidistant series,which means we can use the formula to calculate its summary:

$$Formula:S_n=\frac{1-q_n}{1-q}$$

$$the　variable　q　is　equal　ratio$$

Now we got everything but the variable n,which means the number of times for totally play.We use the following formula:

$$n = ceil(\log_{S / (Y * T) }{X / (X - Y)})$$

$$ceil　 means　get　the　smallest　number　among　the　numbers　bigger　than　the　result　of　parameter$$

The last thing you have to notice is that the real time consumed $$T=S_n+S/X$$

$$S/X　is　the　time　of　last　time　he　play$$

Eventually,you just need to trans the theory into code,and the following is my code:

    #include "iostream"
    #include "cmath"
    #include "cstdlib"
    using namespace std;

    int main(int argc, char const *argv[])

    {
        int T;
        double time;
        double X,Y,S;
        int case_number;
        cin >> case_number;

        cout.setf(ios::fixed);
        cout.setf(ios::showpoint);
        cout.precision(3);

        for(int i=1;i<=case_number;i++)
        {
            cin >> X >> Y >> T >> S;
            if((X<=Y) || (Y*T>=S))
                time = S/X;
            else{
                int n = ceil(log(S / (Y * T)) / log(X / (X - Y)));
                time = T*(pow(X/(X-Y),n-1)-1) + S/X;
            }
            cout << "Case #" << i << ": " << time << endl;
        }
        return 0;
    }