HDU 5417 Victor and Machine

本博客介绍了一个关于机器弹球问题的算法实现,包括输入参数解释、模拟过程和输出结果。通过代码示例,详细展示了如何解决在特定时间间隔内弹出小球并考虑维护时间的问题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5417

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 xyw and n. Their meanings are shown above。

1x,y,w,n100.
 

 

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
题意:
Victor有一个机器,这个机器每次开启的瞬间会弹出一个小球,之后每隔ww秒会弹出一个小球。因为机器不是很完善,该机器每开启xx秒就得关闭yy秒进行调整,在机器关闭的瞬间可能会有小球弹出,关闭之后一直到下一次开启之前都不会有小球弹出。

00时刻,机器第一次开启,Victor想要知道第nn个小球弹出的时刻,你能够告诉他吗?
大水题,模拟。
 1 #include <iostream>
 2 using namespace std;
 3 
 4 int main()
 5 {
 6     int n,w,x,y;
 7     while (cin>>x>>y>>w>>n)
 8     {
 9           int t=0,tt=0;//tt记录离刚开机多长时间 
10           n--;
11           while (n>0)
12           {
13                 tt+=w;
14                 if (tt<x)
15                 {
16                          n--;
17                          t+=w;
18                 }
19                 else if (tt==x)
20                 {
21                      n--;
22                      t+=w;
23                      if (n>0)
24                      {
25                              tt=0;
26                              t+=y;
27                              n--;
28                      }
29                 }
30                 else
31                 {
32                     t+=w+x+y-tt;
33                     tt=0;
34                     n--;
35                 }
36           }
37           cout <<t<<endl;
38     }
39     return 0;
40 }
41                     
View Code

 

转载于:https://www.cnblogs.com/arno-my-boke/p/4769941.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值