All Tracks Math Problem

Climbing Stairs
Tag(s):

Ad-Hoc, Data Structures, Easy, Math, Mathamatics

Problem
Editorial
Analytics

Alice is climbing stairs. There are total N stairs. She climbs A stairs upwards in day and she comes downstairs in night by B stairs. Find number of days she will take to reach the top of staircase.

Input:
First and only line contains three space separated integers denoting A, B, N.

Output:
Print only one line of output denoting the answer to the question.

Constraints:
1 ≤ B<A≤N ≤ 109

SAMPLE INPUT
5 1 6
SAMPLE OUTPUT
2
Time Limit: 1,0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: Bash, C, C++, C++14, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala, Swift, Swift-4.1, TypeScript, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

This Problem was Asked in

Challenge Name

GSF Hacks

OTHER PROBLEMS OF THIS CHALLENGE
Уведомления
View All Notifications

?