hdu 5417 Victor and Machine

简介:

click here ~~


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 www seconds. However, the machine has some flaws, every time after xxx seconds of process the machine has to turn off for yyy 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 000 second, the machine opens for the first time. Victor wants to know when the nnn-th ball will be popped out. Could you tell him?


Input


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

Each line has four integers xxx, yyy, www and nnn. Their meanings are shown above1≤x,y,w,n≤1001\leq x,y,w,n\leq 1001≤x,y,w,n≤100.


Output


For each test case, you should output a line contains a number indicates the time when the nnn-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

题目大意:Victor有一个机器,这个机器每次开启的瞬间会弹出一个小球,之后每隔www秒会弹出一个小球。因为机器不是很完善,该机器每开启xxx秒就得关闭yyy秒进行调整,在机器关闭的瞬间可能会有小球弹出,关闭之后一直到下一次开启之前都不会有小球弹出。

0时刻,机器第一次开启,Victor想要知道第nnn个小球弹出的时刻,你能够告诉他吗?

解题思路:就是自己推一下就行了。。。
直接上代码

#include <iostream>

using namespace std;

int main()
{
    int x, y, w, n;
    while(cin>>x>>y>>w>>n)
    {
        n -= 1;
        int ans, tmp1, tmp2;
        if(w > x)
            ans = (x+y)*n;
        else
        {
            tmp1 = n % ((int)(x/w)+1);
            tmp2 = n / (x/w+1);
            ans = tmp2*(x+y)+w*tmp1;
        }
        cout<<ans<<endl;
    }
    return 0;
}
目录
相关文章
UVa1531 - Problem Bee
UVa1531 - Problem Bee
49 0
UVa11958 - Coming Home
UVa11958 - Coming Home
47 0
|
机器学习/深度学习 自然语言处理
|
Web App开发 算法
POJ 1276 Cash Machine 解答
题目详见: http://poj.org/problem?id=1276 这道题与POJ 1014同属一类题, 区别在于POJ 1014的解是求恰好等于容量的情况, 而这道题较为常规, 同时这道题的数据较大, 套用我在博客http://blog.
895 0
|
机器学习/深度学习
hdu 1198 Farm Irrigation
点击打开hdu 1198 思路: 并查集 分析: 1 题目给定11快小方形,然后给定一个n*m的描述求n*m矩阵内的连通分量的个数 2 首先我们应该解决怎么保存11块小方形,我们可以利用一个思维的分量来描述,比如A我们描述成{1,0,0,...
748 0
|
C++
uva 12096 The SetStack Computer
点击打开链接uva 12096 思路: STL模拟 分析: 1 题目给定5种操作,每次输出栈顶集合的元素的个数 2 利用stack和set来模拟,set保存集合的元素。
856 0
uva 1329 Corporative Network
点击打开链接uva 1329 思路: 带权并查集 分析: 1 看懂题目就是切菜了 代码: #include #include #include #include using namespace std; const int MAXN...
876 0
uva 100 The 3n+1 problem
题目链接: http://www.programming-challenges.com/pg.php?page=studenthome /* The 3n+1 problem 计算每个数的循环节长度,求给定区间的循环节长度的最大值。 */ #include&lt;iostream&gt; #include&lt;stdio.h&gt; using namespace std;
1165 0