yes
Time Limit: 1 seconds
Memory Limit: 256 MB
Rating: 900
Problem StatementThis is Chuck, the triangular yellow bird in Angry Birds. Chuck is famously known for being able to break through multiple wooden obstacles. Chuck is shot off the slingshot with an initial speed of $v$. If Chuck hits a wooden obstacle with speed greater than or equal to $n$, it will break that obstacle, and its speed decreases by $n$. If Chuck hits a wooden obstacle with speed lower than $n$, it will stop immediately. Given integers $v$ and $n$, find how many wooden obstacles Chuck can breakthrough. You may assume that there are an infinite number of wooden obstacles available, so Chuck won’t run out of wooden obstacles to break.
InputYou are given two integers $v$ and $n$ on the first and second lines respectively $(1 \le v, n \le 2 \cdot 10^8)$.
OutputOn the first line, output the answer described in the Problem Statement.
Sample CasesSample Input 1: 8 3 Sample Output 1: 2 Sample Input 2: 28340 39 Sample Output 2: 726Explanation
Not available for this problem.
SourcesKL Coding Cup March 2023 > Angry Birds > Problem 1
Submit | Back