1. 程式人生 > >codeforces 936A Save Energy!

codeforces 936A Save Energy!

http://www.elijahqi.win/2018/02/26/cf936a/
Julia is going to cook a chicken in the kitchen of her dormitory. To save energy, the stove in the kitchen automatically turns off after k minutes after turning on.

During cooking, Julia goes to the kitchen every d minutes and turns on the stove if it is turned off. While the cooker is turned off, it stays warm. The stove switches on and off instantly.

It is known that the chicken needs t minutes to be cooked on the stove, if it is turned on, and 2t minutes, if it is turned off. You need to find out, how much time will Julia have to cook the chicken, if it is considered that the chicken is cooked evenly, with constant speed when the stove is turned on and at a constant speed when it is turned off.

Input
The single line contains three integers k, d and t (1 ≤ k, d, t ≤ 1018).

Output
Print a single number, the total time of cooking in minutes. The relative or absolute error must not exceed 10 - 9.

Namely, let’s assume that your answer is x and the answer of the jury is y. The checker program will consider your answer correct if .

Examples
Input

Copy
3 2 6
Output
6.5
Input

Copy
4 2 20
Output
20.0
Note
In the first example, the chicken will be cooked for 3 minutes on the turned on stove, after this it will be cooked for . Then the chicken will be cooked for one minute on a turned off stove, it will be cooked for . Thus, after four minutes the chicken will be cooked for . Before the fifth minute Julia will turn on the stove and after 2.5 minutes the chicken will be ready .

In the second example, when the stove is turned off, Julia will immediately turn it on, so the stove will always be turned on and the chicken will be cooked in 20 minutes.

按照題意模擬即可 我的做法是首先求出d的多少倍可以完全覆蓋k 然後把這個看作一個週期 算一下週期內對食物能夠烤熟百分之多少 然後看一下總共有幾個這樣的迴圈 最後處理一下結尾 討論一下即可 怎樣處理迴圈的 我為了避免精度問題 選擇 分析式子首先將左右兩邊*2t

#include<cstdio>
#define eps 1e-10
double k,d,t;
int main(){
//  freopen("c.in","r",stdin);
    scanf("%lf%lf%lf",&k,&d,&t);
    double ti=(long long)((k-1)/d)+1;double p=ti*d;
    double ans=0;double tim=(long long)(2*t/(p+k));
    ans+=tim*p;double rest=2*t-(p+k)*tim;
    if (rest<2*k) ans+=rest/2;else ans+=k,ans+=rest-2*k;
    printf("%.10f",ans);
    return 0;
}