HDU 5417 数学题

Victor and Machine

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 209    Accepted Submission(s): 119

Problem Description

Victor has a machine. When the machine starts up, it will pop out a ball immediately. After that, the machine will pop out a ball every  w  seconds. However, the machine has some flaws, every time after  x  seconds of process the machine has to turn off for  y  seconds for maintenance work. At the second the machine will be shut down, it may pop out a ball. And while it's off, the machine will pop out no ball before the machine restart.

Now, at the  0  second, the machine opens for the first time. Victor wants to know when the  n -th ball will be popped out. Could you tell him?

 

Input

The input contains several test cases, at most  100  cases.

Each line has four integers  x ,  y ,  w  and  n . Their meanings are shown above。

1≤x,y,w,n≤100 .

 

Output

For each test case, you should output a line contains a number indicates the time when the  n -th ball will be popped out.

 

Sample Input

  
  

   
   2 3 3 3
98 76 54 32
10 9 8 100
  
  

 

Sample Output

  
  

   
   10
2664

   
   
939
   
   
分情况讨论，分的越多越好 正确率越高
   
   

   
   
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
    int x=0,y=0,w=0,n=0;
    while(scanf("%d%d%d%d",&x,&y,&w,&n)!=EOF)
    {
        int sum=0;
        if(x<w)
        {
            printf("%d\n",(n-1)*(x+y));
        }
        else if(x==w)
        {
            if(n%2==1)
            {
                printf("%d\n",(x+y)*(n/2));
            }
            else
            {
                printf("%d\n",x+(x+y)*((n-1)/2));
            }
        }
        else
        {
            int k1=x/w+1;
            int k2=n/k1;
            if(k1*k2==n)
            {
              printf("%d\n",(k2-1)*(x+y)+(n-(k2-1)*k1-1)*w);    
            }
            else
            {
                printf("%d\n",k2*(x+y)+(n-k2*k1-1)*w);
            }
        }
    }
    return 0;
}