bc #52 div 2 A ||hdoj5417 Victor and Machine (模拟)

Victor and Machine

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

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

 

 

Source

BestCoder Round #52 (div.2)

 

傻逼模拟题

我做了半小时....

sssssad

/*************************************************************************
    > File Name: code/bc/#52/1001.cpp
    > Author: 111qqz
    > Email: rkz2013@126.com 
    > Created Time: 2015年08月22日 星期六 18时51分44秒
 ************************************************************************/

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<stack>
#include<cctype>
#define y1 hust111qqz
#define yn hez111qqz
#define j1 cute111qqz
#define ms(a,x) memset(a,x,sizeof(a))
#define lr dying111qqz
using namespace std;
#define For(i, n) for (int i=0;i<int(n);++i)  
typedef long long LL;
typedef double DB;
const int inf = 0x3f3f3f3f;
const int N=1E6+7;
int main()
{
  #ifndef  ONLINE_JUDGE 
    freopen("in.txt","r",stdin);
  #endif
    int x,y,w,n;
    while (scanf("%d%d%d%d",&x,&y,&w,&n)!=EOF){
    int num = 1;
    int cnt;
    int q;
    bool on = true;
    bool flag = false;
    int t = 0;
    while (t<N&&!flag){
        if (num==n) {
        cout<<t<<endl;
        flag = true;
        break;
        }
        cnt = t+x;
        q =  0;
        while (t<cnt){
        q++;
        t++;
        if (q%w==0){
//             cout<<"aaat:"<<t<<endl;
             num++;
        }
        if (num == n){
        cout<<t<<endl;
        flag = true;
        break;
        }
        }
        on = false;
        t = t + y;
        on = true;
        num++;
        if (num==n){
        cout<<t<<endl;
        flag = true;
        }

    }

    }


    
  
  
 #ifndef ONLINE_JUDGE  
  fclose(stdin);
  #endif
    return 0;
}