xtu summer individual 6 B - Number Busters
Number Busters
64-bit integer IO format: %I64d Java class name: (Any)
Arthur took a group of four integers a, b, w, x (0 ≤ b < w, 0 < x < w) and Alexander took integer с. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b ≥ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c ≤ a.
Input
The first line contains integers a, b, w, x, c (1 ≤ a ≤ 2·109, 1 ≤ w ≤ 1000, 0 ≤ b < w, 0 < x < w, 1 ≤ c ≤ 2·109).
Output
Print a single integer — the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Sample Input
4 2 3 1 6
2
4 2 3 1 7
4
1 2 3 2 6
13
1 1 2 1 1
0
Source
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cstdlib> 5 #include <vector> 6 #include <climits> 7 #include <algorithm> 8 #include <cmath> 9 #define LL long long 10 #define INF 0x3f3f3f 11 using namespace std; 12 double a,b,w,x,c; 13 int main(){ 14 while(~scanf("%lf %lf %lf %lf %lf",&a,&b,&w,&x,&c)){ 15 double ans = ceil((w*c-w*a-b)/(w-x)); 16 printf("%.0f\n",c<=a?0:ans); 17 } 18 return 0; 19 }
相关文章
- Leetcode: Create Maximum Number
- POJ 2104 K-th Number
- 1019 General Palindromic Number (20 分) 【难度: 简单 / 知识点: 判断回文】
- JavaScript - <input> 纯数字(type=“number“)输入限制长度、最小值、最大值或多条件同时限制
- number (2)编译错 (类的大小写错误) Filewriter cannot be resolved to a type
- [geeksforgeeks] Count the number of occurrences in a sorted array
- [LeetCode] 792. Number of Matching Subsequences 匹配的子序列的个数
- [LintCode] Letter Combinations of a Phone Number 电话号码的字母组合
- Sql 四大排名函数(ROW_NUMBER、RANK、DENSE_RANK、NTILE)简介
- 996. Number of Squareful Arrays
- 202. Happy Number